Source Count: 12 | Weighted Score: 30 | Source Confidence: [4/5] | Primary Tier: 1 | Last Updated: April 11, 2026
Keywords: quantum computing, qubit, superposition, entanglement, Shor algorithm, Grover algorithm, quantum supremacy, decoherence, error correction, superconducting qubit, trapped ion, IBM, Google
Category Tags: quantum-technology, computing, physics, information-theory
Cross-References: ZA_5_16 — Squeezed States and Optomechanics · ZA_4_22 — Superconductivity BCS to HTS · ZA_4_23 — Topological Insulators · ZA_5_02 — Quantum Computing Qubit Technologies · ZA_5_05 — Quantum Error Correction · S_1_04 — Quantum Computing Information

QUICK SUMMARY

Quantum computing exploits the quantum mechanical phenomena of superposition, entanglement, and interference to perform calculations that are intractable for classical computers. The concept was proposed by Richard Feynman (1982), who noted that simulating quantum systems on classical computers requires exponentially growing resources, suggesting that quantum systems themselves could compute more efficiently. David Deutsch (1985) formalized the universal quantum computer, and Peter Shor (1994) demonstrated its transformative potential with an algorithm that factors large integers in polynomial time — threatening the RSA cryptographic foundation of internet security. Lov Grover (1996) discovered a quantum search algorithm providing quadratic speedup over classical search. As of 2025, leading hardware platforms include superconducting transmon qubits (IBM's 1,121-qubit Condor, 2023; Google's 105-qubit Willow, 2024), trapped ions (IonQ, Quantinuum), photonic systems (Xanadu, PsiQuantum), and neutral atoms (QuEra). Google's Sycamore processor achieved "quantum supremacy" in 2019 by completing a specific sampling task in 200 seconds that Google estimated would require ~10,000 years on the most powerful classical supercomputer. However, no quantum computer has yet solved a commercially relevant problem faster than a classical alternative — the field remains in the "noisy intermediate-scale quantum" (NISQ) era defined by John Preskill (2018).

1. VERIFIED CLAIMS (Tier 1 — Peer-Reviewed / Established)

1.1 Feynman's Proposal and Deutsch's Universal Quantum Computer

• Evidence: At the First Conference on Physics and Computation at MIT in May 1982, Richard Feynman argued that "nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical." He proposed that a quantum computer — a controllable quantum system — could efficiently simulate other quantum systems, whereas classical simulation requires resources exponential in system size. In 1985, David Deutsch at Oxford published "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer" in Proceedings of the Royal Society A 400: 97–117, formally defining the universal quantum Turing machine and proving that quantum computers could simulate any physical process, including each other, efficiently.
• Primary Source: Feynman 1982, International Journal of Theoretical Physics 21.6/7: 467–488. DOI: 10.1007/BF02650179; Deutsch 1985, Proceedings of the Royal Society A 400: 97–117. DOI: 10.1098/rspa.1985.0070

1.2 Shor's Algorithm (1994)

• Evidence: In 1994, Peter Shor at Bell Labs discovered a quantum algorithm that factors $N$-bit integers in $O(N^3)$ time (polynomial), compared to the best known classical algorithm (~$O(e^{N^{1/3}})$, sub-exponential). Since RSA encryption relies on the difficulty of factoring products of two large primes, a sufficiently powerful quantum computer running Shor's algorithm could break RSA-2048 in hours rather than the billions of years estimated classically. KEY FINDING Shor's algorithm transformed quantum computing from a theoretical curiosity into a matter of national security, catalyzing government investment worldwide. In 2001, Isaac Chuang et al. at IBM Almaden used a 7-qubit NMR quantum computer to factor 15 (=3×5) — the first experimental demonstration of Shor's algorithm.
• Primary Source: Shor 1994, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. DOI: 10.1109/SFCS.1994.365700; Vandersypen et al. 2001, Nature 414: 883–887. DOI: 10.1038/414883a

1.3 Quantum Supremacy — Google Sycamore (2019)

• Evidence: In October 2019, Frank Arute et al. at Google AI Quantum published results in Nature 574: 505–510 demonstrating that the 53-qubit Sycamore processor completed a random circuit sampling task in 200 seconds that Google estimated would take the Summit supercomputer ~10,000 years. This was declared the first demonstration of "quantum supremacy" (later renamed "quantum advantage" by researchers). IBM immediately disputed the classical estimate, arguing that with sufficient disk storage, Summit could complete the task in ~2.5 days rather than 10,000 years. Regardless of the exact classical bound, the result established that Sycamore performed a well-defined computational task faster than any available classical computer at the time of execution.
• Primary Source: Arute et al. 2019, Nature 574: 505–510. DOI: 10.1038/s41586-019-1666-5

