Source-led research library · evidence through 2026-07-28
A source-led, machine-readable research library for quantum computing concepts, hardware, error correction, algorithms, limitations, and near-term applications. It favours explicit scope, primary sources, and comparative evidence over technology narratives.
First edition · 12 source-bounded claims
Claim records
12
Verified sources
10
Concept records
12
Established result
A published result, standard construction, or authoritative definition. The label does not imply that every practical implementation challenge is solved.
Active research
An important open engineering or scientific question with no field-wide resolution.
Quantum states can be put into superpositions and correlated through entangling operations, but measurement yields classical outcomes.
Limits of this claim
This statement does not imply that every quantum task is faster than a classical one.
They differ in how qubits are made, controlled, connected, and measured, so raw qubit counts alone are not comparable performance measures.
Limits of this claim
This Atlas does not rank platforms or treat the list as exhaustive.
Errors accumulate as circuits execute, which is why device performance requires more context than a qubit count.
Limits of this claim
Error behaviour is hardware-, operation-, and workload-dependent; this is not a single universal error-rate claim.
The goal is to make logical failure less likely than failure of the underlying components, while preserving the computation.
Limits of this claim
Encoding introduces substantial qubit, control, decoding, and time overhead.
The reported experiments show logical-memory error suppression as code distance grows under defined conditions; scalable logical computation remains further work.
Limits of this claim
This claim describes a particular experimental result and must not be generalized to all platforms or complete algorithms.
This is why large-scale fault-tolerant quantum computing matters for some public-key cryptography.
Limits of this claim
The algorithm does not establish that a current device can break deployed cryptographic systems, nor does it apply to all cryptography.
It is often described as reducing a search from order N queries to order square-root N queries.
Limits of this claim
The oracle model, data loading, error correction, and classical alternatives matter in any real application.
Quantum devices may represent some quantum dynamics more naturally than classical digital simulation.
Limits of this claim
A motivation is not a blanket claim of practical advantage for every chemistry or materials task.
The 2019 superconducting experiment benchmarked a prescribed sampling task against then-available classical methods.
Limits of this claim
Classical simulation methods and comparisons evolve; this claim does not use the experiment as evidence for broad commercial utility.
Evidence must compare an end-to-end quantum workflow with the best relevant classical methods under stated accuracy and cost constraints.
Limits of this claim
This is not a claim that no near-term advantage will occur; it records an unresolved evidential and engineering question.
Surface codes supply a framework, but complete systems must coordinate many layers and achieve application-specific logical performance.
Limits of this claim
Resource estimates depend on target algorithms, code choices, hardware error models, and architectural assumptions.
An algorithmic speedup, a hardware demonstration, and a useful end-to-end application are different evidence categories.
Limits of this claim
This Atlas does not publish performance leaderboards or commercial forecasts.
A controllable two-level quantum system used to represent quantum information.
Concept record →An ordered sequence of operations and measurements acting on qubits.
Concept record →A physical platform used to create, control, couple, and measure qubits, such as superconducting circuits or trapped ions.
Concept record →Unwanted interactions, control imperfections, and measurement errors that alter quantum information.
Concept record →authoritative report · verified
NASA · 2025
Authoritative public orientation on quantum information science and its research context.
Source record →primary paper · verified
Peter W. Shor · 1995
Primary source for the factoring and discrete-logarithm algorithm.
Source record →primary paper · verified
Lov K. Grover · 1996
Primary source for amplitude-amplification search.
Source record →primary paper · verified
Richard P. Feynman · 1982
Foundational source for quantum simulation as a motivation for quantum computation.
Source record →