Qubits and quantum computing – the basics
In one sentence: a quantum computer processes information with quantum bits (qubits), which can be in superposition and become entangled. For certain problems this allows computations that classical computers cannot do efficiently, including breaking widely used public-key cryptography.12
What it is
- Bits and qubits. Classical computers encode information as bits, each 0 or 1. Quantum computers use qubits, which “can be put into superpositions of multiple states”: state 0, state 1, or a mix of the two.1
- Superposition. A quantum object can be in a mixed state “until it is measured or disturbed by the outside world”. Then it “collapses” to a single state.1
- Entanglement. Several qubits can share one quantum state, so measuring one determines the others.1
- Scale. Each additional qubit doubles the number of 0/1 combinations a register can hold in superposition, which is an exponential increase.1
- The limit. A quantum computer does not simply “try every solution at once”. The final measurement extracts only a small amount of information, so useful algorithms are designed to make that measurement informative.1
Why it matters for security
- Public-key cryptography. Shor’s algorithm (1994) factors large numbers and computes discrete logarithms efficiently on a quantum computer. This affects RSA, Diffie–Hellman and elliptic-curve cryptography.2 See
shors-algorithm. - Search. Grover’s algorithm (1996) finds an item among N unsorted entries in about √N steps instead of about N/2.3 It affects symmetric keys and hash functions much less than Shor’s algorithm affects public-key schemes. See
grovers-algorithm. - Not yet at scale. NIST describes today’s quantum computers as “rudimentary and error-prone”. According to NIST, “the best quantum computers today contain hundreds of interconnected qubits and make an error roughly once in every thousand operations”. Running Shor’s algorithm against real key sizes “may need millions of qubits that can run error-free indefinitely”.1 See
error-correctionandcrqc-and-q-day. - The response is already standardised. NIST published its first post-quantum cryptography standards in 2024 and encourages organisations to adopt them.1 See
nist-pqc-standards.
Qubit types under study
| Type | How it works (summary) | Source |
|---|---|---|
| Trapped ion | Charged atoms held by electric/magnetic fields, controlled with lasers and fields | 1 |
| Neutral atom | Uncharged atoms held by laser light | 1 |
| Superconducting | Circuits on a chip cooled to near absolute zero | 1 |
| Semiconducting | Electrons trapped in a small region of e.g. silicon | 1 |
| Photonic | Information encoded in single particles of light | 1 |
| Topological | Hypothetical: information in “braided” quasiparticles; not yet demonstrated | 1 |
The order of the table carries no meaning. NIST notes that each type has its own advantages and disadvantages.1
Key facts
- Error rate of the most capable current quantum computers, as described by NIST: about 1 in 1,000 operations. Classical computers: about 1 in 10¹⁸ (NIST, 2025).1
- The field is often traced to Richard Feynman’s 1981 talk on simulating physics with computers.1
See also
Changelog
- 2026-11-15 – created (draft).
Sources
-
NIST, “Quantum Computing Explained” (G. Popkin), published 2025-03-18, updated 2026-05-28. https://www.nist.gov/quantum-information-science/quantum-computing-explained (accessed 2026-11-15) ↩ ↩2 ↩3 ↩4 ↩5 ↩6 ↩7 ↩8 ↩9 ↩10 ↩11 ↩12 ↩13 ↩14 ↩15 ↩16 ↩17
-
P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”, arXiv:quant-ph/9508027. https://arxiv.org/abs/quant-ph/9508027 (accessed 2026-11-15) ↩ ↩2
-
L. K. Grover, “A fast quantum mechanical algorithm for database search”, arXiv:quant-ph/9605043, 1996. https://arxiv.org/abs/quant-ph/9605043 (accessed 2026-11-15) ↩