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
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
“General fault-tolerant thresholds for quantum computing have been derived by Steane (2003) and Knill (2005), and here we address LOQC specific error correction and fault-tolerant thresholds.”
MethodQuantum information with Rydberg atoms
Saffman, M., Walker, T. G., & Mølmer, K. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.2313 · Cited by 2,836
“001, which corresponds to recent theoretical estimates(Aliferis and Preskill, 2009; Knill, 2005) for the fault tolerant threshold in a scalable quantum computer, can be achieved over a large range of interatomic separations.”
InfluentialQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
“We take a small stabilizer code C 6 [defined in Knill (2005)] with parity checks X 1 X 4 X 5 X 6 , X 1 X 2 X 3 X 6 , Z 1 Z 4 Z 5 Z 6 , and Z 1 Z 2 Z 3 Z 6 acting on six qubits.”
InfluentialChitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
“In fact, this technique is universal in that any non-stabilizer operation can be implemented in such a way, provided the non-stabilizer state consumed belongs to the class of socalled magic states (Bravyi and Kitaev, 2005; Gottesman and Chuang, 1999; Knill, 2005).”
BackgroundO'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
“e amount of possible parallelization, amongst others have to be considered to get a full grasp on the situation at hand. Thus the concept of thresholds is oversimplifying the situation. For instance, Knill (2005) published numerical results which indicate that even error rates on the order of 10−2 are permitted, howev…”
BackgroundInfluentialLogical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“The duration of each row is 5–8 μs (corresponding to several tens of μs for an arbitrary pattern of rotations), which can be sped up considerably, as discussed in the next section.”
BackgroundMeasurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
“Moreover, a very high threshold of 3p (that is, on average, one gate in thirty is allowed to fail) has been obtained for a method using offline preparation and post-selection within the circuit mode”
MethodRandomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Self-citationAn addressable quantum dot qubit with fault-tolerant control-fidelity
Veldhorst, M., Hwang, J. C. C., Yang, C. H., Leenstra, A. W., de Ronde, B., Dehollain, J. P., Muhonen, J. T., Hudson, F. E., Itoh, K. M., Morello, A., et al. (2014) · Nature Nanotechnology · doi:10.1038/nnano.2014.216 · Cited by 940
“These long coherence times, in particular the dephasing time T ∗ 2 , lead to low control error rates and the high fidelities that will be required for large-scale, fault tolerant quantum computing[7, 8].”
BackgroundMethodCreation of a six-atom ‘Schrödinger cat’ state
Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R. B., Chiaverini, J., Hume, D. B., Itano, W. M., Jost, J. D., Langer, C., et al. (2005) · Nature · doi:10.1038/nature04251 · Cited by 805
“The expectation value of this operator is directly related to the fidelity in equation (3):”
BackgroundSelf-citationQuantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
“The general theory of quantum fault-tolerance 37,38 allows quantum computations to be protected against a sufficiently small amount of physically reasonable noise.”
BackgroundFault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
“At no point during correction do we gain any information regarding the coefficients α and β , hence superpositions of the computational state will remain intact during correction.”
BackgroundSimple Pulses for Elimination of Leakage in Weakly Nonlinear Qubits
Motzoi, F., Gambetta, J. M., Rebentrost, P., & Wilhelm, F. K. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.110501 · Cited by 814
Keeping a Quantum Bit Alive by Optimized π -Pulse Sequences
Uhrig, G. S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.100504 · Cited by 716
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
“While large values of τE/τD would lead to impractical levels of overhead in qubits and time (similar to the case of conventional quantum fault tolerance near threshold error levels [55]), this result is still remarkable and indicates that fault tolerance is always possible in the MUSIQC architecture.”
BackgroundKarzig, T., Knapp, C., Lutchyn, R. M., Bonderson, P., Hastings, M. B., Nayak, C., Alicea, J., Flensberg, K., Plugge, S., Oreg, Y., et al. (2017) · Physical Review B · doi:10.1103/physrevb.95.235305 · Cited by 628
“Pauli frame changes [70] refer to the idea of not performing certain single-qubit Clifford gates such as X, Z, and H in a quantum circuit, but instead modifying subsequent measurements accordingly.”
BackgroundSingle-Shot Readout of a Single Nuclear Spin
Neumann, P., Beck, J., Steiner, M., Rempp, F., Fedder, H., Hemmer, P. R., Wrachtrup, J., & Jelezko, F. (2010) · Science · doi:10.1126/science.1189075 · Cited by 621
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
“Forming the exclusivity graph C of {P} and applying the results of refs 31 and 32 identifies the left-hand side of equation (15) as a witness for the contextuality of r.”
InfluentialTopological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
High-fidelity readout and control of a nuclear spin qubit in silicon
Pla, J. J., Tan, K. Y., Dehollain, J. P., Lim, W. H., Morton, J. J. L., Zwanenburg, F. A., Jamieson, D. N., Dzurak, A. S., & Morello, A. (2013) · Nature · doi:10.1038/nature12011 · Cited by 530
“84(10) ms for the neutral donor and a T2 * (D + ) = 3.”
Towards fault-tolerant quantum computing with trapped ions
Benhelm, J., Kirchmair, G., Roos, C. F., & Blatt, R. (2008) · Nature Physics · doi:10.1038/nphys961 · Cited by 526
“, it is believed that error thresholds ranging between 10 −4 and 10 −2 will be required—depending on the noise model and the computational overhead for realizing the quantum gate”
BackgroundFault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Noise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
“The example with T = Pd that has been implicitly appealed to and described as “toggling the Pauli frame” previously [11] is a special case of the above technique when the hard gates are Clifford gates (which are defined to be the gates that map Pauli operators to Pauli operators under conjugation), but breaks down whe…”
BackgroundOptimal architectures for long distance quantum communication
Muralidharan, S., Li, L., Kim, J., Lütkenhaus, N., Lukin, M. D., & Jiang, L. (2016) · Scientific Reports · doi:10.1038/srep20463 · Cited by 440
“The second and third generations both use QEC to correct operation errors, with error correction thresholds of approximately 1% 26 .”
Background10-Qubit Entanglement and Parallel Logic Operations with a Superconducting Circuit
Song, C., Xu, K., Liu, W., Yang, C.-P., Zheng, S.-B., Deng, H., Xie, Q., Huang, K., Guo, Q., Zhang, L., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180511 · Cited by 449
Controlled Phase Shifts with a Single Quantum Dot
Fushman, I., Englund, D., Faraon, A., Stoltz, N., Petroff, P., & Vučković, J. (2008) · Science · doi:10.1126/science.1154643 · Cited by 443
Taylor, J. M., Engel, H.-A., Dür, W., Yacoby, A., Marcus, C. M., Zoller, P., & Lukin, M. D. (2005) · Nature Physics · doi:10.1038/nphys174 · Cited by 433
“In addition, higher thresholds may be possible through better code choice and other optimization”
BackgroundBlume-Kohout, R., Gamble, J. K., Nielsen, E., Rudinger, K., Mizrahi, J., Fortier, K., & Maunz, P. (2017) · Nature Communications · doi:10.1038/ncomms14485 · Cited by 401
Quantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
Generation of multicomponent atomic Schrödinger cat states of up to 20 qubits
Song, C., Xu, K., Li, H., Zhang, Y.-R., Zhang, X., Liu, W., Guo, Q., Wang, Z., Ren, W., Hao, J., et al. (2019) · Science · doi:10.1126/science.aay0600 · Cited by 402
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Optimal, reliable estimation of quantum states
Blume-Kohout, R. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/4/043034 · Cited by 393
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415
“Instead, the noise can be accumulated into a Pauli frame stored alongside the simulation [23].”
BackgroundMethodApplication of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387
High-fidelity entanglement and detection of alkaline-earth Rydberg atoms
Madjarov, I. S., Covey, J. P., Shaw, A. L., Choi, J., Kale, A., Cooper, A., Pichler, H., Schkolnik, V., Williams, J. R., & Endres, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0903-z · Cited by 374
Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
Menicucci, N. C. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120504 · Cited by 371
“Fault-tolerance thresholds for more traditional codes (i.e., concatenated codes) vary, with typical thresholds being 10 − 6 [25–28], 10 − 4 [31], and 3 × 10 − 3 [40]—and up to a few percent with postselec-tion [29].”
BackgroundLong-Lived Qubit Memory Using Atomic Ions
Langer, C., Ozeri, R., Jost, J., Chiaverini, J., DeMarco, B., Ben-Kish, A., Blakestad, R., Britton, J., Hume, D., Itano, W., et al. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.060502 · Cited by 372
Experimental quantum simulations of many-body physics with trapped ions
Schneider, C., Porras, D., & Schaetz, T. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/2/024401 · Cited by 361
Zoller, P., Beth, T., Binosi, D., Blatt, R., Briegel, H., Bruss, D., Calarco, T., Cirac, J. I., Deutsch, D., Eisert, J., et al. (2005) · The European Physical Journal D · doi:10.1140/epjd/e2005-00251-1 · Cited by 352
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011) · Physical Review A · doi:10.1103/physreva.83.020302 · Cited by 343
Magic-state distillation with low overhead
Bravyi, S., & Haah, J. (2012) · Physical Review A · doi:10.1103/physreva.86.052329 · Cited by 341
Distributed quantum computation based on small quantum registers
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.062323 · Cited by 337
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Manufacturing big data ecosystem: A systematic literature review
Cui, Y., Kara, S., & Chan, K. C. (2020) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2019.101861 · Cited by 334
High-Fidelity Readout of Trapped-Ion Qubits
Myerson, A. H., Szwer, D. J., Webster, S. C., Allcock, D. T. C., Curtis, M. J., Imreh, G., Sherman, J. A., Stacey, D. N., Steane, A. M., & Lucas, D. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.200502 · Cited by 334
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
“A Pauli frame [91, 102] is a simple and efficient classical computing technique to track the result of applying a series of Pauli gates ( X , Y , or Z ) to single qubits.”
MethodEntanglement purification and quantum error correction
Dür, W., & Briegel, H. J. (2007) · Reports on Progress in Physics · doi:10.1088/0034-4885/70/8/r03 · Cited by 327
Quantum repeater with encoding
Jiang, L., Taylor, J. M., Nemoto, K., Munro, W. J., Van Meter, R., & Lukin, M. D. (2009) · Physical Review A · doi:10.1103/physreva.79.032325 · Cited by 328
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
“In particular, this result gives an exact upper bound compared with the earlier threshold theorems, which can have very large constants hidden in the asymptotic analysis [95].”
ResultFidelity of quantum operations
Pedersen, L. H., Møller, N. M., & Mølmer, K. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.02.069 · Cited by 323
Measuring the Spectrum of Colored Noise by Dynamical Decoupling
Álvarez, G. A., & Suter, D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.230501 · Cited by 310
Performance and structure of single-mode bosonic codes
Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., et al. (2018) · Physical Review A · doi:10.1103/physreva.97.032346 · Cited by 305
“In other words, unlike the use of Pauli frames [102], we cannot just record the value of |mx | and keep the quantum information in this error space with a lower value for |mx |: Subsequent dephasing errors would lead to more laddering up and down in the spin space so the QEC conditions would no longer be met [see Fig.”
MethodRealization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
“These can be commuted to the end of the circuit, in a procedure known as modifying the Pauli frame [124].”
MethodFault-Tolerant Linear Optical Quantum Computing with Small-Amplitude Coherent States
Lund, A. P., Ralph, T. C., & Haselgrove, H. L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.030503 · Cited by 294
Ultrafast and Fault-Tolerant Quantum Communication across Long Distances
Muralidharan, S., Kim, J., Lütkenhaus, N., Lukin, M. D., & Jiang, L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.250501 · Cited by 290
Demonstration of fault-tolerant universal quantum gate operations
Postler, L., Heuβen, S., Pogorelov, I., Rispler, M., Feldker, T., Meth, M., Marciniak, C. D., Stricker, R., Ringbauer, M., Blatt, R., et al. (2022) · Nature · doi:10.1038/s41586-022-04721-1 · Cited by 287
“Quantum state tomography of the experimentally prepared logical magic state is shown compared with the theoretical values in equation (41) in Fig.”
ResultComplete Methods Set for Scalable Ion Trap Quantum Information Processing
Home, J. P., Hanneke, D., Jost, J. D., Amini, J. M., Leibfried, D., & Wineland, D. J. (2009) · Science · doi:10.1126/science.1177077 · Cited by 283
Implementing a strand of a scalable fault-tolerant quantum computing fabric
Chow, J. M., Gambetta, J. M., Magesan, E., Abraham, D. W., Cross, A. W., Johnson, B. R., Masluk, N. A., Ryan, C. A., Smolin, J. A., Srinivasan, S. J., et al. (2014) · Nature Communications · doi:10.1038/ncomms5015 · Cited by 281
“The three transmon qubits (iA[1,3]) have transition frequencies {oi}/2p1⁄4 {5.”
BackgroundMethodInfluentialA Survey on Quantum Channel Capacities
Gyöngyösi, L., Imre, S., & Nguyen, H. V. (2018) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 299
Machnes, S., Sander, U., Glaser, S. J., de Fouquières, P., Gruslys, A., Schirmer, S., & Schulte-Herbrüggen, T. (2011) · Physical Review A · doi:10.1103/physreva.84.022305 · Cited by 267
Symmetrized Characterization of Noisy Quantum Processes
Emerson, J., Silva, M., Moussa, O., Ryan, C., Laforest, M., Baugh, J., Cory, D. G., & Laflamme, R. (2007) · Science · doi:10.1126/science.1145699 · Cited by 264
“While a characterisation of the twirled channel is useful given the relevance of twirled channels to fault-tolerant applications [23, 24], we remark that the failure probability of the twirled channel gives an upper bound to the failure probability of the original un-twirled channel whenever the performance of the cod…”
BackgroundExperimental fault-tolerant universal quantum gates with solid-state spins under ambient conditions
Rong, X., Geng, J., Shi, F., Liu, Y., Xu, K., Ma, W., Kong, F., Jiang, Z., Wu, Y., & Du, J. (2015) · Nature Communications · doi:10.1038/ncomms9748 · Cited by 257
“…of NV centre towards realistic quantum computation would require high fidelity quantum gates with errors below fault-tolerant threshold, which is proposed to be between 10 (cid:2) 4 and 10 (cid:2) 2 depending on the noise model and the computational overhead for realizing quantum gates 18–20 .”
Dynamically Error-Corrected Gates for Universal Quantum Computation
Khodjasteh, K., & Viola, L. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.080501 · Cited by 255
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 251
Efficient learning of quantum noise
Harper, R., Flammia, S. T., & Wallman, J. J. (2020) · Nature Physics · doi:10.1038/s41567-020-0992-8 · Cited by 212
Characterizing large-scale quantum computers via cycle benchmarking
Erhard, A., Wallman, J. J., Postler, L., Meth, M., Stricker, R., Martinez, E. A., Schindler, P., Monz, T., Emerson, J., & Blatt, R. (2019) · Nature Communications · doi:10.1038/s41467-019-13068-7 · Cited by 253
Universal quantum computation with theν=5∕2fractional quantum Hall state
Bravyi, S. (2006) · Physical Review A · doi:10.1103/physreva.73.042313 · Cited by 250
Varnava, M., Browne, D. E., & Rudolph, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.060502 · Cited by 248
Randomized Benchmarking and Process Tomography for Gate Errors in a Solid-State Qubit
Chow, J. M., Gambetta, J. M., Tornberg, L., Koch, J., Bishop, L. S., Houck, A. A., Johnson, B. R., Frunzio, L., Girvin, S. M., & Schoelkopf, R. J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.090502 · Cited by 246
Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction
Paetznick, A., & Reichardt, B. W. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.090505 · Cited by 242
Fault-Tolerant Quantum Computation with Long-Range Correlated Noise
Aharonov, D., Kitaev, A., & Preskill, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.050504 · Cited by 243
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
“Indeed, the Clifford operations map Pauli operators to Pauli operators and therefore it is only needed to keep track of the errors to update the Pauli frame in software [46].”
MethodDigital zero noise extrapolation for quantum error mitigation
Giurgica-Tiron, T., Hindy, Y., LaRose, R., Mari, A., & Zeng, W. J. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00045 · Cited by 241
“There are many examples of error-mitigating techniques, including probabilistic error cancellation [5], [6], randomized compiling [7], Pauli-frame randomization [8], dynamical decoupling [9]–[12], quantum optimal control [13], [14], etc.”
MethodDigital zero noise extrapolation for quantum error mitigation
Giurgica-Tiron, T., Hindy, Y., LaRose, R., Mari, A., & Zeng, W. J. (2020) · arXiv · doi:10.48550/arxiv.2005.10921 · Cited by 241
Souza, A. M., Álvarez, G. A., & Suter, D. (2012) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2011.0355 · Cited by 230
Room temperature high-fidelity holonomic single-qubit gate on a solid-state spin
Arroyo-Camejo, S., Lazariev, A., Hell, S. W., & Balasubramanian, G. (2014) · Nature Communications · doi:10.1038/ncomms5870 · Cited by 229
(1982) · Elsevier eBooks · doi:10.1016/c2009-0-24486-2 · Cited by 231
Blueprint for a scalable photonic fault-tolerant quantum computer
Bourassa, J. E., Alexander, R. N., Baragiola, B. Q., & Menicucci, N. C. (2024) · Figshare · Cited by 222
Optimized driving of superconducting artificial atoms for improved single-qubit gates
Chow, J. M., DiCarlo, L., Gambetta, J. M., Motzoi, F., Frunzio, L., Girvin, S. M., & Schoelkopf, R. J. (2010) · Physical Review A · doi:10.1103/physreva.82.040305 · Cited by 222
Quantum Error Correction with Only Two Extra Qubits
Chao, R., & Reichardt, B. W. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.050502 · Cited by 221
“—In order to get a sense for the practicality of the 2-qubit error-correction schemes, we simulate error correction using a standard depolarizing noise error model on the 1- and 2-qubit operations [30].”
MethodUltrafast Quantum Gates in Circuit QED
Romero, G., Ballester, D., Wang, Y. M., Scarani, V., & Solano, E. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.120501 · Cited by 214
From quantum multiplexing to high-performance quantum networking
Munro, W. J., Harrison, K. A., Stephens, A. M., Devitt, S. J., & Nemoto, K. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.213 · Cited by 215
“It is a property of CSS codes that an error syndrome can be obtained by teleporting a logical qubit using an already prepared logical Bell state, where the two logical measurements in the teleportation circuit reveal the syndrome of the code, which is decoded to determine the logical operation required to complete the…”
MethodSingle-qubit-gate error below10−4in a trapped ion
Brown, K. R., Wilson, A. C., Colombe, Y., Ospelkaus, C., Meier, A. M., Knill, E., Leibfried, D., & Wineland, D. J. (2011) · Physical Review A · doi:10.1103/physreva.84.030303 · Cited by 214
“[14] Knill, E.”
BackgroundSelf-citationPhotonic Architecture for Scalable Quantum Information Processing in Diamond
Nemoto, K., Trupke, M., Devitt, S. J., Stephens, A. M., Scharfenberger, B., Buczak, K., Nöbauer, T., Everitt, M. S., Schmiedmayer, J., & Munro, W. J. (2014) · Physical Review X · doi:10.1103/physrevx.4.031022 · Cited by 212
Bang–bang control of fullerene qubits using ultrafast phase gates
Morton, J. J. L., Tyryshkin, A. M., Ardavan, A., Benjamin, S. C., Porfyrakis, K., Lyon, S. A., & Briggs, G. A. D. (2006) · Nature Physics · doi:10.1038/nphys192 · Cited by 213
“Two well known concepts in overcoming the corruption of information stored within a qubit are decoherence free subspaces [6, 7, 8, 9], and quantum error correcting codes [10, 11, 12].”
BackgroundNielsen, E., Gamble, J. K., Rudinger, K., Scholten, T., Young, K., & Blume-Kohout, R. (2021) · Quantum · doi:10.22331/q-2021-10-05-557 · Cited by 189
Experimental demonstration of topological error correction
Yao, X.-C., Wang, T.-X., Chen, H.-Z., Gao, W.-B., Fowler, A. G., Raussendorf, R., Chen, Z.-B., Liu, N.-L., Lu, C.-Y., Deng, Y.-J., et al. (2012) · Nature · doi:10.1038/nature10770 · Cited by 208
“The capstone result in QEC, the so-called threshold theorem [7, 8], states that as long as the error rate p per gate in a quantum computer is smaller than a threshold value pc, arbitrarily long and accurate quantum computation is efficiently possible.”
BackgroundVirtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 205
“[35] E Knill, “Quantum computing with realistically noisy devices,” Nature 434, 39–44 (2005).”
BackgroundSilicon qubit fidelities approaching incoherent noise limits via pulse engineering
Yang, C. H., Chan, K. W., Harper, R., Huang, W., Evans, T., Hwang, J. C. C., Hensen, B., Laucht, A., Tanttu, T., Hudson, F. E., et al. (2019) · Nature Electronics · doi:10.1038/s41928-019-0234-1 · Cited by 201
“Process (3) is a simple five-repetition sequence of (1) + (2) + calibration; this is repeated on the y axis in Fig.”
BackgroundMethodInfluentialLoss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction
Varnava, M., Browne, D. E., & Rudolph, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.120501 · Cited by 203
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203
Bias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
“This approximation can always be enforced by actively randomizing the Pauli frame at each step of a computation [2, 29] The resulting channel can then be understood in the stochastic noise model by assigning a probability to each fault-path.”
Fault-tolerant quantum computation against biased noise
Aliferis, P., & Preskill, J. (2008) · Physical Review A · doi:10.1103/physreva.78.052331 · Cited by 204
Superconducting nanocircuits for topologically protected qubits
Gladchenko, S., Olaya, D., Dupont-Ferrier, E., Douçot, B., Ioffe, L. B., & Gershenson, M. E. (2009) · Nature Physics · doi:10.1038/nphys1151 · Cited by 201
“For implementation of quantum correction codes, the decoherence time of a qubit, τd, should be at least 10(4) times longer than the time of a single operation, τ0 [1,2].”
BackgroundSpintronics: A contemporary review of emerging electronics devices
Joshi, V. K. (2016) · Engineering Science and Technology, an International Journal · doi:10.1016/j.jestch.2016.05.002 · Cited by 196
“However, bit flip errors can be handled up to an extent by error correcting codes up to a certain extent [9,10].”
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.