Quantum computing with realistically noisy devices
Open accessThe DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index; 16 of the 55 sources its claims cite were checked for support.
Abstract
In theory, quantum computers offer a means of solving problems that would be intractable on conventional computers. Assuming that a quantum computer could be constructed, it would in practice be required to function with noisy devices called ‘gates’. These gates cause decoherence of the fragile quantum states that are central to the computer's operation. The goal of so-called ‘fault-tolerant quantum computing’ is therefore to compute accurately even when the error probability per gate (EPG) is high. Here we report a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent. Such EPGs have been experimentally demonstrated, but to avoid excessive resource overheads required by the necessary architecture, lower EPGs are needed. Assuming the availability of quantum resources comparable to the digital resources available in today's computers, we show that non-trivial quantum computations at EPGs of as high as one per cent could be implemented.
Overview
CoChat Summary
TL;DR
Knill presents the C4/C6 fault-tolerant architecture and evidence that scalable quantum computing may be possible at gate error probabilities above 3% per gate, though resource costs are excessive at such high error rates. At lower error probabilities around 1%, non-trivial computations could be implemented with resources comparable in scale to classical computing.
Key findings
- Postselected C4/C6 computing: heuristic analysis gave thresholds above γ = 0.03; direct simulation up to two levels suggested a threshold above γ = 0.06 by extrapolation, and at γ = 0.03 logical preparation and measurement errors were consistent with being below threshold.
- Error-correcting C4/C6 architecture: threshold above 0.01. At γ = 0.01, logical CNOT detected errors were 2.4 ± 0.0 × 10⁻² at level 3 and 2.4 ± 1.0 × 10⁻³ at level 4; conditional errors were 6.4 ± 0.6 × 10⁻⁴ at level 3 and 0.0 ± 4.4 × 10⁻⁴ at level 4. State-injection conditional logical error was 8.6 ± 0.6 × 10⁻³ at level 3 and 1.1 ± 0.1 × 10⁻² at level 4.
- Resource example: at γ = 0.01, a computation with 100 logical qubits and up to 1000 |π/8⟩-preparations requires 1.23 × 10¹⁴ physical CNOTs, with conditional probability of incorrect output ≈ 0.02.
- Comparison at γ = 10⁻⁴: Steane’s architecture achieves effective logical error ≈ 7 × 10⁻¹² using ≈ 420 physical CNOTs per qubit per gate; C4/C6 achieves detected errors of 5.5 × 10⁻⁹ at level 3 or 6 × 10⁻¹⁴ at level 4 using ≈ 2100 or 2.6 × 10⁴ physical CNOTs per qubit, respectively.
Methods
- Architecture: concatenated error-detecting stabilizer codes C4 (four-qubit code) and C6 (three qubit-pair code), with error-correcting teleportation, transversal Clifford gates, logical Bell state preparation, postselected computing, and state injection/purification for universality.
- Error model: independent Pauli errors with a depolarizing model per gate, setting e_c = γ, e_m = e_p = 4γ/15, and e_h = 4γ/5; additional assumptions include no classical computation error or speed constraint and arbitrary two-qubit gates without delay or additional error.
- Analysis: computer-assisted heuristic threshold analysis, direct stabilizer/Clifford simulation in Octave up to multiple encoding levels, and resource estimates using naive models with Fibonacci-sequence error scaling.
Limitations
- Stated: the error model is idealized and does not match physical qubits and gates, notably coherent rotations, correlations between nearby errors, and leakage; memory error and measurement time are not specified; gates other than measurements are assumed to take the same time; classical computation is assumed error-free and unconstrained; arbitrary two-qubit gates are assumed available without delay or additional error, which the paper calls unrealistic.
- Stated: high-EPG resource requirements are excessive, postselection overheads are extreme, simulations do not constitute full statistical proof because of implicit correlations from the random-number generator, resource models are naive and most reliable for levels < 4, and the threshold ≈ 0.028 obtained from recursion is conjectural.
- Evident: the high-threshold claims rely on heuristic analysis, simulation, and extrapolation rather than mathematical proof, and the resource estimates at high γ depend on unoptimized |π/8⟩-preparation and may be impractical.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
10 Valid · 22 Not valid · 20 Not checked · 203 Own results and interpretations
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“However, in the few cases where experiments with two quantum bits (qubits) have been performed, the EPGs currently achieved are much higher, 3 × 10 -2 or more in ion traps 11, 12 and liquid-state NMR. 13, 14”
What the sources say
- Not checked yetcites [11] [11] Leibfried, D., DeMarco, B., Meyer, V., Lucas, D., Barrett, M., Britton, J., Itano, W. M., Jelenkovi´ c, B., Langer, C., Rosenband, T., and Wineland, D. J. Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate. Nature 422 , 412-415 (2003). - source
- Not checked yetcites [12] [12] Roos, C. F., Lancaster, G. P. T., Riebe, M., H¨ affner, H. , H¨ ansel, W., Gulde, S., Becher, C., Eschner, J., Schmidt-Kaler, F., and Blatt, R. Bell states of atoms with ultralong lifetimes and their tomographic state analysis. Phys. Rev. Lett. , 220402/1-4 (2004). - source
- Not checked yetcites [13] [13] Knill, E., Laflamme, R., Martinez, R., and Tseng, C.-H. An algorithmic benchmark for quantum information processing. Nature 404 , 368-370 (2000). - source
- Supportedcites [14] [14] Childs, A. M., Chuang, I. L., and Leung, D. W. Realization of quantum process tomography in NMR. Phys. Rev. A 64 , 012314/1-7 (2001). - source
The cited paper is a two-qubit liquid-state NMR demonstration (13CHCl3 proton-carbon, Section III Experiment, p. 4) measuring a controlled-NOT gate. Its Results (Gate fidelities, pp. 4-5) give minimum fidelity F_cnot = 0.80 ± 0.04 and average fidelity F_avg_cnot = 0.955, i.e. per-gate error probabilities of ~2×10^-1 and ~4.5×10^-2, both at or above 3×10^-2; the Conclusions (p. 7) state explicitly that these measurements 'suggest a per-gate error rate of the order of 10^-1'. The only better figure mentioned (10^-2) is attributed to another work as a suggestion, not an achieved result, so it does not contradict the claim. The ion-trap half of the sentence is carried by other citations (refs 11,12) and is not judged here. (LLM, conf=0.85)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“This assumption is unrealistic, but the effect on the threshold is due primarily to relatively short-range CNOTs acting within the ancillas needed for maintaining one or two blocks.”
What the sources say
- Partly supportedcites [9] [9] Steane, A. M. Overhead and noise threshold of fault-tolerant quantum error correction. Phys. Rev. A 68 , 042322/1-19 (2003). - sourceExperimental — accuracy not yet measured
In “Timing and non-nearest-neighbour coupling” (p. 7), Steane says the threshold estimates ignore the cost of qubit separation and that most physical gates in the QEC network can connect fairly close qubits. The correction protocol (p. 5) includes CNOTs within ancilla-preparation networks. Our copy does not establish that the threshold effect is due primarily to those CNOTs, specifically within ancillas maintaining one or two blocks. (LLM, conf=0.81)
- Not checked yetcites [20] Steane, A. M. Quantum computer architecture for fast entropy extraction. Quant. Inf. Comput. 4, 297–306 (2002)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Partly supported
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“For the C 4 /C 6 architecture, memory is an issue only when waiting for measurement outcomes that determine whether prepared states are good, or that are needed after teleportation, particularly when implementing non-Clifford gates. 18,19”
What the sources say
- Could not verifycites [18] [19] Zhou, X., Leung, D. W., and Chuang, I. L. Methodology for quantum logic gate construction. Phys. Rev. A 62 , 052316/1-12 (2000). - sourceExperimental — accuracy not yet measured
Our copy of Zhou, Leung & Chuang (2000) never addresses quantum memory as an architectural bottleneck: searches for memory/storage of measurement outcomes, feed-forward delay, and a 'C4/C6 architecture' returned no passage making such a statement. The paper's C_k notation is the Clifford hierarchy (Sec. III A, p. 3-4) and its resource discussion is confined to gate counts, measurement type and number of ancilla qubits (Conclusion, p. 11: one-bit teleportation 'only requires projective measurement of Z and as many ancilla qubits as the state to be transformed'; two-bit requires Bell measurement and twice as many ancillas) — it says nothing about when memory is or is not an issue. The closest machinery (classically-controlled corrections conditioned on measurement outcomes, footnote [18] p. 17; ancilla states verified by measuring stabilizers, Sec. III B p. 4 and Appendix B pp. 12-15) supports the ingredients of the claim but not the memory assertion, and no other work is credited for that assertion in our copy. (LLM, conf=0.72)
- Could not verifycites [19] Bollinger, J. J., Heinzen, D. J., Itano, W. M., Gilbert, S. L. & Wineland, D. J. A 303 MHz frequency standard based on trapped Be+ ions. IEEE Trans. Instrum. Meas. 40, 126–128 (1991) sourceExperimental — accuracy not yet measured
Our copy of Bollinger et al. (1991) is entirely about a 303-MHz Be+ Penning-trap frequency standard: the Abstract describes the hyperfine transition, 900 μHz linewidths and Doppler-shift control, and the body sections ('150 000 2sMg+ ions were', '5 parts > 0.8194 T', '550 s were', '3 1 3 - m') cover sympathetic cooling, Ramsey detection and pressure shifts. No passage addresses quantum-computing architectures, C4/C6 codes, memory constraints, state-preparation verification, teleportation or non-Clifford gates; searches for those terms ('quantum logic gate computation qubit architecture', 'memory storage of quantum states long coherence time', 'waiting for measurement outcomes prepared states verification') returned only the spectroscopy passages above. Nothing in our copy supports or contradicts the attributed point, so it cannot be audited against this source. (LLM, conf=0.80)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Could not verify
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“To complete the G min gate set so that we can implement arbitrary quantum computations, it suffices to add HAD and preparation of the state | π/ 8 〉 = cos( π/ 8) | 0 〉 + sin( π/ 8) | 1 〉 . 26, 27”
What the sources say
- Could not verifycites [26] [21] Bennett, C. H., Brassard, G., Crepau, C., Jozsa, R., Peres, A., and Wooters, W. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70 , 1895-1899 (1993). - sourceExperimental — accuracy not yet measured
The paper’s Abstract (page not provided) describes teleportation using an EPR pair and classical communication, not how to complete a gate set. Searches for Gmin, HAD or Hadamard, and π/8 state preparation found no passage addressing the claimed sufficiency for arbitrary quantum computation. (LLM, conf=0.75)
- Could not verifycites [27] [33] Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., and Wootters, W. K. Mixed state entanglement and quantum error-correcting codes. Phys. Rev. A 54 , 3824-3851 (1996). - sourceExperimental — accuracy not yet measured
The discussion of local operations and bilateral XOR in the paper (p. 2) concerns entanglement purification, not completion of a gate set. Searches for HAD, the |π/8〉 state, and universal quantum computation found no passage addressing the claimed sufficiency of those additions. (LLM, conf=0.76)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“If the EPG is smaller than a threshold, then scalable quantum computing is possible. 5-8”
What the sources say
- Supportedcites [5] [5] Preskill, J. Reliable quantum computers. Proc. R. Soc. Lond. A 454 , 385-410 (1998). - source
Section 1 (p. 2) states the threshold theorem outright: 'if the error rate is below a critical value, then it is possible to do an arbitrarily long quantum computation with a negligible probability of error.' Section 6 (p. 15) gives the mechanism — concatenation drives the error rate arbitrarily small provided the fundamental gate error rate is small enough — and (pp. 16-17) supplies numerical threshold estimates (~10^-3 crude, ~10^-4 for gate errors, ~10^-5 when storage errors dominate). The paper reports and relies on this result itself, so the attribution holds. (LLM, conf=0.92)
- Supportedcites [6] [6] Kitaev, A. Y. Quantum computations: Algorithms and error correction. Russian Math. Surveys 52 , 1191-1249 (1997). - source
The §0 Introduction states the paper's central fault-tolerance result in exactly this form: Shor's (log L)^-c accuracy requirement is strengthened so that 'fixed accuracy is sufficient' to 'carry out arbitrarily long quantum computations involving operations with fixed accuracy', i.e. a constant per-operation accuracy bound suffices for unlimited-length (scalable) computation via the cascade codes of §10. Definition 10.4 formalises this by taking a basis 'whose elements are realized with fixed accuracy δ' and building a polynomial error correction scheme with accuracy exp(-k), and the paper explicitly notes that for classical transformations 'accuracy' means 'probability of error' (§10 Additional information), so the per-gate error-probability phrasing is the paper's own. The claim's word 'threshold' is not used as such in our copy (the related threshold papers by Knill-Laflamme-Zurek [45] appear only in the reference list), but the substance — a constant per-gate error bound below which scalable quantum computing is possible — is the paper's main theorem. (LLM, conf=0.85)
- Not checked yetcites [7] Aharonov, D. & Ben-Or, M. Fault-tolerant quantum computation with constant error. Preprint at http://www.arXiv.org/quant-ph/9906129 (1999).
- Not checked yetcites [8] [8] Knill, E., Laflamme, R., and Zurek, W. H. Resilient quantum computation. Science 279 , 342-345 (1998). - source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
147 more claims · 6 with their cited sources checked
Create a free account to see all 255 claims and to verify the 39 references still open.
- It may state two separate claims as one. 67
- Probably not a substantial claim. 47
- The quote only partly states this claim. 4
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“One of the most encouraging results for all approaches to quantum computing was the high threshold of 1% recently reported by Knill [35].”
From Optical Quantum Computing (2007) · cites this paper as [35]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ A Explanation of Error-Correcting Teleportation · p. 20
“Consider an n qubit 'input' block carrying l qubits encoded in the stabilizer code for Q , where the block has been affected by errors.”
§ A Explanation of Error-Correcting Teleportation · p. 20
“Let Q be the l × 2 n binary check matrix with entries defining a stabilizer code on n qubits for encoding k = n -l qubits”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ A Explanation of Error-Correcting Teleportation · p. 20
“The stabilizer consists of the system-labeled Pauli products I, σ x ( 2 ) σ x ( 3 ) , σ y ( 2 ) σ y ( 3 ) and σ z ( 2 ) σ z ( 3 ) .”
§ A Explanation of Error-Correcting Teleportation · p. 20
“The global initial state can be viewed as | ψ 〉 encoded in the stabilizer code generated by IXX and IZZ , whose check matrix has rows b 1 = [001010] and b 2 = [000101] .”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ G Resource Usage · p. 38
“The probability of success is p (1) π/ 8 = 1 -35 ǫ π/ 8 -O ( ǫ 2 π/ 8 ) .”
§ G Resource Usage · p. 38
“Using the exact formulas, for ǫ π/ 8 = 0 . 01 , 0 . 001 , 0 . 0001 we obtain ǫ (1) π/ 8 = 3 . 6 × 10 -5 , 3 . 5 × 10 -8 , 3 . 5 × 10 -11 and p (1) π/ 8 = 0 . 860 , 0 . 985 , 0 . 999 .”
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 8×
“One is encoded into the [[7, 1, 3]] code44 (a code that encodes 1 qubit in7 qubits with minimum distance 3, which implies that it can correct any(3 − 1)/2 = 1 qubit error or detect any (3 − 1) = 2 qubit errors).”
BackgroundMethodInfluentialMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
‘‘Event-ready-detectors’’ Bell experiment via entanglement swapping
Żukowski, M., Zeilinger, A., Horne, M. A., & Ekert, A. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.4287 · Cited by 2,045
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 1×
“The principle is as explained in [18] for unitary gates, but generalized to measurements.”
Background
Cited by
Items 201–300 of 1,003
NMR Quantum Simulation of Localization Effects Induced by Decoherence
Álvarez, G. A., & Suter, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.230403 · Cited by 96
Fidelity of a Rydberg-blockade quantum gate from simulated quantum process tomography
Zhang, X. L., Gill, A., Isenhower, L., Walker, T. G., & Saffman, M. E. (2012) · Physical Review A · doi:10.1103/physreva.85.042310 · Cited by 107
Geometric phases in quantum information
Sjöqvist, E. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24941 · Cited by 116
High-fidelity quantum state evolution in imperfect photonic integrated circuits
Mower, J., Harris, N. C., Steinbrecher, G. R., Lahini, Y., & Englund, D. (2015) · Physical Review A · doi:10.1103/physreva.92.032322 · Cited by 93
Fault-tolerant magic state preparation with flag qubits
Chamberland, C., & Cross, A. W. (2019) · Quantum · doi:10.22331/q-2019-05-20-143 · Cited by 83
“In this section we review a general method introduced by Knill for preparing an encoded state |ψ〉 from a physical qubit state |ψ〉 using teleportation [38].”
MethodAndersen, C. K., Remm, A., Lazar, S., Krinner, S., Heinsoo, J., Besse, J.-C., Gabureac, M., Wallraff, A., & Eichler, C. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0185-4 · Cited by 88
High-fidelity operation of quantum photonic circuits
Laing, A., Peruzzo, A., Politi, A., Verde, M. R., Halder, M., Ralph, T. C., Thompson, M. G., & O’Brien, J. L. (2010) · Applied Physics Letters · doi:10.1063/1.3497087 · Cited by 92
Campbell, E. T., & Howard, M. (2017) · Physical Review A · doi:10.1103/physreva.95.022316 · Cited by 91
Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
Yoder, T. J., Takagi, R., & Chuang, I. L. (2016) · Physical Review X · doi:10.1103/physrevx.6.031039 · Cited by 73
“[21] Emanuel Knill and Raymond Laflamme, “Theory of quantum error-correcting codes,” Phys.”
MethodInfluentialFrom MTJ Device to Hybrid CMOS/MTJ Circuits: A Review
Joshi, V. K., Barla, P., Bhat, S., & Kaushik, B. K. (2020) · IEEE Access · doi:10.1109/access.2020.3033023 · Cited by 104
“However, bit-flip errors can be handled by error-correcting codes up to a certain extent [11], [12].”
BackgroundTriangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Error correction and degeneracy in surface codes suffering loss
Stace, T. M., & Barrett, S. D. (2010) · Physical Review A · doi:10.1103/physreva.81.022317 · Cited by 89
Ultrafast Long-Distance Quantum Communication with Static Linear Optics
Ewert, F., Bergmann, M., & van Loock, P. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.210501 · Cited by 89
Protected Josephson Rhombus Chains
Bell, M. T., Paramanandam, J., Ioffe, L. B., & Gershenson, M. E. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.167001 · Cited by 110
Robustness of single-qubit geometric gate against systematic error
Thomas, J. T., Lababidi, M., & Tian, M. (2011) · Physical Review A · doi:10.1103/physreva.84.042335 · Cited by 86
Pair-cat codes: autonomous error-correction with low-order nonlinearity
Albert, V. V., Mundhada, S. O., Grimm, A., Touzard, S., Devoret, M. H., & Jiang, L. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab1e69 · Cited by 86
“Note that tracking Π̂ allows one to avoid having to move a Π = 1 state back to the Π = 0 codespace, akin utilizing Pauli frames in the conventional stabilizer formalism [81].”
MethodSimulating the performance of a distance-3 surface code in a linear ion trap
Trout, C. J., Li, M., Gutiérrez, M., Wu, Y., Wang, S.-T., Duan, L., & Brown, K. R. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab341 · Cited by 77
Logical Qubit in a Linear Array of Semiconductor Quantum Dots
Jones, C., Fogarty, M. A., Morello, A., Gyure, M. F., Dzurak, A. S., & Ladd, T. D. (2018) · Physical Review X · doi:10.1103/physrevx.8.021058 · Cited by 115
“[91] Lorenza Viola, Emanuel Knill, and Seth Lloyd, “Dynamical decoupling of open quantum systems,” Phys.”
BackgroundMethodResultInfluentialQuantum accuracy threshold for concatenated distance-3 codes
Aliferis, P., Gottesman, D., & Preskill, J. P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504218 · Cited by 86
“Finally we remark that, while our estimate of the quantum accuracy threshold is the best that has so far been rigorously proven, recent studies by Knill have found numerical evidence for a much higher value of the threshold [ 13 ].”
BackgroundResultInfluentialVirtual-photon-induced quantum phase gates for two distant atoms trapped in separate cavities
Zheng, S.-B. (2009) · Applied Physics Letters · doi:10.1063/1.3117235 · Cited by 85
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Paetznick, A., & Svore, K. M. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-2 · Cited by 81
Laserless trapped-ion quantum simulations without spontaneous scattering using microtrap arrays
Chiaverini, J., & Lybarger, W. E. (2008) · Physical Review A · doi:10.1103/physreva.77.022324 · Cited by 85
The ZX calculus is a language for surface code lattice surgery
de Beaudrap, N., & Horsman, D. (2020) · Quantum · doi:10.22331/q-2020-01-09-218 · Cited by 83
Hardware for dynamic quantum computing
Ryan, C. A., Johnson, B., Ristè, D., Donovan, B., & Ohki, T. (2017) · Review of Scientific Instruments · doi:10.1063/1.5006525 · Cited by 103
Modeling coherent errors in quantum error correction
Greenbaum, D., & Dutton, Z. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9a06 · Cited by 70
Quantum error correction against photon loss using NOON states
Bergmann, M., & van Loock, P. (2016) · Physical Review A · doi:10.1103/physreva.94.012311 · Cited by 81
Calibration of a Cross-Resonance Two-Qubit Gate Between Directly Coupled Transmons
Patterson, A. D., Rahamim, J., Tsunoda, T., Spring, P. A., Jebari, S., Ratter, K., Mergenthaler, M., Tancredi, G., Vlastakis, B., Esposito, M., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.064013 · Cited by 95
“A key requirement for scaling such platforms to a practically useful level of quantum computation is the precise calibration of twoqubit quantum-logic gates to high fidelity, in an architecture that is practically scalable to many qubits [6,7].”
BackgroundLow-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code
Noh, K., Chamberland, C., & Brandão, F. G. S. L. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010315 · Cited by 75
Requirements for fault-tolerant factoring on an atom-optics quantum computer
Devitt, S. J., Stephens, A. M., Munro, W. J., & Nemoto, K. (2013) · Nature Communications · doi:10.1038/ncomms3524 · Cited by 80
“Others consider promising error-correction codes and circuits, such as post-selection [12] and topological error correction [14], yet do so without reference to particular architectures or applications.”
BackgroundNoise thresholds for optical cluster-state quantum computation
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review A · doi:10.1103/physreva.73.052306 · Cited by 79
Sheng, C., He, X., Xu, P., Guo, R., Wang, K., Xiong, Z., Liu, M., Wang, J., & Zhan, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.240501 · Cited by 80
Salathé, Y., Kurpiers, P., Karg, T. M., Lang, C., Andersen, C. K., Akın, A., Krinner, S., Eichler, C., & Wallraff, A. J. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.9.034011 · Cited by 103
Fault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79
“While the Eastin-Knill theorem [62] asserts that at least one nontransversal operation is required to generate a universal set of encoded gates, it does not guarantee that no transversal implementation of this circuit exists.”
BackgroundMethodInfluentialRobust entangling gate for polar molecules using magnetic and microwave fields
Hughes, M., Frye, M. D., Sawant, R., Bhole, G., Jones, J. A., Cornish, S. L., Tarbutt, M. R., Hutson, J. M., Jaksch, D., & Mur-Petit, J. (2020) · Physical Review A · doi:10.1103/physreva.101.062308 · Cited by 98
Experimental quantum coding against qubit loss error
Lu, C.-Y., Gao, W.-B., Zhang, J., Zhou, X.-Q., Yang, T., & Pan, J.-W. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0800740105 · Cited by 77
“In recent years, extensive efforts have been devoted to devising loss-tolerant quantum computer architectures [27, 28, 29, 30].”
BackgroundBound States for Magic State Distillation in Fault-Tolerant Quantum Computation
Campbell, E. T., & Browne, D. E. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.030503 · Cited by 103
Chamberland, C., & Noh, K. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00319-5 · Cited by 71
Entanglement purification protocols for all graph states
Kruszynska, C., Miyake, A., Briegel, H. J., & Dür, W. (2006) · Physical Review A · doi:10.1103/physreva.74.052316 · Cited by 93
Liang, Z.-T., Yue, X.-X., Lv, Q.-X., Du, Y.-X., Huang, W., Yan, H., & Zhu, S.-L. (2016) · Physical Review A · doi:10.1103/physreva.93.040305 · Cited by 76
Experimental demonstration of continuous quantum error correction
Livingston, W. P., Blok, M., Flurin, E., Dressel, J., Jordan, A. N., & Siddiqi, I. A. (2022) · Nature Communications · doi:10.1038/s41467-022-29906-0 · Cited by 120
Shchesnovich, V. S. (2014) · Physical Review A · doi:10.1103/physreva.89.022333 · Cited by 72
Quantum entanglement between electronic and vibrational degrees of freedom in molecules
McKemmish, L. K., McKenzie, R. H., Hush, N. S., & Reimers, J. R. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3671386 · Cited by 75
Reichardt, B. W. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abc6f4 · Cited by 56
“Errors are from a standard depolarizing noise model [18], with the error on resting qubits either 0, 1 10 or 1 times the one-qubit marginal error rate of a CNOT gate.”
BackgroundA Review on—Spintronics an Emerging Technology
Rajput, P. J., Bhandari, S. U., & Wadhwa, G. (2022) · Silicon · doi:10.1007/s12633-021-01643-x · Cited by 69
“These bit-flip errors have been controlled up to a certain extent by using error-correcting codes [38, 39].”
BackgroundMethodInfluentialScalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits
Proctor, T., Seritan, S., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150502 · Cited by 68
Measurement-based quantum communication
Zwerger, M. J., Briegel, H. J., & Dür, W. (2016) · Applied Physics B · doi:10.1007/s00340-015-6285-8 · Cited by 79
Quantum computation architecture using optical tweezers
Weitenberg, C., Kuhr, S., Mølmer, K., & Sherson, J. F. (2011) · Physical Review A · doi:10.1103/physreva.84.032322 · Cited by 81
Optimization of a solid-state electron spin qubit using gate set tomography
Dehollain, J. P., Muhonen, J. T., Blume-Kohout, R., Rudinger, K., Gamble, J. K., Nielsen, E., Laucht, A., Simmons, S., Kalra, R., Dzurak, A. S., et al. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/10/103018 · Cited by 96
Demonstration of Fault-Tolerant Steane Quantum Error Correction
Postler, L., Butt, F., Pogorelov, I., Marciniak, C. D., Heußen, S., Blatt, R., Schindler, P., Rispler, M., Müller, M., & Monz, T. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030326 · Cited by 66
“Corrections suggested by the repeated syndrome extraction are accounted for via a Pauli frame update [31].”
MethodProtecting quantum entanglement from leakage and qubit errors via repetitive parity measurements
Bultink, C. C., O’Brien, T. E., Vollmer, R., Muthusubramanian, N., Beekman, M. W., Rol, M. A., Fu, X., Tarasinski, B., Ostroukh, V., Varbanov, B., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay3050 · Cited by 65
“(F) We use the two-bit outcome of the parity checks to apply a PFU that transforms all runs ideally to |Φ+〉.”
MethodInfluentialHigh-Threshold Codes for Neutral-Atom Qubits with Biased Erasure Errors
Sahay, K., Jin, J., Claes, J., Thompson, J. D., & Puri, S. (2023) · Physical Review X · doi:10.1103/physrevx.13.041013 · Cited by 65
“The combined channel can be expressed by the Kraus operators: We obtain an effective Pauli channel using the identity j 1 ih 1 j ¼ ð I − Z Þ = 2 and the Pauli twirl approximation (PTA), which may be achieved in practice by inserting random single-qubit Pauli gates after atom replacement [41 – 43].”
The Quantum software lifecycle
Weder, B., Barzen, J., Leymann, F., Salm, M., & Vietz, D. (2020) · doi:10.1145/3412451.3428497 · Cited by 85
“Thereby, “noisy” means that the gates and qubits of existing quantum computers are affected by noise from various sources, such as measurement and gate errors or qubit decoherence due to unintended interactions between the qubits and their environment [35, 72].”
BackgroundAnyon Condensation and the Color Code
Kesselring, M. S., Magdalena de la Fuente, J. C., Thomsen, F., Eisert, J., Bartlett, S. D., & Brown, B. J. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010342 · Cited by 62
“Fault-tolerant syndrome readout circuits have been proposed [98, 99] where a code is teleported onto a second auxiliary system, such”
BackgroundFault-tolerant quantum computation versus Gaussian noise
Ng, H. K., & Preskill, J. P. (2009) · Physical Review A · doi:10.1103/physreva.79.032318 · Cited by 75
Overcoming erasure errors with multilevel systems
Muralidharan, S., Zou, C.-L., Li, L., Wen, J., & Jiang, L. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa573a · Cited by 57
Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice ArchitecturePreprint
Svore, K. M., Divincenzo, D. P., & Terhal, B. M. (2006) · Cited by 63
Error-rejecting quantum computing with solid-state spins assisted by low- Q optical microcavities
Li, T., & Deng, F. (2016) · Physical Review A · doi:10.1103/physreva.94.062310 · Cited by 64
Experimental deterministic correction of qubit loss
Stricker, R., Vodola, D., Erhard, A., Postler, L., Meth, M., Ringbauer, M., Schindler, P., Monz, T., Müller, M., & Blatt, R. (2020) · Nature · doi:10.1038/s41586-020-2667-0 · Cited by 62
Grace, M., Brif, C., Kosut, R. L., Lidar, D. A., Rabitz, H., & Walmsley, I. A. (2007) · CERN Document Server (European Organization for Nuclear Research) · Cited by 62
Scalable simultaneous multiqubit readout with 99.99% single-shot fidelity
Burrell, A. H., Szwer, D. J., Webster, S. C., & Lucas, D. M. (2010) · Physical Review A · doi:10.1103/physreva.81.040302 · Cited by 62
Lassen, M., Sabuncu, M., Huck, A., Niset, J., Leuchs, G., Cerf, N. J., & Andersen, U. L. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.168 · Cited by 71
“Pan, Experimental demonstration of a BDCZ quantum repeater node, Nature 454, 1098-1101 (2008) [13] E.”
BackgroundMinimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code
Goto, H. (2016) · Scientific Reports · doi:10.1038/srep19578 · Cited by 61
“The Steane code is a [[7,1,3]] stabilizer code, where [[n,k,d]] means that k qubits are encoded into n qubits and the code distance is d.”
BackgroundMethodSurface Code Compilation via Edge-Disjoint Paths
Beverland, M. E., Kliuchnikov, V., & Schoute, E. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020342 · Cited by 128
“Pauli operations do not need to be implemented at all since they can be commuted through Clifford gates and arbitrary Pauli gates [Kni05] and can therefore be tracked classically and merged with the final measurements.”
Zhang, J., Laflamme, R., & Suter, D. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.100503 · Cited by 60
Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions
Parrado-Rodríguez, P., Ryan-Anderson, C., Bermudez, A., & Müller, M. (2021) · Quantum · doi:10.22331/q-2021-06-29-487 · Cited by 60
A comparative code study for quantum fault tolerance
Cross, A. W., Divincenzo, D. P., & Terhal, B. M. (2009) · Quantum Information and Computation · doi:10.5555/2011814.2011815 · Cited by 56
Quantum Computing for Computer Architects
Metodi, T. S., & Chong, F. T. (2006) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01718-6 · Cited by 62
Robust-Fidelity Atom-Photon Entangling Gates in the Weak-Coupling Regime
Li, Y., Aolita, L., Chang, D. E., & Kwek, L. C. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.160504 · Cited by 66
Quantum Coding with Low-Depth Random Circuits
Gullans, M. J., Krastanov, S., Huse, D. A., Jiang, L., & Flammia, S. T. (2021) · Physical Review X · doi:10.1103/physrevx.11.031066 · Cited by 76
“Unfortunately, this approach typically suffers from large space-time resource costs and low error thresholds [11,13,26].”
BackgroundParallel and heralded multiqubit entanglement generation for quantum networks
Zhou, H., Li, T., & Xia, K. (2023) · Physical Review A · doi:10.1103/physreva.107.022428 · Cited by 64
“They have been used to perform the strongest test of local realism [35] and to implement quantum networking technologies ranging from multiparty quantum communication [36–39] to quantum metrology [40] and quantum error correction [41].”
Fowler, A. G., Whiteside, A. C., McInnes, A. L., & Rabbani, A. (2012) · Physical Review X · doi:10.1103/physrevx.2.041003 · Cited by 48
New Limits on Fault-Tolerant Quantum Computation
Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A., & Unger, F. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.50 · Cited by 59
Automated synthesis of dynamically corrected quantum gates
Khodjasteh, K., Bluhm, H., & Viola, L. (2012) · Physical Review A · doi:10.1103/physreva.86.042329 · Cited by 64
Phase-controlled asymmetric optomechanical entanglement against optical backscattering
Liu, J., Jiao, Y., Li, Y., Xu, X., He, Q., & Jing, H. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2043-3 · Cited by 60
Approaches to Quantum Error Correction
Kempe, J. (2006) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-7808-0_3 · Cited by 63
“Recent work seems to indicate that it can be even as high as 3% [Kni05] (see also [AGP05, Rei05]) and optimized numerical simulations of fault-tolerant protocols suggest a threshold as high as 5% (however, to tolerate this much error existing protocols require enormous overhead).”
BackgroundMethodExperimental magic state distillation for fault-tolerant quantum computing
Souza, A. M., Zhang, J., Ryan, C. A., & Laflamme, R. (2011) · Nature Communications · doi:10.1038/ncomms1166 · Cited by 69
“First, we fit the NMR spectral lines (8)”
MethodErrors and pseudothresholds for incoherent and coherent noise
Gutiérrez, M., Smith, C., Lulushi, L., Janardan, S., & Brown, K. R. (2016) · Physical Review A · doi:10.1103/physreva.94.042338 · Cited by 56
Experimental test of non-macrorealistic cat states in the cloud
Ku, H.-Y., Lambert, N., Chan, F.-J., Emary, C., Chen, Y.-N., & Nori, F. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00321-x · Cited by 68
Metrological Characterization of Non-Gaussian Entangled States of Superconducting Qubits
Xu, K., Zhang, Y.-R., Sun, Z.-H., Li, H., Song, P., Xiang, Z., Huang, K., Li, H., Shi, Y.-H., Chen, C.-T., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.150501 · Cited by 75
“—The ability to create and manipulate the entangled states of multiparticle quantum systems is crucial for advanced quantum technologies, including quantum metrology [1], quantum error correction [2,3], quantum communications [4,5], quantum simulations [6], and fundamental tests of quantum theory [7].”
BackgroundSimple proof of fault tolerance in the graph-state model
Aliferis, P., & Leung, D. W. (2006) · Physical Review A · doi:10.1103/physreva.73.032308 · Cited by 56
Implementation of Dynamically Corrected Gates on a Single Electron Spin in Diamond
Rong, X., Geng, J., Wang, Z., Zhang, Q., Ju, C., Shi, F., Duan, C., & Du, J. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.050503 · Cited by 62
“9961(2) (see [17]), which is close to the threshold of the fault-tolerant quantum computation[23].”
BackgroundRydberg Quantum Gates Free from Blockade Error
Shi, X.-F. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.7.064017 · Cited by 54
“The fidelity of a quantum logic gate is an important factor that limits whether or not it is useful for a reliable quantum computer [26, 36].”
BackgroundError rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55
Approximation of realistic errors by Clifford channels and Pauli measurements
Gutiérrez, M., Svec, L., Vargo, A., & Brown, K. R. (2013) · Physical Review A · doi:10.1103/physreva.87.030302 · Cited by 71
Entanglement purification with double selection
Fujii, K., & Yamamoto, K. (2009) · Physical Review A · doi:10.1103/physreva.80.042308 · Cited by 72
Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics
Chamberland, C., Iyer, P., & Poulin, D. (2018) · Quantum · doi:10.22331/q-2018-01-04-43 · Cited by 53
“This shows that as long as we only apply Clifford gates, there is no need to actively error-correct, we can instead efficiently keep track of the Pauli frame in classical software [6].”
BackgroundMethodEntanglement-Assisted Entanglement Purification
Riera-Sàbat, F., Sekatski, P., Pirker, A., & Dür, W. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.040502 · Cited by 66
Quantum Error Correction and Fault Tolerant Quantum Computing
Grassl, M., & Rötteler, M. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_435 · Cited by 61
Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Yamasaki, H., & Koashi, M. (2024) · Nature Physics · doi:10.1038/s41567-023-02325-8 · Cited by 132
Radnaev, A. G., Chung, W. C., Cole, D. C., Mason, D., Ballance, T. G., Bedalov, M. J., Belknap, D. A., Berman, M. R., Blakely, M., Bloomfield, I. L., et al. (2025) · PRX Quantum · doi:10.1103/66s8-jj18 · Cited by 54
“Recent analyses suggest that realization of practical utility will require fault-tolerant fault-tolerant operation [”
A heterogeneous quantum computer architecture
Fu, X., Riesebos, L., Lao, L., Almudéver, C. G., Sebastiano, F., Versluis, R., Charbon, E., & Bertels, K. (2016) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/2903150.2906827 · Cited by 74
“Instead, errors are tracked in classical logic using a technique called Pauli Frame [23].”
MethodTransport quantum logic gates for trapped ions
Leibfried, D., Knill, E., Ospelkaus, C., & Wineland, D. J. (2007) · Physical Review A · doi:10.1103/physreva.76.032324 · Cited by 54
Self-citationPiparo, N. L., Munro, W. J., & Nemoto, K. (2019) · Physical Review A · doi:10.1103/physreva.99.022337 · Cited by 60
Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits
Gong, M., Yuan, X., Wang, S., Wu, Y., Zhao, Y., Zha, C., Li, S., Zhang, Z., Zhao, Q., Liu, Y., et al. (2022) · National Science Review · doi:10.1093/nsr/nwab011 · Cited by 53
“Providing that the machine is sufficiently large (high qubit count), and that physical errors happen with a probability below a certain threshold, then such errors can be systematically detected and corrected [8,9].”
Crosstalk Suppression in Individually Addressed Two-Qubit Gates in a Trapped-Ion Quantum Computer
Fang, C., Wang, Y., Huang, S., Brown, K. R., & Kim, J. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.240504 · Cited by 71
Hybrid architecture for encoded measurement-based quantum computation
Zwerger, M., Briegel, H. J., & Dür, W. (2014) · Scientific Reports · doi:10.1038/srep05364 · Cited by 53
“g.(9,14,16)), as they are based on a different error model.”
BackgroundVerifiable fault tolerance in measurement-based quantum computation
Fujii, K., & Hayashi, M. (2017) · Physical Review A · doi:10.1103/physreva.96.030301 · Cited by 59
Rotta, D., Sebastiano, F., Charbon, E., & Prati, E. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0023-5 · Cited by 67
Near-Unity Indistinguishability Single Photon Source for Large-Scale Integrated Quantum Optics
Dusanowski, Ł., Kwon, S.-H., Schneider, C., & Höfling, S. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.173602 · Cited by 63
Key ideas in quantum error correction
Raussendorf, R. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0494 · Cited by 68
Metadata
- Authors
- Knill, E.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Knill, E.
- ORCID
- Knill, E.
- Venue
- Nature
- Published
- 2005-03
- Volume
- 434
- Issue
- 7029
- Pages
- 39-44
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2032147770
- Semantic Scholar
- 5d1ac222556297a0a79eb0cc815a05600a168446
- Cited by
- 1,184
- References
- 54
- Citations by year
- 2026: 46 · 2025: 102 · 2024: 78 · 2023: 66 · 2022: 69 · 2021: 81 · 2020: 74 · 2019: 48 · 2018: 40 · 2017: 49 · 2016: 52 · 2015: 39 · 2014: 44 · 2013: 41 · 2012: 36
- FWCI
- 54.93
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- fault-tolerant quantum computing, decoherence, quantum computing architecture, resource overhead, quantum error correction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.