2. CREDIBLE CLAIMS (Tier 2 — Academic / Debated but Supported)

2.1 Quantum Error Correction — Threshold Theorem

• Evidence: The biggest obstacle to practical quantum computing is decoherence — unwanted interaction with the environment that destroys quantum information. In 1996, Andrew Steane and Peter Shor independently developed quantum error correction codes, and Dorit Aharonov and Michael Ben-Or (1997) proved the threshold theorem: if the error rate per quantum gate is below a critical threshold (~0.1–1%), arbitrarily long quantum computations can be performed by encoding logical qubits in redundant physical qubits using topological (surface) codes. Google's Willow processor (2024) demonstrated "below threshold" operation for the first time: error rates decreased as more qubits were added to the error-correcting code, achieving a logical error rate of 10⁻⁷. This is considered a critical milestone toward fault-tolerant quantum computing, though scaling to the ~1,000–10,000 physical qubits per logical qubit required for useful computations remains years away.
• Counter-Argument: Gil Kalai (2014, Hebrew University) has argued on theoretical grounds that noise in quantum systems may be inherently correlated in ways that prevent the threshold theorem from applying in practice, implying that fault-tolerant quantum computing may be fundamentally impossible. This view is a minority position but has not been conclusively refuted.

2.2 Hardware Platform Competition

• Evidence: Multiple qubit technologies are competing to become the dominant platform:
• Superconducting transmons (IBM, Google, Rigetti): Fastest gate speeds (~10–100 ns), best integrated circuit scaling; limited by coherence times (~100 μs) and operating at ~15 mK. IBM's roadmap targets 100,000+ qubits by 2033.
• Trapped ions (IonQ, Quantinuum/Honeywell): Longest coherence times (~seconds), highest gate fidelities (>99.9%); limited by slower gate speeds (~10–100 μs) and scaling challenges. Quantinuum's H2 processor achieved a quantum volume of 65,536 (2024).
• Photonic (Xanadu, PsiQuantum): Room-temperature operation, natural long-distance entanglement; limited by photon loss and probabilistic gate operations.
• Neutral atoms (QuEra, Pasqal): Scalable to thousands of qubits via optical tweezer arrays; demonstrated 48 logical qubits with error correction (Harvard/QuEra, 2023). KEY FINDING No single platform has established clear dominance, and the optimal architecture for fault-tolerant computing remains uncertain.

3. SPECULATIVE CLAIMS (Tier 3 — Possible but Unverified)

3.1 Quantum Advantage for Practical Problems

• Evidence: While quantum supremacy has been demonstrated for contrived sampling tasks, no quantum computer has yet solved a commercially or scientifically useful problem faster than a classical computer. The most promising near-term applications include: quantum chemistry simulation (estimating ground-state energies of molecules for drug discovery and catalyst design), combinatorial optimization (logistics, portfolio optimization, supply chain), and machine learning (quantum kernel methods, quantum approximate optimization algorithm — QAOA). Preskill (2018) defined the current era as "noisy intermediate-scale quantum" (NISQ) — 50–1,000 qubits with significant error rates — and suggested that useful quantum advantage may require millions of physical qubits organized into thousands of error-corrected logical qubits, a capability at least a decade away.

4. DUBIOUS CLAIMS (Tier 4 — No Credible Source / Contradicted by Evidence)

4.1 Quantum Computers Will Break All Encryption Imminently

• Evidence: Despite media alarmism, breaking RSA-2048 with Shor's algorithm would require approximately 4,000 fault-tolerant logical qubits, which corresponds to roughly 20 million physical qubits with current error rates — far beyond the ~1,000 physical qubits available as of 2025. Michele Mosca (2018) and NIST estimates project that cryptographically relevant quantum computers are unlikely before the 2030s at the earliest. NIST has already standardized post-quantum cryptographic algorithms (CRYSTALS-Kyber, CRYSTALS-Dilithium, SPHINCS+, published August 2024) specifically to prepare for this eventuality. The threat is real but not imminent.
• DEBUNKED Current quantum computers cannot break any modern encryption. Post-quantum cryptographic migration is underway.

Counter-Arguments & Criticisms

