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 101–200 of 1,003
Entanglement and control of single nuclear spins in isotopically engineered silicon carbide
Bourassa, A., Anderson, C. P., Miao, K. C., Onizhuk, M., Ma, H., Crook, A. L., Abe, H., Ul-Hassan, J., Ohshima, T., Son, N. T., et al. (2020) · Nature Materials · doi:10.1038/s41563-020-00802-6 · Cited by 194
Scalable Quantum Circuit and Control for a Superconducting Surface Code
Versluis, R., Poletto, S., Khammassi, N., Tarasinski, B., Haider, N., Michalak, D. J., Bruno, A., Bertels, K., & DiCarlo, L. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.034021 · Cited by 193
“We define circuit depth as the number of operations on each ancilla per QEC cycle, counting in measurement but excluding ancilla initialization [we assume Pauli frame updating [13,31] is used for data and ancilla qubits].”
MethodQuantum Image Processing and Its Application to Edge Detection: Theory and Experiment
Yao, X.-W., Wang, H., Liao, Z., Chen, M.-C., Pan, J., Li, J., Zhang, K., Lin, X., Wang, Z., Luo, Z., et al. (2017) · Physical Review X · doi:10.1103/physrevx.7.031041 · Cited by 186
Multilayer microwave integrated quantum circuits for scalable quantum computing
Brecht, T., Pfaff, W., Wang, C., Chu, Y., Frunzio, L., Devoret, M. H., & Schoelkopf, R. J. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.2 · Cited by 191
“When scaling up the system size, error rates need to remain below the threshold for quantum error correction.[13, 14] At the same time, the different components must retain the ability to selectively interact with each other while being externally addressed”
BackgroundEnhanced Fault-Tolerant Quantum Computing ind-Level Systems
Campbell, E. T. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.230501 · Cited by 184
High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction
Fukui, K., Tomita, A., Okamoto, A., & Fujii, K. (2018) · Physical Review X · doi:10.1103/physrevx.8.021054 · Cited by 171
“code [17] can achieve the hashing bound of the standard deviation of about 0.”
Quantum Control over Single Spins in Diamond
Dobrovitski, V. V., Fuchs, G. D., Falk, A. L., Santori, C., & Awschalom, D. D. (2013) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-030212-184238 · Cited by 178
Fault-tolerant quantum error detection
Linke, N. M., Gutierrez, M., Landsman, K. A., Figgatt, C., Debnath, S., Brown, K. R., & Monroe, C. (2017) · Science Advances · doi:10.1126/sciadv.1701074 · Cited by 172
Arbitrarily Accurate Dynamical Control in Open Quantum Systems
Khodjasteh, K., Lidar, D. A., & Viola, L. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.090501 · Cited by 174
Quantum Computing with Rotation-Symmetric Bosonic Codes
Grimsmo, A. L., Combes, J., & Baragiola, B. Q. (2020) · Physical Review X · doi:10.1103/physrevx.10.011058 · Cited by 170
“− Since our scheme for quantum computation is based only on Clifford gates and magic-state injection, rather than correcting the conditional Pauli ¯ X , the simplest solution is to keep track of it in a Pauli frame [33, 65].”
BackgroundMethodExperimental purification of two-atom entanglement
Reichle, R., Leibfried, D., Knill, E., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2006) · Nature · doi:10.1038/nature05146 · Cited by 174
Self-citationAll-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
Baragiola, B. Q., Pantaleoni, G., Alexander, R. N., Karanjai, A., & Menicucci, N. C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200502 · Cited by 173
“Intuitively, this is just Knill-type error correction [47], which involves teleporting the state to be corrected through an encoded Bell pair and reinterpreting vacuum teleportation as heterodyne detection.”
MethodSilicon quantum processor with robust long-distance qubit couplings
Tosi, G., Mohiyaddin, F. A., Schmitt, V., Tenberg, S., Rahman, R., Klimeck, G., & Morello, A. (2017) · Nature Communications · doi:10.1038/s41467-017-00378-x · Cited by 168
“7d), in which case more advanced error-correction codes can be implem ented 1, 3, 4, 50 .”
BackgroundMagic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes
Campbell, E. T., Anwar, H., & Browne, D. E. (2012) · Physical Review X · doi:10.1103/physrevx.2.041021 · Cited by 164
Errors in trapped-ion quantum gates due to spontaneous photon scattering
Ozeri, R., Itano, W. M., Blakestad, R. B., Britton, J., Chiaverini, J., Jost, J. D., Langer, C., Leibfried, D., Reichle, R., Seidelin, S., et al. (2007) · Physical Review A · doi:10.1103/physreva.75.042329 · Cited by 166
Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors
Barrett, S. D., & Stace, T. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.200502 · Cited by 164
Microwaves in Quantum Computing
Bardin, J. C., Slichter, D. H., & Reilly, D. J. (2021) · IEEE Journal of Microwaves · doi:10.1109/jmw.2020.3034071 · Cited by 213
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
“[57] E.”
BackgroundPhysical implementation of protected qubits
Douçot, B., & Ioffe, L. B. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/7/072001 · Cited by 160
Experimental Realization of a Protected Superconducting Circuit Derived from the 0 – π Qubit
Gyenis, A., Mundada, P., Paolo, A. D., Hazard, T., You, X., Schuster, D., Koch, J., Blais, A., & Houck, A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010339 · Cited by 217
Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
Tzitrin, I., Bourassa, J. E., Menicucci, N. C., & Sabapathy, K. K. (2020) · Physical Review A · doi:10.1103/physreva.101.032315 · Cited by 157
Single-qubit gates based on targeted phase shifts in a 3D neutral atom array
Wang, Y., Kumar, A., Wu, T.-Y., & Weiss, D. S. (2016) · Science · doi:10.1126/science.aaf2581 · Cited by 159
“commonly accepted error-threshold [7, 8] (error per gate < 10−4), for fault-tolerant quantum computation [9–12].”
BackgroundFlag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
“Knill EC typically achieves higher thresholds than Shor and Steane EC but often uses more qubits [20, 21].”
BackgroundMagic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes
Campbell, E. T., Anwar, H., & Browne, D. E. (2012) · UCL Discovery (University College London) · doi:10.17169/refubium-18291 · Cited by 159
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
“Asymptotically, this is a very favorable scaling of overhead (ratio of physical qubits to logical qubits), but in practice the constant factors hidden by the big-O notation are quite large, ranging from hundreds or thousands for the most efficient known protocols to billions for protocols maximally optimized for high…”
BackgroundBias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · University of Chicago · doi:10.6082/axtxm-6xw57 · Cited by 154
High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction
Fukui, K., Tomita, A., Okamoto, A., & Fujii, K. (2018) · Institutional Repositories DataBase (IRDB) · Cited by 152
Muhonen, J. T., Laucht, A., Simmons, S., Dehollain, J. P., Kalra, R., Hudson, F. E., Freer, S., Itoh, K. M., Jamieson, D. N., McCallum, J. C., et al. (2015) · Journal of Physics: Condensed Matter · doi:10.1088/0953-8984/27/15/154205 · Cited by 151
“We have quantified the quantum gate fidelities of 31P electron and nuclear spin qubits in isotopically enriched 28Si and showed that they exceed some fault-tolerance thresholds [7, 8].”
BackgroundMethodRealization of a programmable two-qubit quantum processor
Hanneke, D., Home, J. P., Jost, J. D., Amini, J. M., Leibfried, D., & Wineland, D. J. (2010) · Nature Physics · doi:10.1038/nphys1453 · Cited by 150
“This will require much higher gate fidelities than shown here, both to achieve fault-tolerance and to reduce error correction’s computational overhead[28].”
BackgroundHigh Fidelity Quantum Gates via Dynamical Decoupling
West, J. R., Lidar, D. A., Fong, B. H., & Gyure, M. F. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.230503 · Cited by 148
Lee, S.-W., & Jeong, H. (2013) · Physical Review A · doi:10.1103/physreva.87.022326 · Cited by 162
“In order to realize scalable quantum computation, the amount of noise per operation should be below a fault tolerant threshold [22–24].”
BackgroundMeasuring the capabilities of quantum computers
Proctor, T., Rudinger, K., Young, K., Nielsen, E., & Blume-Kohout, R. (2022) · Nature Physics · doi:10.1038/s41567-021-01409-7 · Cited by 146
“In our benchmarking experiments we use two transformations: the trivial transformation given by Q1(L) = {L−1}, and the transformation in whichQ1(L) consists of all 4w layers L̃−1 that satisfy U(L̃−1) = U(Q̃′L−1) for some Q̃′ ∈ Pw (which is similar to Pauli frame randomization [35, 44, 45]).”
BackgroundMethodResultInfluentialFaster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
“The X gate in each round can be performed with a Pauli frame [49–51], so counting measurement as a gate, the number of gates per round is 2, and the average number of gates per PAR is 4.”
BackgroundMethodLiquid-state nuclear magnetic resonance as a testbed for developing quantum control methods
Ryan, C. A., Negrevergne, C., Laforest, M., Knill, E., & Laflamme, R. (2008) · Physical Review A · doi:10.1103/physreva.78.012328 · Cited by 145
Self-citationHigh-Fidelity Trapped-Ion Quantum Logic Using Near-Field Microwaves
Harty, T. P., Sepiol, M. A., Allcock, D. T. C., Ballance, C. J., Tarlton, J. E., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.140501 · Cited by 144
Quantum Universality from Magic States Distillation Applied to CSS Codes
Reichardt, B. W. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-7654-8 · Cited by 143
Lower bounds on the non-Clifford resources for quantum computations
Beverland, M., Campbell, E., Howard, M., & Kliuchnikov, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8963 · Cited by 140
“Many promising architectures for universal fault-tolerant quantum computing [20, 34] perform computation by applying stabilizer operations to carefully prepared resource states known as magic states [6, 13, 38].”
BackgroundNuclear spins in nanostructures
Coish, W. A., & Baugh, J. (2009) · physica status solidi (b) · doi:10.1002/pssb.200945229 · Cited by 142
Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
Grimsmo, A. L., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020101 · Cited by 132
“As shown in the figure, the propagation of displacement errors through the two circuits are essentially equivalent, but the Knill circuit does not require any active recovery.”
BackgroundMethodInfluentialRepeat-until-success quantum computing using stationary and flying qubits
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006) · Physical Review A · doi:10.1103/physreva.73.012304 · Cited by 138
Cooling and entangling ultracold atoms in optical lattices
Yang, B., Sun, H., Huang, C.-J., Wang, H.-Y., Deng, Y., Dai, H.-N., Yuan, Z.-S., & Pan, J.-W. (2020) · Science · doi:10.1126/science.aaz6801 · Cited by 163
Effective Fault-Tolerant Quantum Computation with Slow Measurements
DiVincenzo, D. P., & Aliferis, P. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.020501 · Cited by 135
Nuclear spins in nanostructuresPreprint
Coish, W. A., & Baugh, J. (2012) · Cited by 141
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
“Most recently, work by Steane [14] and Knill [17] (see also Reichardt [16]) has pushed the threshold down to values that are claimed to be very close to being within experimental reach.”
BackgroundInfluentialFour-body ring-exchange interactions and anyonic statistics within a minimal toric-code Hamiltonian
Dai, H.-N., Yang, B., Reingruber, A., Sun, H. K., Xu, X., Chen, Y.-A., Yuan, Z.-S., & Pan, J.-W. (2017) · Nature Physics · doi:10.1038/nphys4243 · Cited by 171
“26(3) of the oscillations are mainly limited by the Mott filling properties, which give rise to ∼0.”
BackgroundInfluentialFault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
Robustness of nonadiabatic holonomic gates
Johansson, M., Sjöqvist, E., Andersson, L. M., Ericsson, M., Hessmo, B., Singh, K., & Tong, D. M. (2012) · Physical Review A · doi:10.1103/physreva.86.062322 · Cited by 132
Quantum computation with universal error mitigation on a superconducting quantum processor
Song, C., Cui, J., Wang, H., Hao, J., Feng, H., & Li, Y. (2019) · Science Advances · doi:10.1126/sciadv.aaw5686 · Cited by 131
“To estimate the fidelity required to achieve the same computation accuracy, we consider a quantum systemwith depolarizing error channels (23) and assume that the state preparation and single-qubit gates are ideal.”
Encoding a qubit into a cavity mode in circuit QED using phase estimation
Terhal, B. M., & Weigand, D. (2016) · Physical Review A · doi:10.1103/physreva.93.012315 · Cited by 127
“Here we show that it is not necessary to do these additional displacement operations, but one can work with a phase frame similar as the Pauli frame for stabilizer codes [46],[5].”
MethodReduced phase error through optimized control of a superconducting qubit
Lucero, E., Kelly, J., Bialczak, R. C., Lenander, M., Mariantoni, M., Neeley, M., O’Connell, A. D., Sank, D., Wang, H., Weides, M., et al. (2010) · Physical Review A · doi:10.1103/physreva.82.042339 · Cited by 130
Fault-Tolerant Logical Gates in the IBM Quantum Experience
Harper, R., & Flammia, S. T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.080504 · Cited by 127
Noise Thresholds for Optical Quantum Computers
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.020501 · Cited by 127
Error-resistant single-qubit gates with trapped ions
Timoney, N., Elman, V., Glaser, S., Weiss, C., Johanning, M., Neuhauser, W., & Wunderlich, C. (2008) · Physical Review A · doi:10.1103/physreva.77.052334 · Cited by 126
Experimental demonstration of a graph state quantum error-correction code
Bell, B. A., Herrera-Martí, D. A., Tame, M. S., Markham, D., Wadsworth, W. J., & Rarity, J. G. (2014) · Nature Communications · doi:10.1038/ncomms4658 · Cited by 122
Optimum pulse shapes for stimulated Raman adiabatic passage
Vasilev, G. S., Kuhn, A., & Vitanov, N. V. (2009) · Physical Review A · doi:10.1103/physreva.80.013417 · Cited by 124
A new phase in quantum computation
Sjöqvist, E. (2008) · Physics · doi:10.1103/physics.1.35 · Cited by 129
Multibit C k NOT quantum gates via Rydberg blockade
Isenhower, L., Saffman, M., & Mølmer, K. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0292-4 · Cited by 122
“Analysis of models for quantum computation predict error thresholds for fault tolerant operation at 1% [30] or higher [31].”
MethodBounding quantum gate error rate based on reported average fidelity
Sanders, Y. R., Wallman, J. J., & Sanders, B. C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/18/1/012002 · Cited by 119
Measurement-Based Quantum Computation with Trapped Ions
Lanyon, B. P., Jurcevic, P., Zwerger, M., Hempel, C., Martinez, E. A., Dür, W., Briegel, H. J., Blatt, R., & Roos, C. F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.210501 · Cited by 120
Ryan, C. A., Laforest, M., & Laflamme, R. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/1/013034 · Cited by 104
“Finally because it is too difficult to show fault-tolerance for an arbitrary distribution of errors, proofs [19] and simulations [20] of fault-tolerance schemes rely on a stochastic distribution of error locations or a depolarizing error model, respectively, for which the average fidelity should be the relevant quanti…”
BackgroundYoder, T. J., & Kim, I. H. (2017) · Quantum · doi:10.22331/q-2017-04-25-2 · Cited by 98
“The recovery is never explicitly applied; we simply adjust the Pauli frame [40].”
MethodMitiq: A software package for error mitigation on noisy quantum computers
LaRose, R., Mari, A., Kaiser, S., Karalekas, P. J., Alves, A. A., Czarnik, P., Mandouh, M. E., Gordon, M. H., Hindy, Y., Robertson, A., et al. (2022) · Quantum · doi:10.22331/q-2022-08-11-774 · Cited by 217
Modeling and simulating the noisy behavior of near-term quantum computers
Γεωργόπουλος, Κ., Emary, C., & Zuliani, P. (2021) · Physical Review A · doi:10.1103/physreva.104.062432 · Cited by 171
“Effectively, a Pauli operator is chosen to be applied at operations that have a probability to produce an erroneous result [10, 13, 20].”
BackgroundQuantifying magic for multi-qubit operations
Seddon, J. R., & Campbell, E. T. (2019) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0251 · Cited by 168
Quantum Computing With Rotation-Symmetric Bosonic Codes
Grimsmo, A. L., Combes, J., & Baragiola, B. Q. (2024) · Figshare · Cited by 133
Direct Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
“Assume that the gate errors are stochastic, which can be enforced to a good approximation by, e.g., Pauli-frame randomization [51–53] or by following each layer in DRB with a random n -qubit Pauli gate.”
MethodQuantum networks with neutral atom processing nodes
Covey, J. P., Weinfurter, H., & Bernien, H. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00759-9 · Cited by 180
Fault-tolerant architectures for superconducting qubits
DiVincenzo, D. P. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014020 · Cited by 90
“But, as also recognized from the beginning (especially in [7]), and going on all the way to Knill’s work [17], these estimates are based on unrealistic views of how a quantum computer could be put together.”
BackgroundHigh-Fidelity Gates in a Single Josephson Qubit
Lucero, E., Hofheinz, M., Ansmann, M., Bialczak, R. C., Katz, N., Neeley, M., O’Connell, A. D., Wang, H., Cleland, A. N., & Martinis, J. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.247001 · Cited by 116
Encoding a magic state with beyond break-even fidelity
Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., et al. (2024) · Nature · doi:10.1038/s41586-023-06846-3 · Cited by 115
Qudit versions of the qubit π/8 gate
Howard, M., & Vala, J. (2012) · Physical Review A · doi:10.1103/physreva.86.022316 · Cited by 153
Information-preserving structures: A general framework for quantum zero-error information
Blume-Kohout, R., Ng, H. K., Poulin, D., & Viola, L. (2010) · Physical Review A · doi:10.1103/physreva.82.062306 · Cited by 134
Local fault-tolerant quantum computation
Svore, K. M., Terhal, B. M., & DiVincenzo, D. P. (2005) · Physical Review A · doi:10.1103/physreva.72.022317 · Cited by 112
Álvarez, G. A., Ajoy, A., Peng, X., & Suter, D. (2010) · Physical Review A · doi:10.1103/physreva.82.042306 · Cited by 120
Zhang, J., Long, G. L., Zhang, W., Deng, Z., Liu, W., & Lu, Z. (2005) · Physical Review A · doi:10.1103/physreva.72.012331 · Cited by 119
Quantum Kronecker sum-product low-density parity-check codes with finite rate
Kovalev, A. A., & Pryadko, L. P. (2013) · Physical Review A · doi:10.1103/physreva.88.012311 · Cited by 107
Completely positive master equation for arbitrary driving and small level spacing
Mozgunov, E., & Lidar, D. A. (2020) · Quantum · doi:10.22331/q-2020-02-06-227 · Cited by 161
“, in the analysis of fault-tolerant quantum error correction [42].”
MethodFault tolerance of quantum low-density parity check codes with sublinear distance scaling
Kovalev, A. A., & Pryadko, L. P. (2013) · Physical Review A · doi:10.1103/physreva.87.020304 · Cited by 107
Dynamical quantum error correction of unitary operations with bounded controls
Khodjasteh, K., & Viola, L. (2009) · Physical Review A · doi:10.1103/physreva.80.032314 · Cited by 112
Simulation of Non-Abelian Braiding in Majorana Time Crystals
Bomantara, R. W., & Gong, J. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.230405 · Cited by 117
Efficient classical simulation of noisy random quantum circuits in one dimension
Noh, K., Jiang, L., & Fefferman, B. (2020) · Quantum · doi:10.22331/q-2020-09-11-318 · Cited by 174
“While currently available quantum devices are not large and reliable enough to factor a large integer or simulate the dynamics of a large quantum system, it has been established over the past two decades that fault-tolerant quantum computing is in principle possible via quantum error correction [3–8].”
BackgroundDesign and analysis of communication protocols for quantum repeater networks
Jones, C., Kim, D., Rakher, M. T., Kwiat, P. G., & Ladd, T. D. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/8/083015 · Cited by 98
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105
Analog Quantum Error Correction with Encoding a Qubit into an Oscillator
Fukui, K., Tomita, A., & Okamoto, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180507 · Cited by 104
Coherent spin-state transfer via Heisenberg exchange
Kandel, Y. P., Qiao, H., Fallahi, S., Gardner, G. C., Manfra, M. J., & Nichol, J. M. (2019) · Nature · doi:10.1038/s41586-019-1566-8 · Cited by 113
Parity-Protected Superconductor-Semiconductor Qubit
Larsen, T. W., Gershenson, M. E., Casparis, L., Kringhøj, A., Pearson, N., McNeil, R. P. G., Kuemmeth, F., Krogstrup, P., Petersson, K. D., & Marcus, C. M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.056801 · Cited by 141
Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture
Larsen, M. V., Chamberland, C., Noh, K., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030325 · Cited by 99
“In practice, the error recovery is simply handled by using and updating a Pauli frame [55–58], similar to how feed-forward can be handled in MBQC by compensating for by-products in the following measurement outcomes [2, 3].”
MethodNormal modes of trapped ions in the presence of anharmonic trap potentials
Home, J. P., Hanneke, D., Jost, J. D., Leibfried, D., & Wineland, D. J. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/7/073026 · Cited by 102
Complete disentanglement by partial pure dephasing
Roszak, K., & Machnikowski, P. (2006) · Physical Review A · doi:10.1103/physreva.73.022313 · Cited by 106
Molecular dipolar crystals as high-fidelity quantum memory for hybrid quantum computing
Rabl, P., & Zoller, P. (2007) · Physical Review A · doi:10.1103/physreva.76.042308 · Cited by 109
Grace, M., Brif, C., Rabitz, H., Walmsley, I. A., Kosut, R. L., & Lidar, D. A. (2007) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/0953-4075/40/9/s06 · Cited by 100
Fault-tolerant computing with biased-noise superconducting qubits: a case study
Aliferis, P., Brito, F., DiVincenzo, D. P., Preskill, J., Steffen, M., & Terhal, B. M. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/1/013061 · Cited by 98
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99
State readout of a trapped ion qubit using a trap-integrated superconducting photon detector
Todaro, S. L., Verma, V. B., McCormick, K. C., Allcock, D. T. C., Mirin, R. P., Wineland, D. J., Nam, S. W., Wilson, A. C., Leibfried, D., & Slichter, D. H. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.010501 · Cited by 98
“Qubit state readout is an essential part of quantum computing and simulation [1, 2], including most quantum error correction protocols [3, 4].”
BackgroundCoping with qubit leakage in topological codes
Fowler, A. G. (2013) · Physical Review A · doi:10.1103/physreva.88.042308 · Cited by 97
Quantum information processing and metrology with trapped ions
Wineland, D. J., & Leibfried, D. G. (2011) · Laser Physics Letters · doi:10.1002/lapl.201010125 · Cited by 118
Improving Quantum Gate Fidelities by Using a Qubit to Measure Microwave Pulse Distortions
Gustavsson, S., Zwier, O., Bylander, J., Yan, F., Yoshihara, F., Nakamura, Y., Orlando, T. P., & Oliver, W. D. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.040502 · Cited by 95
Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates
Jochym-O’Connor, T., & Laflamme, R. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.010505 · Cited by 96
Deep neural decoders for near term fault-tolerant experiments
Chamberland, C., & Ronagh, P. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aad1f7 · Cited by 86
“In this section we will give an overview of Knill error correction [8, 9] which is applicable to any stabilizer code.”
BackgroundMethodAccuracy threshold for postselected quantum computation
Aliferis, P., Gottesman, D., & Preskill, J. (2008) · Quantum Information and Computation · doi:10.26421/qic8.3-4-1 · Cited by 96
“Following Knill [10], the error-detecting code C1 used in our fault-tolerant constructions has parameters [[n, k, d]]=[[4,2,2]]; that is, it encodes k = 2 logical qubits in n = 4 physical qubits and has distance d = 2.”
BackgroundMethodResultInfluential
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.