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 301–400 of 1,003
High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Ryan-Anderson, C., Brown, N. C., Baldwin, C. H., Dreiling, J. M., Foltz, C., Gaebler, J. P., Gatterman, T. M., Hewitt, N., Holliman, C., Horst, C. V., et al. (2024) · Science · doi:10.1126/science.adp6016 · Cited by 52
Building a large-scale quantum computer with continuous-variable optical technologies
Fukui, K., & Takeda, S. (2022) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ac489c · Cited by 78
Enhancing quantum teleportation efficacy with noiseless linear amplification
Zhao, J., Jeng, H., Conlon, L. O., Tserkis, S., Shajilal, B., Liu, K., Ralph, T. C., Assad, S. M., & Lam, P. K. (2023) · Nature Communications · doi:10.1038/s41467-023-40438-z · Cited by 68
Coherent oscillations in a superconducting tunable flux qubit manipulated without microwaves
Poletto, S., Chiarello, F., Castellano, M. G., Lisenfeld, J., Lukashenko, A., Cosmelli, C., Torrioli, G., Carelli, P., & Ustinov, A. V. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/1/013009 · Cited by 50
“Knill [25] argued that at least 104 quantum gates are required during the coherence time in order to implement quantum error correction algorithms that are able to restore the loss of quantum information.”
BackgroundCrosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped IonsPreprint
Parrado-Rodríguez, P., Ryan-Anderson, C., Bermúdez, A., & Müller, M. (2020) · RWTH Publications (RWTH Aachen) · Cited by 52
Fault-tolerant renormalization group decoder for Abelian topological codes
Duclos-Cianci, G., & Poulin, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-1 · Cited by 52
“Such a scheme was used by Knill [25] in the context of concatenated codes, which can be seen as a degradation of the scheme of [22] that uses the exact probability distribution.”
MethodFast Generation of GHZ-like States Using Collective-Spin XYZ Model
Zhang, X., Hu, Z., & Liu, Y. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.113402 · Cited by 66
Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
Brooks, P., & Preskill, J. (2013) · Physical Review A · doi:10.1103/physreva.87.032310 · Cited by 49
“Gates that complete a universal set can then be constructed using these states and the GL CSS gates [17].”
BackgroundMethodRepetitive Readout and Real-Time Control of Nuclear Spin Qubits in 171Yb Atoms
Huie, W., Li, L., Chen, N., Hu, X., Jia, Z., Sun, W. K. C., & Covey, J. P. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030337 · Cited by 69
Ultrafast fault-tolerant long-distance quantum communication with static linear optics
Ewert, F., & van Loock, P. (2017) · Physical Review A · doi:10.1103/physreva.95.012327 · Cited by 60
Gutiérrez, M., Müller, M., & Bermúdez, A. (2019) · Physical Review A · doi:10.1103/physreva.99.022330 · Cited by 49
“There are well-known strategies for the FT readout of the stabilizers [69–71], all of which use additional ancillary qubits to map the stabilizer information while avoiding a non-FT propagation of errors.”
MethodKleißler, F., Lazariev, A., & Arroyo-Camejo, S. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0098-7 · Cited by 59
Analysis of experimental feasibility of polar-molecule-based phase gates
Kuznetsova, E., Côté, R., Kirby, K., & Yelin, S. F. (2008) · Physical Review A · doi:10.1103/physreva.78.012313 · Cited by 50
A real-time, scalable, fast and resource-efficient decoder for a quantum computer
Barber, B., Barnes, K. M., Bialas, T., Buğdaycı, O., Campbell, E. T., Gillespie, N. I., Johar, K., Rajan, R., Richardson, A. W., Skorić, L., et al. (2025) · Nature Electronics · doi:10.1038/s41928-024-01319-5 · Cited by 131
“However, to achieve this, quantum computing architectures need to deal with the fragility of their quantum bits (qubits) 1–4 , as qubits are highly likely to interact with the environment, leading to errors.”
Techniques for microwave near-field quantum control of trapped ions
Warring, U., Ospelkaus, C., Colombe, Y., Brown, K. R., Amini, J. M., Carsjens, M., Leibfried, D., & Wineland, D. J. (2013) · Physical Review A · doi:10.1103/physreva.87.013437 · Cited by 49
Kleißler, F., Lazariev, A., & Arroyo Camejo, S. (2018) · MPG.PuRe (Max Planck Society) · Cited by 49
Grodecka, A., & Machnikowski, P. (2006) · Physical Review B · doi:10.1103/physrevb.73.125306 · Cited by 53
Theis, L., Motzoi, F., & Wilhelm, F. K. (2016) · Physical Review A · doi:10.1103/physreva.93.012324 · Cited by 60
Scalable in situ qubit calibration during repetitive error detection
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2016) · Physical Review A · doi:10.1103/physreva.94.032321 · Cited by 48
Simple Family of Nonadditive Quantum Codes
Smolin, J. A., Smith, G., & Wehner, S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.130505 · Cited by 49
Fault-tolerant quantum computation for local leakage faults
Aliferis, P., & Terhal, B. M. (2007) · Quantum Information and Computation · doi:10.26421/qic7.1-2-9 · Cited by 46
“e.g., see [Ste99, Ste03]). Current threshold estimates for the [[7,1,3]] code range from O(10−3) [Ste03] to O(10−4) [STD05] with a O(10−5) lower bound established in Ref.[AGP05]. Recent work by Knill [Kni05] shows that using small detection codes combined with extensive gate teleportation can lead to a threshold of O(…”
BackgroundMethodInfluentialA comparative code study for quantum fault tolerance
Cross, A. W., DiVincenzo, D. P., & Terhal, B. M. (2009) · Quantum Information and Computation · doi:10.26421/qic9.7-8-1 · Cited by 48
“However to demonstrate that this restriction to CSS codes is warranted we also consider the non-CSS 5-qubit code [[5, 1, 3]] which is the smallest code that can correct a single error.”
BackgroundMethodInfluentialLogical performance of 9 qubit compass codes in ion traps with crosstalk errors
Debroy, D. M., Li, M., Huang, S., & Brown, K. R. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7e80 · Cited by 46
Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
Paetznick, A., & Reichardt, B. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12-10 · Cited by 47
“After extracting the error syndrome, the lowest-weight correction is computed, and this correction is applied by a change in the qubits’ Pauli frames [Kni04b].”
BackgroundMethodInfluentialFault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
Fujii, K., & Tokunaga, Y. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.250503 · Cited by 47
Fast Estimation of Sparse Quantum Noise
Harper, R., Yu, W., & Flammia, S. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010322 · Cited by 73
Fibonacci scheme for fault-tolerant quantum computation
Aliferis, P., & Preskill, J. (2009) · Physical Review A · doi:10.1103/physreva.79.012332 · Cited by 47
“The goal of this paper was to rigorously analyze the scheme based on messagepassing decoding, and to support Knill’s numerical findings [2] that it has an accuracy threshold comparable to the postselection scheme (whose disadvantage is, of course, the extreme overhead cost incurred by the extreme use of postselection).”
BackgroundMethodInfluentialLong-range coupling and scalable architecture for superconducting flux qubits
Fowler, A. G., Thompson, W. F., Yan, Z., Stephens, A. M., Plourde, B. L. T., & Wilhelm, F. K. (2007) · Physical Review B · doi:10.1103/physrevb.76.174507 · Cited by 52
Robust fault tolerance for continuous-variable cluster states with excess antisqueezing
Walshe, B. W., Mensen, L. J., Baragiola, B. Q., & Menicucci, N. C. (2019) · Physical Review A · doi:10.1103/physreva.100.010301 · Cited by 46
Deterministic photonic quantum computation in a synthetic time dimension
Bartlett, B., Dutt, A., & Fan, S. (2021) · Optica · doi:10.1364/optica.424258 · Cited by 55
Analyzing the Rydberg-based optical-metastable-ground architecture for Yb171 nuclear spins
Chen, N., Li, L., Huie, W., Zhao, M., Vetter, I., Greene, C. H., & Covey, J. P. (2022) · Physical Review A · doi:10.1103/physreva.105.052438 · Cited by 45
“99-fidelity operations on the nuclear qubits via the clock, Rydberg, and Raman transitions – approaching the fault-tolerance threshold [30, 31].”
BackgroundQuantum stabilizer codes for correlated and asymmetric depolarizing errors
Cafaro, C., & Mancini, S. (2010) · Physical Review A · doi:10.1103/physreva.82.012306 · Cited by 48
“This result confirms that in order to make effective use of quantum error correction, a physical implementation of a channel with a sufficiently low error probability, as well as a code with sufficiently high threshold probability is needed [30].”
BackgroundQuantum teleportation of physical qubits into logical code spaces
Luo, Y.-H., Chen, M.-C., Erhard, M., Zhong, H.-S., Wu, D., Tang, H.-Y., Zhao, Q., Wang, X.-L., Fujii, K., Li, L., et al. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2026250118 · Cited by 45
“and imperfections in the fundamental quantum gates used to implement those circuits render it unreliable to perform the tasks one wanted to do [3].”
QuRE: The Quantum Resource Estimator toolbox
Suchara, M., Kubiatowicz, J., Faruque, A., Chong, F. T., Lai, C.-Y., & Paz, G. (2013) · 2013 IEEE 31st International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2013.6657074 · Cited by 45
“The tool-box supports estimation for six physical quantum technologies, seven quantum algorithms, and with error correction using the Steane [1], [2], Bacon-Shor [3], Knill [4] or surface [5], [6] QECCs.”
Entanglement purification of any stabilizer state
Glancy, S., Knill, E. H., & Vasconcelos, H. M. (2006) · Physical Review A · doi:10.1103/physreva.74.032319 · Cited by 57
“However, there is a six-qubit CSS-H error-detecting code encoding two logical qubits, which was described in [19].”
MethodSelf-citationQuantum Science and Metrology with Mixed-Species Ion Chains
Home, J. P. (2013) · Advances In Atomic, Molecular, and Optical Physics · doi:10.1016/b978-0-12-408090-4.00004-9 · Cited by 44
Reducing the quantum-computing overhead with complex gate distillation
Duclos-Cianci, G., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.91.042315 · Cited by 44
“[13] E.”
MethodComparison of a quantum error-correction threshold for exact and approximate errors
Gutiérrez, M., & Brown, K. R. (2015) · Physical Review A · doi:10.1103/physreva.91.022335 · Cited by 54
Reducing the overhead for quantum computation when noise is biased
Webster, P., Bartlett, S. D., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.92.062309 · Cited by 43
“The high-threshold schemes of Knill [2] and Raussendorf, Harrington, and Goyal [3] have error thresholds of around 1%, and there has not been significant improvement in these threshold values in the subsequent decade of research.”
BackgroundInfluentialEstimating the Coherence of Noise in Quantum Control of a Solid-State Qubit
Feng, G., Wallman, J. J., Buonacorsi, B., Cho, F. H., Park, D. K., Xin, T., Lu, D., Baugh, J., & Laflamme, R. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.260501 · Cited by 44
Minimum hardware requirements for hybrid quantum–classical DMFT
Jaderberg, B., Agarwal, A., Leonhardt, K., Kiffner, M., & Jaksch, D. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab972b · Cited by 57
“We combine the thermal relaxation and depolarizing error channels to produce a realistic emulation of noisy quantum computers [21, 45].”
MethodScalable Surface-Code Decoders with Parallelization in Time
Tan, X., Zhang, F., Chao, R., Shi, Y., & Chen, J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040344 · Cited by 42
“In this paper, we rigorously define and analyze the sliding-window decoder framework, including the insights and limitations of an existing implementation [2], and propose two variants: the forward decoder (Section S2 C) and the scalable sandwich decoder (Section S2 D).”
BackgroundMethodInfluentialGu, A., Leone, L., Ghosh, S., Eisert, J., Yelin, S. F., & Quek, Y. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.210602 · Cited by 77
Theoretical analysis of perfect quantum state transfer with superconducting qubits
Strauch, F. W., & Williams, C. J. (2008) · Physical Review B · doi:10.1103/physrevb.78.094516 · Cited by 43
Fault tolerance with bare ancillary qubits for a [[7,1,3]] code
Li, M., Gutiérrez, M., David, S. E., Hernandez, A., & Brown, K. R. (2017) · Physical Review A · doi:10.1103/physreva.96.032341 · Cited by 42
Robust Quantum Optimal Control with Trajectory Optimization
Propson, T., Jackson, B. E., Koch, J., Manchester, Z. R., & Schuster, D. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014036 · Cited by 52
Pulse engineering of a global field for robust and universal quantum computation
Hansen, I., Seedhouse, A. E., Saraiva, A., Laucht, A., Dzurak, A. S., & Yang, C. H. (2021) · Physical Review A · doi:10.1103/physreva.104.062415 · Cited by 50
A cavity-QED scheme for cluster-state quantum computing using crossed atomic beams
Blythe, P., & Varcoe, B. T. H. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/10/231 · Cited by 45
Real-time calibration with spectator qubits
Majumder, S., de Castro, L. A., & Brown, K. R. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0251-y · Cited by 63
“3, we compare the process fidelity (5) for the case where we maintain the initial calibration with the case where the spectator qubits are used for recalibration.”
MethodFault-Tolerant Quantum Computation for Local Leakage FaultsPreprint
Aliferis, P., & Terhal, B. M. (2005) · Cited by 42
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Paetznick, A., da Silva, M. P., Ryan-Anderson, C., Bello-Rivas, J. M., Campora, J. P., Chernoguzov, A., Dreiling, J. M., Foltz, C., Frachon, F., Gaebler, J. P., et al. (2024) · arXiv · doi:10.48550/arxiv.2404.02280 · Cited by 42
Tractable simulation of error correction with honest approximations to realistic fault models
Puzzuoli, D., Granade, C., Haas, H., Criger, B., Magesan, E., & Cory, D. G. (2014) · Physical Review A · doi:10.1103/physreva.89.022306 · Cited by 46
“The recovery operation is chosen to be perfect as, in practice, it isn’t always necessary to physically perform the recovery; errors can be tracked and taken into account when further operations are performed on the block [35].”
BackgroundShi, X. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.044035 · Cited by 42
“999 is attainable even for Ta ≈ 25μK, which is sufficient for fault-tolerant quantum computing based on certain strict assumptions [51].”
BackgroundEncoding Qubits in Multimode Grid States
Royer, B., Singh, S., & Girvin, S. M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010335 · Cited by 80
“In a similar fashion to the stabilizer gauge μ, we define a gauge for the logical Pauli operators υ ∈ Z(3)2, which is equivalent to a so-called Pauli frame [67].”
MethodThe trapped-ion qubit tool box
Ozeri, R. (2011) · Contemporary Physics · doi:10.1080/00107514.2011.603578 · Cited by 40
“However, under rather general assumptions, this threshold has been estimated to be in the 10(72)– 10(74)range [70].”
BackgroundDecoherence by Correlated Noise and Quantum Error Correction
Novais, E., & Baranger, H. U. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.040501 · Cited by 47
How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise AccumulationPreprint
Kalai, G. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.0485 · Cited by 55
Qutrit Magic State Distillation Tight in Some Directions
Dawkins, H., & Howard, M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.030501 · Cited by 49
“[21] A. M. Meier, B. Eastin, E. Knill, “Magic-state distillation with the four-qubit code” Quantum Information & Communication 13, 195 (2013).”
Maps for general open quantum systems and a theory of linear quantum error correction
Shabani, A., & Lidar, D. A. (2009) · Physical Review A · doi:10.1103/physreva.80.012309 · Cited by 43
Parallel State Transfer and Efficient Quantum Routing on Quantum Networks
Chudzicki, C., & Strauch, F. W. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.260501 · Cited by 46
Adaptive recurrence quantum entanglement distillation for two-Kraus-operator channels
Ruan, L., Dai, W., & Win, M. Z. (2018) · Physical Review A · doi:10.1103/physreva.97.052332 · Cited by 44
High-fidelity state detection and tomography of a single-ion Zeeman qubit
Keselman, A., Glickman, Y., Akerman, N., Kotler, S., & Ozeri, R. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/7/073027 · Cited by 46
“The exact detection error threshold required depends on many factors; however, under quite general assumptions error values of the order of 10−2–10−4 were estimated [2].”
BackgroundA flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
Svore, K. M., Cross, A. W., Chuang, I. L., & Aho, A. V. (2006) · Quantum Information and Computation · doi:10.26421/qic6.3-1 · Cited by 65
Change of Decoherence Scenario and Appearance of Localization due to Reservoir Anharmonicity
Machnikowski, P. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.140405 · Cited by 46
Fault-tolerance thresholds for the surface code with fabrication errors
Auger, J. M., Anwar, H., Gimeno-Segovia, M., Stace, T. M., & Browne, D. E. (2017) · Physical Review A · doi:10.1103/physreva.96.042316 · Cited by 75
“The justification for this follows that of [32]: 4 p/ 5 is the marginal error rate on each qubit involved in a two-qubit gate experiencing depolarizing noise with probability p .”
BackgroundNoise thresholds for higher-dimensional systems using the discrete Wigner function
van Dam, W., & Howard, M. (2011) · Physical Review A · doi:10.1103/physreva.83.032310 · Cited by 48
Ability of stabilizer quantum error correction to protect itself from its own imperfection
Fujiwara, Y. (2014) · Physical Review A · doi:10.1103/physreva.90.062304 · Cited by 41
Vasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“We can pick a particular subset, R, of the physical qubits of the Steane code such that C(R) is the well-known [[4,2,2]] code [30] [see Fig.”
BackgroundClifford Circuit Optimization with Templates and Symbolic Pauli Gates
Bravyi, S. B., Shaydulin, R., Hu, S., & Maslov, D. (2021) · Quantum · doi:10.22331/q-2021-11-16-580 · Cited by 83
“Clifford group elements play a crucial role in quantum error correction [1], quantum state distillation [2, 3], randomized benchmarking [4, 5], study of entanglement [1, 6], and, more recently, shadow tomography [7, 8], to name some application areas.”
BackgroundAn efficient magic state approach to small angle rotations
Campbell, E. T., & O’Gorman, J. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015007 · Cited by 38
Sparse Quantum Codes From Quantum Circuits
Bacon, D., Flammia, S. T., Harrow, A. W., & Shi, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2663199 · Cited by 37
A Layered Architecture for Quantum Computing Using Quantum DotsPreprint
Jones, N. C., Meter, R. V., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2010) · arXiv (Cornell University) · Cited by 38
Geometric phase gate on an optical transition for ion trap quantum computation
Kim, K., Roos, C. F., Aolita, L., Häffner, H., Nebendahl, V., & Blatt, R. (2008) · Physical Review A · doi:10.1103/physreva.77.050303 · Cited by 37
Gottesman-Kitaev-Preskill qubit synthesizer for propagating light
Takase, K., Fukui, K., Kawasaki, A., Asavanant, W., Endo, M., Yoshikawa, J., van Loock, P., & Furusawa, A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00772-y · Cited by 69
Fault Tolerance with Noisy and Slow Measurements and Preparation
Paz-Silva, G. A., Brennen, G. K., & Twamley, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.100501 · Cited by 37
Performance of two different quantum annealing correction codes
Mishra, A., Albash, T., & Lidar, D. A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1201-z · Cited by 36
“, [34,35]) remains elusive despite recent attempts [36].”
BackgroundPauli Frames for Quantum Computer Architectures
Riesebos, L., Fu, X., Varsamopoulos, S., Almudéver, C. G., & Bertels, K. (2017) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3061639.3062300 · Cited by 66
“is idea was rst proposed in [12] but has also been discussed in [2, 4, 9, 13, 19].”
BackgroundFault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
Bermudez, A., Xu, X., Gutiérrez, M., Benjamin, S. C., & Müller, M. (2019) · Physical Review A · doi:10.1103/physreva.100.062307 · Cited by 37
Arbitrary two-particle high-dimensional Bell-state measurement by auxiliary entanglement
Zhang, H., Zhang, C., Hu, X., Liu, B., Huang, Y., Li, C., & Guo, G. (2019) · Physical Review A · doi:10.1103/physreva.99.052301 · Cited by 45
Larsen, M. V., Neergaard-Nielsen, J. S., & Andersen, U. L. (2020) · Physical Review A · doi:10.1103/physreva.102.042608 · Cited by 37
“To combat residual qubit errors, the GKP code must be concatenated with another qubit error correction code such as the 7-qubit Steane code [27] or Knill’s C4/C6 code [28].”
MethodRohde, P. P. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108868815 · Cited by 56
Detecting Magic States via Characteristic Functions
Dai, H., Fu, S., & Luo, S. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05027-8 · Cited by 45
Information Processing in the Hypothalamus: Peptides and Analogue Computation
Leng, G., & Ludwig, M. (2006) · Journal of Neuroendocrinology · doi:10.1111/j.1365-2826.2006.01428.x · Cited by 37
Exchange-controlled single-electron-spin rotations in quantum dots
Coish, W. A., & Loss, D. (2007) · Physical Review B · doi:10.1103/physrevb.75.161302 · Cited by 37
Measurement-Free Topological Protection Using Dissipative Feedback
Fujii, K., Negoro, M., Imoto, N., & Kitagawa, M. (2014) · Physical Review X · doi:10.1103/physrevx.4.041039 · Cited by 35
Optimal tuning of solid-state quantum gates: A universal two-qubit gate
Paladino, E., Mastellone, A., D’Arrigo, A., & Falci, G. (2010) · Physical Review B · doi:10.1103/physrevb.81.052502 · Cited by 35
Localization effects induced by decoherence in superpositions of many-spin quantum states
Álvarez, G. A., & Suter, D. (2011) · Physical Review A · doi:10.1103/physreva.84.012320 · Cited by 41
Level Reduction and the Quantum Threshold TheoremPreprint
Aliferis, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0703230 · Cited by 65
“In this construction, which is due to Knill [59], the 1-EC gadget implements the logical teleportation of the state of the input data block while at the same time extracting the code syndrome.”
BackgroundMethodInfluentialFault-Tolerant Quantum Computation with Constant OverheadPreprint
Gottesman, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.2984 · Cited by 35
“Asymptotically, this is a very favorable scaling of overhead (ratio of physical qubits to logical qubits), but in practice the constant factors hidden by the big-O notation are quite large, ranging from hundreds or thousands for the most efficient known protocols to billions for protocols maximally optimized for high…”
BackgroundOptimization of Yb + fluorescence and hyperfine-qubit detection
Ejtemaee, S., Thomas, R., & Haljan, P. C. (2010) · Physical Review A · doi:10.1103/physreva.82.063419 · Cited by 35
Gauge color codes in two dimensions
Jones, C., Brooks, P., & Harrington, J. (2016) · Physical Review A · doi:10.1103/physreva.93.052332 · Cited by 33
“The first is to use teleportation to move quantum information between different codes that provide complementary transversal gates [4, 15, 16].”
BackgroundBayesian Optimal Control of Greenberger-Horne-Zeilinger States in Rydberg Lattices
Mukherjee, R., Xie, H., & Mintert, F. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.203603 · Cited by 39
Han, J., Wu, J., Wang, Y., Xia, Y., Jiang, Y., & Song, J. (2021) · Physical Review A · doi:10.1103/physreva.103.032402 · Cited by 34
Suppression of decoherence and disentanglement by the exchange interaction
De, A., Lang, A., Zhou, D., & Joynt, R. (2011) · Physical Review A · doi:10.1103/physreva.83.042331 · Cited by 36
Single spin universal Boolean logic gate
Agarwal, H., Pramanik, S., & Bandyopadhyay, S. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/1/015001 · Cited by 34
Namiki, R., Jiang, L., Kim, J., & Lütkenhaus, N. (2016) · Physical Review A · doi:10.1103/physreva.94.052304 · Cited by 35
Unavoidable decoherence in semiconductor quantum dots
Jacak, L., Krasnyj, J., Jacak, W. A., Gonczarek, R., & Machnikowski, P. (2005) · Physical Review B · doi:10.1103/physrevb.72.245309 · Cited by 35
Quantum computing by color-code lattice surgery
Landahl, A. J., & Ryan-Anderson, C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.5103 · Cited by 32
“This number of qubits can be doubled further to enact Knill-style syndrome extraction with the same robustness but a faster extraction circuit [22].”
BackgroundError-Resilience Phase Transitions in Encoding-Decoding Quantum Circuits
Turkeshi, X., & Sierant, P. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.140401 · Cited by 47
Universal high-fidelity quantum gates for spin qubits in diamond
Bartling, H. P., Yun, J., Schymik, K.-N., van Riggelen, M., Enthoven, L., van Ommen, H. B., Babaie, M., Sebastiano, F., Markham, M., Twitchen, D. J., et al. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034052 · Cited by 67
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.