Gil Kalai (2014, 2020) has mounted the most sustained argument that large-scale fault-tolerant quantum computing may be physically impossible, arguing that quantum noise correlations in engineered systems fundamentally differ from the independent error models assumed by the threshold theorem. Mikhail Dyakonov (2018, IEEE Spectrum) argued that quantum computing's practical difficulties are systematically underestimated — controlling the continuous state of thousands of interacting quantum objects to the precision required is qualitatively different from the discrete error correction that makes classical computers reliable. Scott Aaronson (2008, Scientific American), while a strong supporter of quantum computing theory, has repeatedly cautioned against hype, noting that quantum computers provide speedups only for specific problem classes and that "quantum computing is not like classical computing but faster — it's like classical computing but differently." The economic critique is also relevant: billions of dollars have been invested in quantum computing since 2015 by governments and corporations (IBM, Google, Microsoft, Amazon, national quantum initiatives in the US, EU, China, India) with near-zero commercial return so far. Whether the technology will deliver on its theoretical promise or end as an expensive scientific tool with narrow applicability remains genuinely uncertain.

IMAGES

No images assigned yet.

BIBLIOGRAPHY

1. Feynman, Richard | 1982 | "Simulating Physics with Computers" | International Journal of Theoretical Physics | ∅ | 7::467–488 | 21.6/ | ∅ | doi:10.1007/BF02650179 | ∅ | ∅ | ∅
2. Deutsch, David | 1985 | "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer" | Proceedings of the Royal Society A | ∅ | 400::97–117 | ∅ | ∅ | doi:10.1098/rspa.1985.0070 | ∅ | ∅ | ∅
3. Shor, Peter. : 124 134 | 1994 | "Algorithms for Quantum Computation: Discrete Logarithms and Factoring" | Proceedings of the 35th Annual Symposium on Foundations of Computer Science | ∅ | ∅ | ∅ | ∅ | doi:10.1109/SFCS.1994.365700 | ∅ | ∅ | ∅
4. Grover, Lov. : 212 219 | 1996 | "A Fast Quantum Mechanical Algorithm for Database Search" | Proceedings of the 28th Annual ACM Symposium on Theory of Computing | ∅ | ∅ | ∅ | ∅ | doi:10.1145/237814.237866 | ∅ | ∅ | ∅
5. Arute, Frank, et al | 2019 | "Quantum Supremacy Using a Programmable Superconducting Processor" | Nature | ∅ | 574::505–510 | ∅ | ∅ | doi:10.1038/s41586-019-1666-5 | ∅ | ∅ | ∅
6. Preskill, John | 2018 | "Quantum Computing in the NISQ Era and Beyond" | Quantum | ∅ | 2::79 | ∅ | ∅ | doi:10.22331/q-2018-08-06-79 | ∅ | ∅ | ∅
7. Nielsen, Michael; Isaac Chuang | 2000 | ∅ | Quantum Computation and Quantum Information | ∅ | ∅ | Cambridge: Cambridge University Press | ∅ | isbn:9780521635035 | ∅ | ∅ | ∅
8. Vandersypen, Lieven, et al | 2001 | "Experimental Realization of Shor's Quantum Factoring Algorithm Using Nuclear Magnetic Resonance" | Nature | ∅ | 414::883–887 | ∅ | ∅ | doi:10.1038/414883a | ∅ | ∅ | ∅
9. Aharonov, Dorit; Michael Ben-Or | 2008 | "Fault-Tolerant Quantum Computation with Constant Error Rate" | SIAM Journal on Computing | ∅ | 38.4::1207–1282 | ∅ | ∅ | doi:10.1137/S0097539799359385 | ∅ | ∅ | ∅
10. Kalai, Gil | 2016 | "The Quantum Computer Puzzle" | Notices of the American Mathematical Society | ∅ | 63.5::508–516 | ∅ | ∅ | doi:10.1090/noti1380 | ∅ | ∅ | ∅
11. Dyakonov, Mikhail | 2019 | "The Case Against Quantum Computing" | IEEE Spectrum | ∅ | 56.3::24–29 | ∅ | ∅ | ∅ | ∅ | ∅ | ∅
12. Aaronson, Scott | 2008 | "The Limits of Quantum" | Scientific American | ∅ | 298.3::62–69 | ∅ | ∅ | doi:10.1038/scientificamerican0308-62 | ∅ | ∅ | ∅

CROSS-REFERENCE INDEX

Generated from V4 expansion plan. Last Updated: April 11, 2026