Quantum computing is one of the most discussed and most misunderstood technologies in contemporary science and technology discourse. It is simultaneously genuinely revolutionary in its potential and genuinely limited in its current state. This combination makes it a fertile ground for both overclaiming and dismissal. However, neither response is accurate. Understanding what quantum computers actually are requires engaging with some unusual physics. It also requires knowing what kinds of problems they can potentially solve that classical computers cannot. Finally, it requires knowing where the technology realistically stands in 2026. Even so, the core ideas are accessible without a physics degree.
The interest in quantum computing from governments, militaries and technology companies is not speculative enthusiasm. It reflects a serious assessment. Certain categories of computation are genuinely beyond the reach of any classical computer, however powerful. This applies particularly to cryptography, materials simulation and optimisation. Consequently, quantum computers capable of performing these calculations would confer significant strategic and commercial advantages on those who possess them.
Qubits: The Fundamental Difference
Classical computers store and process information in bits — binary digits that are either 0 or 1. In contrast, quantum computers use qubits. A qubit can exist in a superposition of 0 and 1 simultaneously. When someone measures it, it resolves to a definite value. This is not the same as simply storing a probability. Instead, the superposition represents a genuinely simultaneous existence in multiple states. Together, multiple qubits can represent and process exponentially more states simultaneously than the equivalent number of classical bits.
A second key quantum phenomenon relevant to computing is entanglement. In entanglement, the quantum states of two or more qubits become correlated. As a result, measuring one instantly determines the state of the other, regardless of physical separation. Quantum algorithms exploit both superposition and entanglement. This lets them perform certain calculations exponentially faster than the best known classical algorithms. However, this advantage is not universal. Quantum computers are not simply faster classical computers. Even so, for specific problem types the advantage is very large. Our article on the AI arms race explores the relationship between quantum computing and AI hardware.
What Quantum Computers Are Actually Good For
The exponential advantage of quantum computing applies to a specific set of problem types. It is important to be clear about which ones. Shor’s algorithm, developed in 1994, shows how a sufficiently capable quantum computer can factorise large integers. It does so exponentially faster than any known classical algorithm. As a result, such a computer would break RSA encryption, the most widely used public-key cryptography standard, within minutes. Classical attacks would require billions of years instead. This is the primary reason governments are treating quantum computing as a national security issue.
Grover’s algorithm provides a quadratic speedup for unstructured search problems. In addition, quantum simulation uses a quantum system to simulate another quantum system. It has applications in materials science, drug discovery and chemistry that classical computers cannot match for large molecular systems. Certain optimisation problems may also benefit from quantum approaches. These include portfolio optimisation, logistics routing and machine learning training. However, the magnitude of the advantage is more contested. Some applications require the kind of pattern recognition that AI provides rather than quantum simulation. For these, our article on what is artificial intelligence covers the complementary landscape.
The State of Play in 2026: Noisy Intermediate-Scale Quantum
Current quantum computers operate in what researchers call the Noisy Intermediate-Scale Quantum (NISQ) era. These include machines from IBM, Google, IonQ, Quantinuum and others. These machines have between dozens and thousands of qubits. However, those qubits are imperfect. First, they are prone to errors caused by environmental interference. Second, they have limited coherence times (the period during which they maintain their quantum state). Finally, they require operation at temperatures near absolute zero. Current NISQ devices cannot yet run the most commercially valuable quantum algorithms. As a result, they provide no practical advantage over classical computing at their current scale.
The key technical challenge of the field is the transition from NISQ to fault-tolerant quantum computing. In fault-tolerant computing, error correction codes allow reliable computation despite imperfect physical qubits. In 2019, Google demonstrated ‘quantum supremacy’. A quantum processor completed a specific calculation in 200 seconds that would take a classical supercomputer 10,000 years. This was a landmark. However, it was for a carefully chosen problem without practical applications. Fault-tolerant quantum advantage for commercially relevant problems is likely still five to ten years away for most applications. Even so, progress has consistently outpaced expectations.
Post-Quantum Cryptography: The Response Everyone Needs to Know About
Fault-tolerant quantum computers do not yet exist. Even so, some organisations need to be preparing now for the post-quantum world. These are organisations that handle sensitive data with long secrecy requirements. Examples include governments, defence contractors, financial institutions and healthcare providers. The logic is straightforward. Adversaries may harvest encrypted data that organisations transmit today. They store it now and decrypt it later, once quantum computers capable of breaking current encryption are available. Thus, this ‘harvest now, decrypt later’ strategy means that the threat timeline for sensitive long-lived data is effectively now. It is not when quantum computers arrive.
The US National Institute of Standards and Technology (NIST) finalised the first set of post-quantum cryptography standards in 2024. These are algorithms that resist quantum attacks while running on classical hardware. Meanwhile, UK organisations should be auditing their cryptographic infrastructure and planning migration to post-quantum standards. For large organisations, this process may take several years. Our article on cybersecurity in 2026 explores the cybersecurity implications of the quantum transition in more depth.
References
- Preskill, J. (2018) ‘Quantum computing in the NISQ era and beyond’, Quantum, 2, p. 79.
- Arute, F. et al. (2019) ‘Quantum supremacy using a programmable superconducting processor’, Nature, 574(7779), pp. 505–510.
- NIST (2024) Post-Quantum Cryptography: Selected Algorithms 2024. Gaithersburg: National Institute of Standards and Technology.
- Bernhardt, C. (2019) Quantum Computing: An Applied Approach. Cham: Springer.