A quantum computing researcher introduces the field: "Classical bits are 0 or 1. A qubit can be in a superposition of both 0 and 1 simultaneously — until you measure it. Measuring collapses the superposition to a definite state. This isn't magic — it's quantum mechanics. The probability of measuring 0 or 1 depends on the qubit's state vector." What is superposition in quantum computing?
Superposition: a qubit state that is a linear combination of |0⟩ and |1⟩: α|0⟩ + β|1⟩, where |α|² + |β|² = 1. The probabilities of measuring 0 and 1 are |α|² and |β|² respectively. Before measurement: the qubit is in superposition. After measurement: the wave function collapses — you get 0 or 1. Quantum vocabulary: Qubit — a quantum bit. Physical implementations: superconducting circuits (IBM, Google), trapped ions (IonQ, Quantinuum), photonic qubits, topological qubits. Measurement — the act of reading a qubit's state. Irreversible — collapses superposition. Bloch sphere — a 3D geometric representation of a qubit's state. Hadamard gate (H) — puts a qubit in equal superposition of |0⟩ and |1⟩. Most commonly used gate to create superposition. Decoherence — the loss of quantum coherence due to environmental interaction; the primary engineering challenge. Coherence time must be long enough to run computations. In conversation: "Superposition means the qubit explores multiple computational paths simultaneously — that's where the potential parallelism comes from."
2 / 5
An engineer explains entanglement to a sceptical colleague: "Entanglement is a correlation between qubits that has no classical analogue. When two qubits are entangled, measuring one instantly tells you about the state of the other — regardless of distance. It's not communication; it's correlation. We create entanglement using a CNOT gate applied after putting the control qubit in superposition." What is quantum entanglement and why is it important for quantum computing?
Entanglement: a quantum correlation where the joint state of two or more qubits cannot be described independently. Measuring one qubit instantly determines the correlated state of its entangled partner — regardless of distance. This is not faster-than-light communication — no information is transmitted. Why it matters: N entangled qubits represent a superposition of 2ⁿ states simultaneously. This is the source of quantum computing's potential exponential speedup. Creating entanglement: Hadamard gate on qubit A (creates superposition) → CNOT gate with A as control, B as target → result: Bell state (maximally entangled pair). CNOT gate: flips the target qubit if and only if the control qubit is |1⟩. When control is in superposition, the result is entanglement. Quantum circuit vocabulary: Gate — a unitary operation on qubits (like a logic gate for classical bits). Circuit depth — the number of sequential gate layers; determines computation time. Two-qubit gate — gates that operate on two qubits; CNOT is the most common; creates entanglement. Bell state — a maximally entangled two-qubit state. In conversation: "Without entanglement, a quantum computer is just a slow classical computer. Entanglement is what gives us access to the exponentially large state space."
3 / 5
A quantum hardware engineer explains current device limitations: "We're in the NISQ era — Noisy Intermediate-Scale Quantum. Our devices have 50–1000 physical qubits but they're noisy: gates have errors, qubits decohere quickly. To run fault-tolerant algorithms we need logical qubits — error-corrected qubits built from many physical qubits. One logical qubit might require 1000 physical qubits with surface code error correction." What distinguishes a physical qubit from a logical qubit?
Physical qubit: an actual hardware qubit — noisy, with limited coherence time and gate fidelity. Current error rates: 0.1–1% per two-qubit gate. Logical qubit: an error-corrected qubit built from many physical qubits using a quantum error correction code. Provides a reliable qubit abstraction for fault-tolerant algorithms. NISQ vocabulary: NISQ (Noisy Intermediate-Scale Quantum) — coined by John Preskill; describes current quantum devices: 50–1000 noisy physical qubits. NISQ algorithms try to be useful despite noise. Gate fidelity — the accuracy of a quantum gate. 99.9% fidelity means 0.1% error per gate operation. Decoherence time (T1, T2) — T1: energy relaxation time. T2: dephasing time. Both must be long relative to computation time. Surface code — the leading quantum error correction code; arranges physical qubits in a 2D grid with alternating data and measurement qubits. Requires ~1000 physical qubits per logical qubit. Quantum volume — IBM's metric for overall quantum device capability (accounts for qubit count, connectivity, fidelity). Fault-tolerant quantum computing (FTQC) — computation using logical qubits with error correction; the end goal; requires millions of physical qubits. In conversation: "We're years away from fault-tolerant quantum computing — today's algorithms have to work within the noise of physical qubits."
4 / 5
A researcher explains quantum algorithm categories: "Shor's algorithm factors large numbers exponentially faster than the best classical algorithms — that's why it threatens RSA encryption. Grover's algorithm searches an unsorted database quadratically faster than classical search — a square root speedup, not exponential. For near-term devices, VQE and QAOA are hybrid quantum-classical algorithms designed to run on noisy NISQ hardware." What is quantum advantage and which algorithm demonstrates it most dramatically?
Quantum advantage: a quantum algorithm solves a problem faster (or at lower cost) than the best known classical algorithm. Types of speedup: Exponential — Shor's algorithm factors N-bit numbers in O(n³) vs classical best O(e^n^(1/3)). Would break RSA-2048. Quadratic — Grover's algorithm searches N items in O(√N) vs classical O(N). Useful but not as dramatic. Key algorithms: Shor's algorithm — factors large integers using quantum Fourier transform. Practical threat to RSA/ECC when fault-tolerant quantum computers exist (requires ~4000+ logical qubits for RSA-2048). Grover's algorithm — quantum search. Halves the effective key length of symmetric encryption (AES-128 → AES-256 recommended). VQE (Variational Quantum Eigensolver) — hybrid algorithm for quantum chemistry; finds ground state energy of molecules. NISQ-era. QAOA (Quantum Approximate Optimisation Algorithm) — hybrid algorithm for combinatorial optimisation. NISQ-era. Quantum supremacy (Google, 2019) — Google's Sycamore performed a sampling task in 200 seconds that would take classical computers ~10,000 years. Disputed but a milestone. Post-quantum cryptography — cryptographic algorithms resistant to Shor's algorithm. NIST standardised CRYSTALS-Kyber (KEM) and CRYSTALS-Dilithium (signatures) in 2024. In conversation: "Shor's algorithm is why we're migrating to post-quantum cryptography now — not because quantum computers can break RSA today, but because harvested-now-decrypt-later attacks are real."
5 / 5
A platform engineer introduces quantum cloud services: "You don't need your own quantum hardware. IBM Quantum provides cloud access to real quantum processors via Qiskit. Google has Cirq. Amazon Braket gives you access to multiple hardware backends — IonQ trapped ions, Rigetti superconducting, and D-Wave quantum annealers. Quantum annealers are different — they're not universal quantum computers; they're specialised for optimisation problems." How is a quantum annealer different from a universal quantum computer?
Quantum annealer (D-Wave): a specialised quantum device for finding the minimum-energy state of a problem encoded as a physical system. Best suited for: quadratic unconstrained binary optimisation (QUBO), combinatorial optimisation (scheduling, logistics, portfolio optimisation). NOT a universal quantum computer — cannot run Shor's or Grover's algorithms. Universal (gate-based) quantum computer: implements an arbitrary quantum circuit using a universal gate set. Can run any quantum algorithm in principle. Examples: IBM Quantum (superconducting), IonQ (trapped ions), Quantinuum (trapped ions). Quantum hardware vocabulary: Superconducting qubits — implemented in circuits at ~15 mK (millikelvin); used by IBM, Google, Rigetti. Fast gate operations (~nanoseconds). Trapped ion qubits — individual ions held in place by electromagnetic fields; used by IonQ, Quantinuum. Slower but higher fidelity. Qiskit — IBM's open-source quantum SDK (Python). Largest ecosystem. Cirq — Google's quantum SDK (Python). PennyLane — quantum ML framework, hardware-agnostic. Amazon Braket — cloud quantum service offering access to multiple hardware providers. In conversation: "For our logistics optimisation problem, D-Wave's annealer is worth evaluating — it's not a general quantum computer, but it's specifically designed for the type of problem we're trying to solve."