What Is a Qubit? A Security Professional's Guide to Post Quantum Cryptography Threats

Why a Security Professional Needs to Understand Qubits

Your job is to defend data. Quantum computers are the reason RSA, ECDH, and ECDSA cannot defend data beyond roughly the 2030s. Understanding what a qubit actually is, and what it is not, keeps you from overreacting to every press release while making sure you start migrating to Post Quantum Cryptography on time.

The Single-Sentence Definition

A qubit is a two-state quantum system whose state is described by a complex-valued vector that can lie in a continuous superposition of 0 and 1 until measurement, and whose state can be entangled with other qubits so that the joint system carries information no classical bit-pair can represent.

Why That Matters in Plain Language

A classical bit is a coin lying flat on the table: heads or tails, one value at a time. A qubit is a coin spinning in the air: it has a probability of being heads and a probability of being tails, and both are part of its state until you stop it. A two-qubit system is not just two coins spinning independently. It is two coins that can be entangled, meaning their outcomes are correlated in ways no independent pair of coins ever could be.

A classical n-bit register has 2^n possible values but holds exactly one at a time. An n-qubit register can, in principle, encode a superposition of all 2^n values simultaneously. This is why quantum computers can explore exponentially large state spaces during the computation, then extract a useful answer via interference.

The Four Things Every Security Professional Should Know

1. Superposition lets quantum algorithms parallelize over exponentially large search spaces. This is how Shor's algorithm finds the period of a function in one shot, which collapses RSA and ECC.
2. Entanglement lets qubits share information non-locally. This is how error-correction codes like the surface code build a reliable logical qubit out of thousands of noisy physical qubits.
3. Measurement destroys superposition. Every computation ends with a measurement that collapses the qubit into a classical 0 or 1 according to the probabilities encoded in its state.
4. Noise is the enemy. Real qubits decohere (lose their quantum state) within microseconds to milliseconds. Every useful quantum computation races against this clock, which is why error correction is the bottleneck on the road to a Cryptographically Relevant Quantum Computer.

Physical vs Logical Qubits

This is the confusion every headline glosses over.

A physical qubit is a real piece of quantum hardware (a superconducting transmon, a trapped ion, a photon in a waveguide). Physical qubits have error rates around 10^-3 to 10^-4 per gate.

A logical qubit is a stable, error-corrected qubit built from hundreds or thousands of physical qubits using a quantum error correcting code. Logical qubits have dramatically lower error rates but cost many physical qubits each.

Google Willow (December 2024) has 105 physical qubits and demonstrated a single logical qubit under the surface code. IBM Condor (December 2023) has 1,121 physical qubits. Breaking RSA-2048 with Shor's algorithm needs approximately 20 million noisy physical qubits per the Gidney-Ekera 2021 analysis (arXiv:1905.09749).

Implementation Technologies (So You Can Read the News)

Technology	Example	Pros	Cons
Superconducting	IBM, Google, Rigetti, Zuchongzhi	Fast gates, mature	Needs millikelvin cryogenics
Trapped ion	Quantinuum, IonQ	Very high fidelity, natural connectivity	Slower gates
Photonic	PsiQuantum, Xanadu, Jiuzhang	Room temperature, natural networking	Hard to make deterministic gates
Neutral atom	Atom Computing, QuEra	Scales to 1000+ qubits, reconfigurable	Young technology
Topological	Microsoft (Majorana)	Inherently fault-tolerant if it works	Hasn't been conclusively demonstrated

What a Security Professional Should Actually Do

1. Do not panic at qubit-count headlines. 105, 1121, or even 10000 noisy physical qubits do not break RSA.
2. Apply Mosca's theorem to your own data. If confidentiality lifetime plus migration time exceeds time to CRQC, migrate now.
3. Adopt hybrid Post Quantum Cryptography (ML-KEM + X25519) to protect against both near-term classical attacks and future quantum attacks.
4. Subscribe to updates from NIST CSRC, NSA (CNSA 2.0), ENISA, NCSC UK, and the Global Risk Institute for honest status.

Frequently Asked Questions

Is a qubit just a fancy bit?

No. A classical bit holds one of two values at a time. A qubit can exist in a continuous complex-valued superposition of 0 and 1, and it can be entangled with other qubits, producing correlations no independent classical bits can express. The distinction is what enables quantum speedups.

How many qubits are needed to break RSA?

Estimates vary by methodology. Gidney and Ekera's 2021 analysis (arXiv:1905.09749) estimates roughly 20 million noisy physical qubits to factor RSA-2048 in 8 hours. Earlier estimates ranged higher or lower depending on error correction assumptions.

Can a quantum computer simulate another quantum computer?

Yes, within limits. The whole point of Feynman's 1981 proposal for quantum computers was that classical computers struggle to simulate quantum systems, so quantum computers themselves could do it efficiently.

Why do qubits need to be so cold?

Superconducting qubits need millikelvin temperatures because thermal noise would otherwise overwhelm their quantum state. Trapped ion and neutral atom systems also need extreme isolation. Photonic systems can operate at room temperature but have other tradeoffs.

Sources

1. Nielsen & Chuang, Quantum Computation and Quantum Information
2. Google Willow announcement
3. Gidney & Ekera (2021)
4. IBM Quantum Roadmap

Related Articles

• Logical Qubits vs Physical Qubits
• Quantum Error Correction and PQC
• Shor's Algorithm Explained
• Grover's Algorithm Explained
• What is Post-Quantum Cryptography?