Quantum computing flashcards
Qubits, gates and circuits you can run in Qiskit, up to error correction and the post-quantum shift.
Beginner friendly, starts from zero
0
Quantum computing at a glance
A quantum computer uses the odd rules of tiny particles to solve some special problems much faster.
Like waves on a pond: a quantum program makes wrong answers cancel out and the right one grow stronger.
Words you will meet
- Qubit
- The quantum version of a bit, able to be a blend of 0 and 1
- Superposition
- That blend of 0 and 1 before you look
- Measurement
- Reading a qubit, which always gives a plain 0 or 1
- Amplitude
- A qubit's weight for 0 or 1, which can be negative
- Interference
- Amplitudes adding up or cancelling out, like waves
- Entanglement
- Qubits linked so their results match up
- Gate
- One step that changes qubits, like flip or blend
- Shot
- One full run of a circuit
The steps
- 1. Start from zero (12 cards): What a quantum computer is, how a qubit differs from a bit, and the plain words behind every circuit.
- 2. Core basics (15 cards): Qubits, superposition, measurement, entanglement and your first circuits that print real results.
- 3. Next steps (16 cards): Two-qubit gates, primitives, transpiling, real hardware, noise and the famous algorithms.
- 4. Go deeper (16 cards): Error correction, hybrid algorithms, advantage claims, resource estimates and post-quantum migration.
All 12 cards in Start from zero
- What is a quantum computer, in one plain sentence?
- A quantum computer is a new kind of computer that uses the odd rules of tiny particles to solve some special problems far faster than normal (classical) computers can.
- What problem does quantum computing try to solve?
- Some problems, like how a new medicine molecule behaves, grow so fast that even the biggest normal computer would take impossibly long. Quantum computers may crack some of these.
- Where do you already meet quantum computing in daily life?
- Not on your desk yet. But your browser is already moving to new quantum-safe locks for logins and payments, because a large quantum computer could one day break today's locks.
- What everyday thing is a quantum computer like?
- Think of waves on a pond. A quantum program sends waves through all the paths of a maze; wrong paths cancel out and the right path grows stronger, so you are likely to find it.
- What are a bit and a qubit?
- A bit is the smallest piece of computer information: 0 or 1, like a switch off or on. A qubit is the quantum version: it can be in a blend of 0 and 1 until you look.
- What are superposition and probability here?
- Superposition is that blend of 0 and 1. When you check the qubit you get 0 or 1 at random, and the probability, the chance of each, is set by the blend, like 50 percent each.
- What do measurement and collapse mean?
- Measurement means reading the qubit. It always gives a plain 0 or 1, and then the blend is gone: the qubit collapses and stays at the answer you saw.
- What are amplitude and interference?
- An amplitude is a qubit's weight for 0 or for 1, and unlike a chance it can be negative. Interference is amplitudes adding up or cancelling out, like two water waves meeting.
- What is entanglement?
- Entangled qubits are linked: when you measure both, their results always match up, even far apart, though each one alone looks random.
- What are a gate, a circuit and a shot?
- A gate is one step that changes qubits, like X (flip 0 and 1) or H (make a 50/50 blend). A circuit is a list of gates, and a shot is one full run; you run many shots to see the pattern.
- What do you need, and what is your first tiny win?
- Python and the free Qiskit kit, which imitates qubits on your laptop.
QuantumCircuit(1)makes one qubit,hgives it a 50/50 blend, andmeasure_allreads it as 0 or 1. - What will you be able to do after this topic?
- Read and write small quantum circuits, predict what they print, run them on a simulator or real cloud hardware, and tell real quantum uses from hype.
Quantum computing cheatsheet
Gates
H|0> to |+>, makes 50/50X / Y / ZBit flip / both / phase flipS, TQuarter and eighth phase turnsRX, RY, RZ(theta)Rotate by an angleCX (CNOT)Flip target if control is 1CZPhase flip if both are 1SWAPExchange two qubitsCCX (Toffoli)Reversible AND
Qiskit 2.x
qc = QuantumCircuit(2)Two-qubit circuitqc.h(0); qc.cx(0, 1)Bell pairqc.measure_all()Measure into registermeasqc.draw("mpl")Draw the circuitStatevector(qc).probabilities_dict()Exact probabilitiesStatevectorSampler().run([qc], shots=1000)Local countsres[0].data.meas.get_counts()Read countsgenerate_preset_pass_manager(3, backend).run(qc)Transpile for a device
IBM Runtime
QiskitRuntimeService(channel="ibm_quantum_platform")Connectservice.least_busy(simulator=False)Pick a deviceSamplerV2(mode=backend)Counts on hardwareEstimatorV2(mode=backend)Expectation valuesoptions.resilience_level = 2Error mitigation onjob.job_id() / service.job(id)Resume a job later
Algorithms
GroverSearch, about (pi/4) sqrt(N) callsShorFactoring via period findingQFTQuantum Fourier transformQPEPhase estimation, eigenvaluesVQEHybrid, lowest energyQAOAHybrid, combinatorial optimisation
Numbers worth knowing
2^n amplitudes30 qubits needs about 16 GB to simulate1/sqrt(shots)Sampling errorAbout 1 percentSurface code threshold0.1 to 1 percentTypical two-qubit gate errorML-KEM, ML-DSA, SLH-DSANIST PQC, FIPS 203 to 205X25519MLKEM768Hybrid TLS key exchange in browsers