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 601–700 of 1,003
Resource-efficient fault-tolerant one-way quantum repeater with code concatenation
Wo, K. J., Avis, G., Rozpędek, F., Mor-Ruiz, M. F., Pieplow, G., Schröder, T., Jiang, L., Sørensen, A. S., & Borregaard, J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00792-8 · Cited by 25
Berthusen, N., Dreiling, J., Foltz, C., Gaebler, J., Gatterman, T. M., Gresh, D., Hewitt, N., Mills, M., Moses, S. A., Neyenhuis, B., et al. (2024) · Physical Review A · doi:10.1103/physreva.110.062413 · Cited by 36
Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
Benito, C., López, E., Peropadre, B., & Bermúdez, A. (2025) · Quantum · doi:10.22331/q-2025-02-06-1623 · Cited by 37
“QEC codes [20, 21], which require a non-local connectivity and more resource-intensive syndrome-extraction procedures to achieve fault tolerance [93–95], leading to much smaller error thresholds [66, 67] and restricting the architectures on which they can be directly implemented.”
Error Correction of Transversal cnot Gates for Scalable Surface-Code Computation
Sahay, K., Lin, Y., Huang, S., Brown, K. R., & Puri, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020326 · Cited by 46
“With tCNOTs, in principle it is possible to decode over an entire algorithm using O (1) rounds of syndrome extraction per tCNOT with well-prepared logical ancilla states [33, 52–54].”
Quantum Error Correction resilient against Atom Loss
Perrin, H., Jandura, S., & Pupillo, G. (2025) · Quantum · doi:10.22331/q-2025-10-13-1884 · Cited by 42
Levy, J. E., Carroll, M. S., Ganti, A., Phillips, C. A., Landahl, A. J., Gurrieri, T. M., Carr, R. D., Stalford, H. L., & Nielsen, E. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/8/083021 · Cited by 15
Measurement-free implementations of small-scale surface codes for quantum-dot qubits
Ercan, H., Ghosh, J., Crow, D., Premakumar, V. N., Joynt, R., Friesen, M. G., & Coppersmith, S. N. (2018) · Physical Review A · doi:10.1103/physreva.97.012318 · Cited by 17
Optimization of a lossy microring resonator system for the generation of quadrature-squeezed states
Vendromin, C., & Dignam, M. M. (2020) · Physical Review A · doi:10.1103/physreva.102.023705 · Cited by 15
“This result is useful for applications trying to achieve fault-tolerant quantum computing in noisy environments [8, 33, 34].”
BackgroundA High-Sensitivity Charge Sensor for Silicon Qubits above 1 K
Huang, J. Y., Lim, W. H., Leon, R. C. C., Yang, C. H., Hudson, F. E., Escott, C. C., Saraiva, A., Dzurak, A. S., & Laucht, A. (2021) · Nano Letters · doi:10.1021/acs.nanolett.1c01003 · Cited by 21
Mangini, S., Maccone, L., & Macchiavello, C. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00151-0 · Cited by 18
Benchmarking quantum logic operations relative to thresholds for fault tolerance
Hashim, A., Seritan, S., Proctor, T. J., Rudinger, K., Goss, N., Naik, R., Kreikebaum, J. M., Santiago, D., & Siddiqi, I. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00764-y · Cited by 38
“More optimistic estimates obtained via numerical simulation are orders of magnitude larger than the lower bounds, ranging from ∼ 10 − 3 – 10 − 1 [19–27], but often assume stochastic (e.g., Pauli, dephasing, or depolarizing) noise models.”
Shen, L.-T., Wu, H., & Chen, R. (2011) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/44/20/205503 · Cited by 15
Quantum Information Processing
Lloyd, S. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_153 · Cited by 17
Use of Shor states for the [7,1,3] quantum error-correcting code
Weinstein, Y. S., & Buchbinder, S. (2012) · Physical Review A · doi:10.1103/physreva.86.052336 · Cited by 15
Efficient preparation of large-block-code ancilla states for fault-tolerant quantum computation
Zheng, Y.-C., Lai, C., & Brun, T. A. (2018) · Physical Review A · doi:10.1103/physreva.97.032331 · Cited by 23
Uniaxial Dynamical Decoupling for an Open Quantum System
Yao, Q., Zhang, J., Yi, X.-F., You, L., & Zhang, W. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.010408 · Cited by 16
Mitigation of Decoherence-Induced Quantum-Bit Errors and Quantum-Gate Errors Using Steane’s Code
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.2991802 · Cited by 14
“The event of a gate error can be modelled by first applying perfect transformation of the gate U followed by the application of the bit-flip X [41].”
BackgroundMethodInfluentialTwo-spin measurements in exchange interaction quantum computers
Barrett, S. D., & Stace, T. M. (2006) · Physical Review B · doi:10.1103/physrevb.73.075324 · Cited by 16
Dynamical decoupling of a qubit with always-on control fields
Jones, N. C., Ladd, T. D., & Fong, B. H. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/9/093045 · Cited by 18
Logic Synthesis for Fault-Tolerant Quantum ComputersPreprint
Jones, N. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.7290 · Cited by 25
“of times such preparation circuits must be repeated. 6.4 Distance-Four Tooli Gate (C4C6) I present a second way to implement a veried Tooli gate using an expandable code structure known as C 4=C 6 [101]. With respect to independent errors in Tgates, the distance of this design can be 2t for any positive integer t. The…”
BackgroundMethodInfluentialLeveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms
Baranes, G., Cain, M., Ataides, J. P. B., Bluvstein, D., Sinclair, J., Vuletić, V., Zhou, H., & Lukin, M. D. (2026) · Physical Review X · doi:10.1103/ycwc-3myc · Cited by 66
“[75], and ensures that no physical qubit re-tains a long lifecycle.”
Practical Limits for Large-Momentum-Transfer Clock Atom Interferometers
Chiarotti, M., Tinsley, J. N., Bandarupally, S., Manzoor, S., Sacco, M., Salvi, L., & Poli, N. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030348 · Cited by 18
“However, it is also well known that the laser noise in terms of both intensity [22] and, especially, frequency [23, 24] is an important parameter in determining pulse fidelity in quantum systems, as has been extensively studied in the field of quantum computing which targets 10(4) operations on a single qubit system […”
BackgroundNoise and Controllability: Suppression of Controllability in Large Quantum Systems
Khasin, M., & Kosloff, R. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.123002 · Cited by 15
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation
Grassl, M., & Roetteler, M. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620283 · Cited by 52
Recursive multiport schemes for implementing quantum algorithms with photonic integrated circuits
Tabia, G. N. M. (2016) · Physical Review A · doi:10.1103/physreva.93.012323 · Cited by 18
Experimental demonstration of elastic analogues of nonseparable qutrits
Hasan, M. A., Calderín, L., Lata, T. D., Lucas, P., Runge, K., & Deymier, P. A. (2020) · Applied Physics Letters · doi:10.1063/1.5145097 · Cited by 13
Quantum Information Protection Scheme Based on Reinforcement Learning for Periodic Surface Codes
Xue, Y.-J., Wang, H., Tian, Y., Wang, Y., Wang, Y., & Wang, S. (2022) · Quantum Engineering · doi:10.1155/2022/7643871 · Cited by 15
“An action corresponding to the agent changes the current environment state s0⟶ s1, accumulates rewards for this process r1, and accumulates maximum return after a series of actions R r0 + cr1 + c(2)r3 + · · ·; among them, c is the discount rate, [30, 31] aected by noise and other factors, and the attenuation of the r…”
BackgroundZheng, Y.-C., & Brun, T. A. (2014) · Physical Review A · doi:10.1103/physreva.89.032317 · Cited by 13
A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
Silva, M. P. D., Danos, V., Kashefi, E., & Ollivier, H. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/192 · Cited by 18
Step-by-step magic state encoding for efficient fault-tolerant quantum computation
Goto, H. (2014) · Scientific Reports · doi:10.1038/srep07501 · Cited by 26
“This assumption is valid and useful for the following reasons: (1) CNOT gates usually have the highest error probability among the above operations; (2) in most cases CNOT gates are used most frequently among the above operations; and (3) the other operations are almost always preceded or followed by CNOT gates and th…”
BackgroundPiccolini, M., Nosrati, F., Morandotti, R., & Franco, R. L. (2021) · Open Systems & Information Dynamics · doi:10.1142/s1230161221500207 · Cited by 13
Analysis of measurement errors for a superconducting phase qubit
Zhang, Q., Kofman, A. G., Martinis, J. M., & Korotkov, A. N. (2006) · Physical Review B · doi:10.1103/physrevb.74.214518 · Cited by 13
Quantum Codes on Hurwitz Surfaces
Kim, I. H. (2007) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 21
Quantum universality by distilling certain one- and two-qubit states with stabilizer operationsPreprint
Reichardt, B. W. (2006) · arXiv (Cornell University) · Cited by 13
Quantum Computers: Noise Propagation and Adversarial Noise ModelsPreprint
Kalai, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3265 · Cited by 17
“Statistical properties of the noise, and certain biases, can be used to improve the threshold! (See, e.g., [14].) A breakthrough work by Knill [ 30 ] uses error-”
BackgroundLiquid-State NMR Quantum Computing
Vandersypen, L. M. K., Chuang, I. L., & Suter, D. (2010) · Wiley eBooks · doi:10.1002/9780470034590.emrstm0272.pub2 · Cited by 14
Classical command of quantum systems via rigidity of CHSH gamesPreprint
Reichardt, B. W., Unger, F., & Vazirani, U. V. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.0449 · Cited by 13
“(12) are equally useful resources for computation by teleportation, as Eve can adjust for the P (j) operators in her classical Pauli frame.(45) Therefore define an ideal state tomography protocol as one in which Alice and Bob’s initial state consists of m shared EPR states, possibly in tensor product with an additiona…”
BackgroundThe prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
Allcock, J., Vangone, A., Meyder, A., Adaszewski, S., Strahm, M., Hsieh, C.-Y., & Zhang, S. (2022) · Frontiers in Drug Discovery · doi:10.3389/fddsv.2022.908870 · Cited by 12
Conditions for Equivalent Noise Sensitivity of Geometric and Dynamical Quantum Gates
Colmenar, R. K., Güngördü, U., & Kestner, J. P. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030310 · Cited by 15
Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions
Piemontese, S., Roscilde, T., & Hamma, A. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.134202 · Cited by 16
Statistical mechanics of monitored dissipative random circuits
Li, Y., & Claassen, M. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.104310 · Cited by 20
Mitigating errors in logical qubits
Smith, S. C., Brown, B. J., & Bartlett, S. D. (2024) · Communications Physics · doi:10.1038/s42005-024-01883-4 · Cited by 47
“A quantum error-correcting memory with post-selection can be viewed as a communication protocol with two-way classical communication via error-correcting teleportation 1,62 .”
Hockings, E. T., Doherty, A. C., & Harper, R. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010334 · Cited by 37
“Pauli frame randomisation, also known as randomised compiling, tailors arbitrary noise channels on average into Pauli channels [46, 51–53].”
Extracting randomness from magic quantum states
Vairogs, C., & Yan, B. (2025) · Physical Review Research · doi:10.1103/3ttm-vhdt · Cited by 25
Ion-trap quantum information processing: Experimental status
Kielpinski, D. (2008) · 物理学前沿:英文版 · doi:10.1007/s11467-008-0034-y · Cited by 13
Stability thresholds and calculation techniques for fast entangling gates on trapped ions
Bentley, C. D., Taylor, R. L., Carvalho, A. R. R., & Hope, J. J. (2016) · Physical Review A · doi:10.1103/physreva.93.042342 · Cited by 12
Bacon-Shor code with continuous measurement of noncommuting operators
Atalaya, J., Bahrami, M., Pryadko, L. P., & Korotkov, A. N. (2017) · Physical Review A · doi:10.1103/physreva.95.032317 · Cited by 14
Robust measurement of wave function topology on NISQ quantum computers
Xiao, X., Freericks, J. K., & Kemper, A. F. (2023) · Quantum · doi:10.22331/q-2023-04-27-987 · Cited by 23
Goto, H., Ho, Y., & Kanao, T. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043137 · Cited by 13
“In this simulation, we assume the error model where errors occur only in physical CNOT gates, which is modeled in a standard manner, that is, a physical CNOT gate is modeled by an ideal CNOT gate followed by one of 15 two-qubit Pauli errors with equal probability of p CNOT / 15 [27–29].”
BackgroundMethodInfluentialTribollet, J. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00395-8 · Cited by 13
Fault-tolerant quantum error correction code conversion
Hill, C. D., Fowler, A. G., Wang, D. S., & Hollenberg, L. C. L. (2013) · Quantum Information and Computation · doi:10.5555/2481614.2481619 · Cited by 12
Robust two-level system control by a detuned and chirped laser pulse
Jo, H., Lee, H.-G., Guérin, S., & Ahn, J. (2017) · Physical Review A · doi:10.1103/physreva.96.033403 · Cited by 12
Quasi-inversion of qubit channels
Karimipour, V., Benatti, F., & Floreanini, R. (2020) · Physical Review A · doi:10.1103/physreva.101.032109 · Cited by 16
Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
Zheng, Y.-C., Lai, C., Brun, T. A., & Kwek, L. C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/aba34d · Cited by 23
Quantum computation with doped silicon cavities
Abanto, M., Davidovich, L., Koiller, B., & Filho, R. L. D. M. (2010) · Physical Review B · doi:10.1103/physrevb.81.085325 · Cited by 13
Quantum Computing for Computer Architects, Second Edition
Metodi, T. S., Faruque, A. I., & Chong, F. T. (2011) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01731-5 · Cited by 22
Correcting Low-Frequency Noise with Continuous Measurement
Tian, L. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.153602 · Cited by 15
Greenberger-Horne-Zeilinger state protocols for fully connected qubit networks
Galiautdinov, A., Coffey, M. W., & Deiotte, R. (2009) · Physical Review A · doi:10.1103/physreva.80.062302 · Cited by 12
Efficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
“Other FT QEC algorithms, like Steane-type [26, 27] or Knill-type [10, 28, 29] error correction, make use of transversal gates.”
Nonstabilizerness in open XXZ spin chains: Universal scaling and dynamics
Sticlet, D., Dóra, B., Szombathy, D., Zaránd, G., & Moca, C. P. (2025) · Physical Review Research · doi:10.1103/96bk-xf8p · Cited by 24
“Understanding the dynamics of magic in open systems is, therefore, crucial for harnessing quantum resources in realistic, noisy environments [23–25].”
Shutty, N., & Chamberland, C. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.014072 · Cited by 23
Quantum Computing Meets Artificial Intelligence: Innovations and Challenges
Metawei, M. A., ElDeeb, H. E., Nassar, S. M., & Taher, M. (2022) · Artificial intelligence-enhanced software and systems engineering · doi:10.1007/978-3-031-08202-3_12 · Cited by 13
Gianani, I., Belenchia, A., Gherardini, S., Berardi, V., Barbieri, M., & Paternostro, M. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acedca · Cited by 16
“Moreover, states and processes that, according to delity-based gures or merit, are deemed to be close to each other might be endowed with signicantly dierent phyicial properties [36], thus weakening the foundations of any comparison based on quantities akin to Eq.”
InfluentialActis: A Strictly Local Union–Find Decoder
Chan, T., & Benjamin, S. C. (2023) · Quantum · doi:10.22331/q-2023-11-14-1183 · Cited by 23
A new protocol for constructing nonlocal n-qubit controlled-U gates
Yang, C. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.09.048 · Cited by 11
Resource requirements for a fault-tolerant quantum Fourier transform
Goto, H. (2014) · Physical Review A · doi:10.1103/physreva.90.052318 · Cited by 14
Xu, J., Yu, L., Wu, J., & Ji, X. (2017) · Chinese Physics B · doi:10.1088/1674-1056/26/9/090301 · Cited by 11
Stojanović, V. M. (2019) · Physical Review A · doi:10.1103/physreva.99.012345 · Cited by 12
Fault-tolerant quantum error correction code conversion
Hill, C. D., Fowler, A. G., Wang, D. S., & Hollenberg, L. C. L. (2013) · Quantum Information and Computation · doi:10.26421/qic13.5-6-5 · Cited by 36
Ultra-fast two-qubit ion gate using sequences of resonant pulses
Torrontegui, E., Heinrich, D., Hussain, M. I., Blatt, R., & García‐Ripoll, J. J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abbab6 · Cited by 14
Optimal readout of superconducting qubits exploiting high-level states
Wang, C., Chen, M.-C., Lu, C., & Pan, J.-W. (2021) · Fundamental Research · doi:10.1016/j.fmre.2020.12.008 · Cited by 16
Benchmarking quantum state transfer on quantum devices
Huang, Y.-T., Lin, J.-D., Ku, H.-Y., & Chen, Y.-N. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023038 · Cited by 16
“Such quantum devices can now be applied to implement some quantum algorithms [57–60] and simulations [61, 62].”
MethodClassification of transversal gates in qubit stabilizer codes
Anderson, J. T., & Jochym-O’Connor, T. (2016) · Quantum Information and Computation · doi:10.26421/qic16.9-10-3 · Cited by 43
“Quantum error correction will play a central role in any fault-tolerant implementation of a quantum computer, yet it is of paramount importance that the fundamental quantum operations such as state preparation, error syndrome extraction and correction, state measurement, and state manipulation are done in a manner tha…”
BackgroundComputation with coherent states via teleportations to and from a quantum bus
Silva, M. P. D., & Myers, C. R. (2008) · Physical Review A · doi:10.1103/physreva.78.062314 · Cited by 11
Fault-tolerant quantum computation with probabilistic two-qubit gates
Goto, H., & Ichimura, K. (2009) · Physical Review A · doi:10.1103/physreva.80.040303 · Cited by 12
SCALABLE QUANTUM NETWORKS BASED ON FEW-QUBIT REGISTERS
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006058 · Cited by 12
AN ECONOMICAL ROUTE TO ONE-WAY QUANTUM COMPUTATION
Tame, M., Paternostro, M., Kim, M. S., & Vedral, V. (2006) · International Journal of Quantum Information · doi:10.1142/s0219749906002092 · Cited by 15
Improving Threshold for Fault-Tolerant Color-Code Quantum Computing by Flagged Weight Optimization
Takada, Y., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030352 · Cited by 10
“Without directly applying the Pauli operators to the data qubits, we can perform the same operation by just recording the Pauli operators as classical information and updating the Pauli frame [48, 49].”
MethodHomomorphic Logical Measurements
Huang, S., Jochym-O’Connor, T., & Yoder, T. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030301 · Cited by 38
Eliminating Qubit-Type Cross-Talk in the o m g Protocol
Vizvary, S. R., Wall, Z. J., Boguslawski, M., Bareian, M., Derevianko, A., Campbell, W. C., & Hudson, E. R. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.263201 · Cited by 15
Low-Overhead Magic State Distillation with Color Codes
Lee, S.-H., Thomsen, F., Fazio, N., Brown, B. J., & Bartlett, S. D. (2025) · PRX Quantum · doi:10.1103/ch5r-cnfq · Cited by 49
“Here, π/ 2-rotation gates, which are simply Pauli gates with a global phase change, are shown as gray boxes to emphasize that they do not need to be applied explicitly but only change the Pauli frame [33].”
Quantum Noise Sensing by Generating Fake Noise
Braccia, P., Banchi, L., & Caruso, F. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.024002 · Cited by 14
“It is reasonable to assume that the average noise affecting a quantum circuit is a Pauli channel [33], which represents a very large family of random unitary maps.”
BackgroundGottesman Types for Quantum Programs
Rand, R. W., Sundaram, A., Singhal, K., & Lackey, B. (2021) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.340.14 · Cited by 13
“Therefore our intersection type (presuming it does not include −In) is realized as a stabilizer code and its associated syndrome spaces, hence capturing the notion of a Pauli frame [10].”
BackgroundBiased Gottesman-Kitaev-Preskill repetition code
Stafford, M. P., & Menicucci, N. C. (2023) · Physical Review A · doi:10.1103/physreva.108.052428 · Cited by 22
“To perform this correction in practice, one can either implement Steane-style [45, 46] or Knill-style (i.e. teleportation-based) [47, 48] error correction.”
MethodPerformance and error analysis of Knill's postselection scheme in a two-dimensional architecture
Lai, C., Paz-Silva, G. A., Suchara, M., & Brun, T. A. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-7 · Cited by 15
“Remark: we can reduce the depolarizing rates on the measurements and ancilla preparations as Knill did in [14] by choosing these error rates to be 4/15 of the worst gate error rate.”
BackgroundMethodInfluentialGeneralized state spaces and nonlocality in fault-tolerant quantum-computing schemes
Ratanje, N., & Virmani, S. (2011) · Physical Review A · doi:10.1103/physreva.83.032309 · Cited by 18
Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
Quan, D.-X., Zhu, L.-L., Pei, C.-X., & Sanders, B. C. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aaad13 · Cited by 15
Contextual bound states for qudit magic state distillation
Prakash, S., & Gupta, A. (2020) · Physical Review A · doi:10.1103/physreva.101.010303 · Cited by 19
A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
Silva, M. P. D., Vincent Danos, A., Kashefi, E., & Ollivier, H. (2007) · HAL · Cited by 10
Optimal correction of concatenated fault-tolerant quantum codes
Evans, Z. W. E., & Stephens, A. M. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0312-4 · Cited by 14
“Previously, it was shown that a scheme such as this could increase the minimum number of errors that cause failure to a number that scales according to the Fibonacci series with the number of levels of error correction, l [19,20].”
BackgroundBomantara, R. W., & Gong, J. (2020) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/aba291 · Cited by 16
Nongeometric phase gates via adiabatic passage of dark states in cavity QED
Zheng, S.-B. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.09.098 · Cited by 10
Randomized Benchmarking of Clifford OperatorsPreprint
Meier, A. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.10040 · Cited by 18
“Depending on the error and architecture assumptions made, fault-tolerance thresholds vary from allowing probabilities of X errors of order approximately 10−2 [43, 67] in the best case to 10−4 in a more typical case [71].”
BackgroundSun, Z., Wang, Y., Cui, J., & Fan, H. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb22c · Cited by 13
“The GHZ states, as a type of multipartite entangled states, are central for numerous quantum-based technologies, ranging from quantum teleportation [52], quantum metrology [53] to quantum error-correcting codes [54].”
BackgroundChen, Y., & Stade, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-44245-2_9 · Cited by 14
Clustering bike sharing stations using Quantum Machine Learning: A case study of Toronto, Canada
Nourbakhshrezaei, A., Jadidi, M., & Shahriari, K. (2024) · Transportation Research Interdisciplinary Perspectives · doi:10.1016/j.trip.2024.101201 · Cited by 17
Coherent quantum effects through dispersive bosonic media
Ye, S.-Y., Yang, Z., Zheng, S., & Serafini, A. (2010) · Physical Review A · doi:10.1103/physreva.82.012307 · Cited by 9
Dynamical decoupling of electron spins in phosphorus-doped silicon
Rong, X., Wang, Y., Yang, J., Zhu, J., Xu, W., Feng, P., Wen, X., Su, J., & Du, J. (2011) · Chinese Science Bulletin · doi:10.1007/s11434-010-4321-y · Cited by 10
Universal quantum logic gates in decoherence-free subspace with atoms trapped in distant cavities
Zheng, S. (2012) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-012-4848-9 · Cited by 9
Quantum dot state initialization by control of tunneling rates
Wenz, T., Klochan, J., Hohls, F., Gerster, T., Kashcheyevs, V., & Schumacher, H. W. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.201409 · Cited by 9
“The ability to initialize a discrete quantum state by coupling to a cold external environment is an essential resource for many quantum technologies, providing, for example, a template to encode quantum information, an initial pure state for quantum sensing, or a supply of ancillary qubits for quantum error correction…”
Background
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.