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 401–500 of 1,003
Resource Reduction for Distributed Quantum Information Processing Using Quantum Multiplexed Photons
Piparo, N. L., Hanks, M., Gravel, C., Nemoto, K., & Munro, W. J. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.210503 · Cited by 37
Quantum Error Correction: Noise-Adapted Techniques and Applications
Jayashankar, A., & Mandayam, P. (2022) · Journal of the Indian Institute of Science · doi:10.1007/s41745-022-00332-x · Cited by 53
“Fault-tolerant protocols build upon the QEC framework and enable the construction of quantum circuits that are truly noise-resilient, provided the noise is below a certain threshold value [31, 32].”
BackgroundImplementation of an advanced dressing protocol for global qubit control in silicon
Hansen, I., Seedhouse, A. E., Chan, K. W., Hudson, F. E., Itoh, K. M., Laucht, A., Saraiva, A., Yang, C. H., & Dzurak, A. S. (2022) · Applied Physics Reviews · doi:10.1063/5.0096467 · Cited by 35
Techniques for combining fast local decoders with global decoders under circuit-level noise
Chamberland, C., Goncalves, L., Sivarajah, P., Peterson, E., & Grimberg, S. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace64d · Cited by 74
“We also consider a framework where we keep track of a Pauli frame [18, 57, 58] throughout the execution of the quantum algorithm.”
One-shot entanglement generation over long distances in noisy quantum networks
Perseguers, S., Jiang, L., Schuch, N., Verstraete, F., Lukin, M. D., Cirac, J. I., & Vollbrecht, K. G. H. (2008) · Physical Review A · doi:10.1103/physreva.78.062324 · Cited by 36
Fault-tolerant one-bit addition with the smallest interesting color code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2024) · Science Advances · doi:10.1126/sciadv.ado9024 · Cited by 64
Low-overhead transversal fault tolerance for universal quantum computation
Zhou, H., Zhao, C., Cain, M., Bluvstein, D., Maskara, N., Duckering, C., Hu, H.-Y., Wang, S.-T., Kubica, A., & Lukin, M. D. (2025) · Nature · doi:10.1038/s41586-025-09543-5 · Cited by 197
One-way quantum repeaters with quantum Reed-Solomon codes
Muralidharan, S., Zou, C., Li, L., & Jiang, L. (2018) · Physical Review A · doi:10.1103/physreva.97.052316 · Cited by 32
Contextuality of General Probabilistic Theories
Shähandeh, F. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010330 · Cited by 44
Randomized Benchmarking Using Nondestructive Readout in a Two-Dimensional Atom Array
Nikolov, B., Diamond-Hitchcock, E., Bass, J., Spong, N. L. R., & Pritchard, J. D. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.030602 · Cited by 51
Parallel Transport Quantum Logic Gates with Trapped Ions
de Clercq, L. E., Lo, H.-Y., Marinelli, M., Nadlinger, D., Oswald, R., Negnevitsky, V., Kienzler, D., Keitch, B., & Home, J. P. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.080502 · Cited by 32
Noise threshold for a fault-tolerant two-dimensional lattice architecture
Svore, K. M., Divincenzo, D. P., & Terhal, B. M. (2007) · Quantum Information and Computation · doi:10.26421/qic7.4-2 · Cited by 135
“In this way, two-qubit CNOT gates between nearest-neighbor qubits in the cell become (transversal) CNOT gates between two neighboring cells.”
BackgroundFault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.09893 · Cited by 32
Sunami, S., Tamiya, S., Inoue, R., Yamasaki, H., & Goban, A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010101 · Cited by 73
“10 − 2 [23, 43–46], such a noisy CNOT gate may be insufficient for achieving FTQC.”
InfluentialGeometric quantum gates with superconducting qubits
Kamleitner, I., Solinas, P., Müller, C., Shnirman, A., & Möttönen, M. (2011) · Physical Review B · doi:10.1103/physrevb.83.214518 · Cited by 32
Krishna, A., Spekkens, R. W., & Wolfe, E. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa9168 · Cited by 45
“For instance, in the context of the state injection model for quantum computation [4, 5], the failure of noncontextuality has been shown in some cases to be necessary for achieving universal quantum computation [6, 7].”
BackgroundQuantum repeaters based on two species trapped ions
Santra, S., Muralidharan, S., Lichtman, M., Jiang, L., Monroe, C., & Malinovsky, V. S. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab2a45 · Cited by 35
Ma, Y., Pan, X., Cai, W., Mu, X. D., Xu, Y., Hu, L., Wang, W., Wang, H., Song, Y., Yang, Z., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.180503 · Cited by 31
“Besides fundamental interest, such states are a key resource for quantum-based technologies, including concatenated error correcting codes [7], quantum simulation [8, 9], and Heisenberg-limited quantum metrology [10].”
BackgroundMethodConditional teleportation of quantum-dot spin states
Qiao, H., Kandel, Y. P., Manikandan, S. K., Jordan, A. N., Fallahi, S., Gardner, G. C., Manfra, M. J., & Nichol, J. M. (2020) · RePEc: Research Papers in Economics · Cited by 31
All-Photonic Architecture for Scalable Quantum Computing with Greenberger-Horne-Zeilinger States
Omkar, S., Lee, S.-H., Teo, Y. S., Lee, S.-W., & Jeong, H. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030309 · Cited by 40
High-fidelity adiabatic quantum computation via dynamical decoupling
Quiroz, G., & Lidar, D. A. (2012) · Physical Review A · doi:10.1103/physreva.86.042333 · Cited by 37
Nanoelectronics in Radio-Frequency Technology
Russer, P., & Fichtner, N. (2010) · IEEE Microwave Magazine · doi:10.1109/mmm.2010.936077 · Cited by 31
Contextuality Supplies the Magic for Quantum Computation
Howard, M., Wallman, J. J., Veitch, V., & Emerson, J. (2015) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2015.46 · Cited by 65
“Here [1] we establish that quantum contextuality, a generalization of nonlocality identified by Bell [2] and Kochen-Specker [3] almost 50 years ago, is a critical resource for quantum speed-up within the leading model for fault-tolerant quantum computation, known as magic state distillation (MSD) [4], [5].”
Topologically Protected Quantum Logic Gates with Valley‐Hall Photonic Crystals
He, L., Liu, D., Zhang, H., Zhang, F., Zhang, W., Feng, X., Huang, Y., Cui, K., Liu, F., Zhang, W., et al. (2024) · Advanced Materials · doi:10.1002/adma.202311611 · Cited by 37
Fault-Tolerant Quantum Computation Using Large Spin-Cat Codes
Omanakuttan, S., Buchemmavari, V., Gross, J. A., Deutsch, I., & Marvian, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020355 · Cited by 66
“However, such decoherence models often entail stringent thresh-∗ old requirements and result in significant overheads for FTQC [8, 9, 19, 20].”
BackgroundHigh-fidelity spatial and polarization addressing of Ca+43 qubits using near-field microwave control
Aude Craik, D. P. L., Linke, N. M., Sepiol, M. A., Harty, T. P., Goodwin, J. F., Ballance, C. J., Stacey, D. N., Steane, A. M., Lucas, D. M., & Allcock, D. T. C. (2017) · Physical Review A · doi:10.1103/physreva.95.022337 · Cited by 30
Stabilizer Slicing: Coherent Error Cancellations in Low-Density Parity-Check Stabilizer Codes
Debroy, D. M., Li, M., Newman, M., & Brown, K. R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.250502 · Cited by 42
Characterizing Midcircuit Measurements on a Superconducting Qubit Using Gate Set Tomography
Rudinger, K., Ribeill, G. J., Govia, L. C. G., Ware, M., Nielsen, E., Young, K. C., Ohki, T., Blume-Kohout, R., & Proctor, T. J. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014014 · Cited by 58
Pauli error estimation via Population Recovery
Flammia, S. T., & O’Donnell, R. (2021) · Quantum · doi:10.22331/q-2021-09-23-549 · Cited by 63
“Additional motivation for the Pauli channel model comes from the practical technique of randomized compiling [18, 29], which converts a general noise channel Λ (with potentially coherent errors) to a Pauli channel ΛP having the same process fidelity as the original channel.”
MethodSingle-Shot Readout of a Driven Hybrid Qubit in a GaAs Double Quantum Dot
Jang, W., Cho, M.-K., Jang, H., Kim, J., Park, J., Kim, G., Kang, B., Jung, H., Umansky, V., & Kim, D. (2021) · Nano Letters · doi:10.1021/acs.nanolett.1c00783 · Cited by 30
A survey on advances of quantum repeater
Yan, P., Zhou, L., Zhong, W., & Sheng, Y. (2021) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ac37d0 · Cited by 37
Wang, L., Tu, T., Gong, B., Zhou, C. J., & Guo, G. (2016) · Scientific Reports · doi:10.1038/srep19048 · Cited by 31
“We can achieve non-adiabatic gate operations that correspond to a representation of the complete SU(2) group, which is a central ingredient in geometric quantum computation.”
MethodRenormalization Group Decoder for a Four-Dimensional Toric Code
Duivenvoorden, K., Breuckmann, N. P., & Terhal, B. M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2879937 · Cited by 34
“The largest code we consider has length L = 6 and parameters [[5521,1,36]].”
BackgroundMethodQuantum universality by state distillationPreprint
Reichardt, B. W. (2009) · doi:10.5555/2012098.2012105 · Cited by 30
Tuszyński, J. A., & Woolf, N. J. (2006) · Springer eBooks · doi:10.1007/3-540-36723-3_1 · Cited by 30
Quantum Transduction with Adaptive Control
Zhang, M., Zou, C., & Jiang, L. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.020502 · Cited by 43
FTQLS: Fault-Tolerant Quantum Logic Synthesis
Lin, C.-C., Chakrabarti, A., & Jha, N. K. (2013) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2013.2269869 · Cited by 32
“Many quantum error correction (QEC) codes are proposed to facilitate FT quantum computation, such as Steane code [1], [4], Bacon–Shor code [5], Knill code [6], and surface code [7], [8].”
BackgroundCapabilities of a Perturbed Toric Code as a Quantum Memory
Kay, A. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.270502 · Cited by 29
Error-detection-based quantum fault tolerance against discrete Pauli noisePreprint
Reichardt, B. W. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0612004 · Cited by 44
“lacing the estimates on firmer footing. Knill’s postselection-based fault-tolerance scheme In the meantime, though, Knill has constructed a breakthrough scheme based on very efficient distance-two codes [Kni05a]. Being of distance two, his codes allow for error detection, not error correction, and the scheme uses extensi…”
BackgroundInfluentialLearning Correlated Noise in a 39-Qubit Quantum Processor
Harper, R., & Flammia, S. T. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040311 · Cited by 48
Phonon-mediated entanglement for trapped ion quantum computing
Soderberg, K.-A. B., & Monroe, C. R. (2010) · Reports on Progress in Physics · doi:10.1088/0034-4885/73/3/036401 · Cited by 35
“It is expected that error thresholds between 10 − 4 and 10 − 2 will be necessary for fault-tolerant computing [82–84].”
BackgroundHigh-fidelity hot gates for generic spin-resonator systems
Schuetz, M. J. A., Giedke, G., Vandersypen, L. M. K., & Cirac, J. I. (2017) · Physical Review A · doi:10.1103/physreva.95.052335 · Cited by 30
Direct measurement of Bacon-Shor code stabilizers
Li, M., Miller, D., & Brown, K. R. (2018) · Physical Review A · doi:10.1103/physreva.98.050301 · Cited by 32
Conditional teleportation of quantum-dot spin states
Qiao, H., Kandel, Y. P., Manikandan, S. K., Jordan, A. N., Fallahi, S., Gardner, G. C., Manfra, M. J., & Nichol, J. M. (2020) · Nature Communications · doi:10.1038/s41467-020-16745-0 · Cited by 43
Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 74
Fault-Tolerant Qubit from a Constant Number of Components
Wan, K., Choi, S., Kim, I. H., Shutty, N., & Hayden, P. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040345 · Cited by 34
Quantum State Discrimination Using Noisy Quantum Neural Networks
Patterson, A., Chen, H., Wossnig, L., Simone Severini, B., Browne, D. E., & Rungger, I. (2021) · UCL Discovery (University College London) · Cited by 28
Quantum computers: Definition and implementations
Pérez-Delgado, C. A., & Kok, P. (2011) · Physical Review A · doi:10.1103/physreva.83.012303 · Cited by 37
“Steane proved a threshold of 3 · 10 − 3 [98], and Knill derived a threshold of about one percent [ 57 ].”
Universal fault-tolerant quantum computing with stabilizer codes
Webster, P., Vasmer, M., Scruby, T. R., & Bartlett, S. D. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013092 · Cited by 37
“[37]) allows for simultaneous implementation of a logical operator in a way that yields the teleportation gadget of Ref.”
BackgroundJeong, H., Bae, S., & Choi, S. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1191-x · Cited by 29
“It is worth noting that when quantum teleportation is used for quantum computing, the single-qubit operations may not be necessary because they can be absorbed into the error correction process via the Pauli frame technique [38].”
MethodMøller, D., Sørensen, J. L., Thomsen, J. B., & Drewsen, M. (2007) · Physical Review A · doi:10.1103/physreva.76.062321 · Cited by 28
Universal programmable photonic architecture for quantum information processing
Bartlett, B., & Fan, S. (2020) · Physical Review A · doi:10.1103/physreva.101.042319 · Cited by 33
“[39, 40] Fault tolerance requires an EPG below a certain threshold pth, usually estimated as pth ≈ 10−4 [41, 42], but for some architectures and scenarios as high as pth ≈ 10−2 [40].”
BackgroundUniversal quantum computation in decoherence-free subspaces with hot trapped ions
Aolita, L., Davidovich, L., Kim, K., & Häffner, H. (2007) · Physical Review A · doi:10.1103/physreva.75.052337 · Cited by 29
Corrected quantum walk for optimal Hamiltonian simulation
Criger, B., & Terhal, B. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.15-16 · Cited by 28
“It is not excluded that the threshold of this kind of circuitry is higher than that of the toric code itself; after all the use of the J4, 2, 2K code in concatenated form has been shown to numerically lead to a threshold of 3% by Knill in [24].”
BackgroundMethodReducing the impact of intrinsic dissipation in a superconducting circuit by quantum error detection
Zhong, Y., Wang, Z. L., Martinis, J. M., Cleland, A. N., Korotkov, A. N., & Wang, H. (2014) · Nature Communications · doi:10.1038/ncomms4135 · Cited by 31
“Quantum error detection (QED) [17, 18] provides an alternative, albeit non-deterministic approach to handling errors, avoiding some of the complexity of full quantum error correction by simply rejecting errors when they are detected.”
BackgroundKalfus, W. D., Lee, D. F., Ribeill, G. J., Fallek, S. D., Wagner, A., Donovan, B., Ristè, D., & Ohki, T. A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3042895 · Cited by 36
“However, state-of-the-art qubits are quite “noisy” compared to the error rates required for quantum algorithms to be carried out with high fidelity [5]; this can be mitigated by combining many noisy qubits into fewer reduced-noise logical qubits through quantum error correction [6], [7].”
BackgroundDetection-Enhanced Steady State Entanglement with Ions
Bentley, C. D., Carvalho, A. R. R., Kielpinski, D., & Hope, J. J. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.040501 · Cited by 31
Real-time processing of stabilizer measurements in a bit-flip code
Ristè, D., Govia, L. C. G., Donovan, B., Fallek, S. D., Kalfus, W. D., Brink, M., Bronn, N. T., & Ohki, T. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00304-y · Cited by 47
Cell migration influences collagen gel contraction.
Andujar, M. B., Melin, M., Guérret, S., & Grimaud, J.-A. (1992) · PubMed · Cited by 28
Quantum state discrimination using noisy quantum neural networks
Patterson, A., Chen, H., Wossnig, L., Severini, S., Browne, D. E., & Rungger, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013063 · Cited by 41
“f these operators, i.e. E 0⊗E 0,...E 1⊗E 2,...E 3⊗E 3. The probability of the single qubit noise channel is p 1q = 4 5 p 2q. This is the one-qubit marginal probability of error for the twoqubit gates [31], i.e. the probability of a single qubit error without condition of an error on the other qubit. This is a commonly…”
BackgroundSingle-Shot Decoding of Good Quantum LDPC Codes
Gu, S., Tang, E., Caha, L., Choe, S. H., He, Z., & Kubica, A. (2024) · Communications in Mathematical Physics · doi:10.1007/s00220-024-04951-6 · Cited by 83
“Alternatively,syndromemeasure-mentscanbeperformedfault-tolerantlybypreparingspecialancillaqubitstatesoffline [39,40].”
Hyperfine spin qubits in irradiated malonic acid: heat-bath algorithmic cooling
Park, D. K., Feng, G., Rahimi, R., Labruyère, S., Shibata, T., Nakazawa, S., Sato, K., Takui, T., Laflamme, R., & Baugh, J. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0985-1 · Cited by 32
Quantum computing algorithm for electromagnetic field simulation
Sinha, S., & Russer, P. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0133-x · Cited by 32
“This will yield problems with decohernce [3,4,20,33].”
Magic of quantum hypergraph states
Chen, J., Yan, Y., & Zhou, Y. (2024) · Quantum · doi:10.22331/q-2024-05-21-1351 · Cited by 49
“Indeed, Clifford circuits that can create volume-law entangled states, nevertheless, can be efficiently simulated classically by stabilizer formalism via Gottesman-Knill theorem [9, 10].”
MethodQutrit and ququint magic states
Jain, A., & Prakash, S. (2020) · Physical Review A · doi:10.1103/physreva.102.042409 · Cited by 36
“Magic state distillation [1,2] is an approach to fault tolerant quantum computing that relies on ancilla qudits in non-stabilizer states to promote the Clifford group to universal quantum computation.”
MethodTowards quantum computing based community detection
Akbar, S., & Saritha, S. K. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100313 · Cited by 27
Efficient noise mitigation technique for quantum computing
Shaib, A., Naim, M. H., Fouda, M. E., Kanj, R. N., & Kurdahi, F. J. (2023) · Scientific Reports · doi:10.1038/s41598-023-30510-5 · Cited by 35
Third Law of Thermodynamics and the Scaling of Quantum Computers
Buffoni, L., Gherardini, S., Cruzeiro, E. Z., & Omar, Y. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150602 · Cited by 33
“The depolarizing channel is a model for quantum errors commonly affecting quantum systems in general and quantum gates in particular [3, 39], which makes non-unitary the applied quantum operation.”
BackgroundFrom stabilizer states to SIC-POVM fiducial states
Feng, L., & Luo, S. (2022) · Theoretical and Mathematical Physics · doi:10.1134/s004057792212008x · Cited by 29
Compressive Gate Set Tomography
Brieger, R., Roth, I., & Kliesch, M. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010325 · Cited by 51
Statistical Phase Estimation and Error Mitigation on a Superconducting Quantum Processor
Blunt, N. S., Caune, L., Izsák, R., Campbell, E. T., & Holzmann, N. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040341 · Cited by 48
“Because CZ gates are Clifford operators, it is always possible to then apply corresponding cancelling Paulis after the CZ layer [39, 40].”
Design of additive quantum codes via the code-word-stabilized framework
Kovalev, A. A., Dumer, I. I., & Pryadko, L. P. (2011) · Physical Review A · doi:10.1103/physreva.84.062319 · Cited by 29
Data-driven decoding of quantum error correcting codes using graph neural networks
Lange, M., Havström, P., Srivastava, B., Bengtsson, I., Bergentall, V., Hammar, K., Heuts, O., van Nieuwenburg, E., & Granath, M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023181 · Cited by 76
“The measured state of the ancilla qubits provide a syndrome S = { s i , i = 1 , ..., n S | ∈ 0 , 1 } , and projects the density matrix of the n qubit state into a single 2-dimensional block, a Pauli frame [33, 34].”
Composite Toffoli gate with two-round error detection
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.052334 · Cited by 32
Generating Fault-Tolerant Cluster States from Crystal Structures
Newman, M., de Castro, L. A., & Brown, K. R. (2020) · Quantum · doi:10.22331/q-2020-07-13-295 · Cited by 40
“However, quantum systems are inherently delicate, and so it is important maximize the robustness of a fault-tolerance strategy relative to the specific noise patterns a quantum processor experiences [6–16].”
BackgroundHillmann, T., Quijandría, F., Grimsmo, A. L., & Ferrini, G. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020334 · Cited by 42
“[31] S. Glancy and E. Knill, Error analysis for encoding a qubit in an oscillator, Phys.”
MethodInfluentialDemonstrating Scalable Randomized Benchmarking of Universal Gate Sets
Hines, J., Lu, M., Naik, R., Hashim, A., Ville, J.-L., Mitchell, B., Kreikebaum, J. M., Santiago, D., Seritan, S., Nielsen, E., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041030 · Cited by 38
NMR Quantum Information Processing
Lu, D., Brodutch, A., Park, J., Katiyar, H., Jochym-O’Connor, T., & Laflamme, R. (2016) · Biological magnetic resonance · doi:10.1007/978-1-4939-3658-8_7 · Cited by 34
Quantum information processing and quantum control with trapped atomic ions
Wineland, D. J. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014007 · Cited by 32
Novais, E., Mucciolo, E. R., & Baranger, H. U. (2008) · Physical Review A · doi:10.1103/physreva.78.012314 · Cited by 29
Ptok, A., Rodríguez, K., & Kapcia, K. J. (2018) · Physical Review Materials · doi:10.1103/physrevmaterials.2.024801 · Cited by 26
Efficient one- and two-qubit pulsed gates for an oscillator-stabilized Josephson qubit
Brito, F., Divincenzo, D. P., Koch, R. H., & Steffen, M. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/3/033027 · Cited by 26
“According to [30], 1% is in fact on the high end of the noise levels for which fault tolerance may be possible.”
BackgroundA SHORT SURVEY ON QUANTUM COMPUTERS
Kanamori, Y., Yoo, S.-M., Pan, W. D., & Sheldon, F. T. (2006) · International Journal of Computers and Applications · doi:10.2316/journal.202.2006.3.202-1700 · Cited by 37
“Recent research [34] indicates that the estimates of the EPGs are as high as 3% if sufficient resources are available.”
BackgroundQuantum universality by state distillation
Reichardt, B. W. (2009) · Quantum Information and Computation · doi:10.26421/qic9.11-12-7 · Cited by 94
“For example, one important class of schemes for achieving fault tolerance is based on postselection [18, 19, 20, 21].”
BackgroundMethodInfluentialA Quantum von Neumann Architecture for Large-Scale Quantum Computing
Brandl, M. F. (2017) · arXiv · doi:10.48550/arxiv.1702.02583 · Cited by 24
“This fault-tolerant error threshold is assumed to be in the range between 10−5 and 3% [21].”
BackgroundRobust quantum control in closed and open systems: Theory and practice
Weidner, C. A., Reed, E. A., Monroe, J., Sheller, B., O’Neil, S. P., Maas, E., JONCKHEERE, E. A., Langbein, F. C., & Schirmer, S. G. (2024) · Automatica · doi:10.1016/j.automatica.2024.111987 · Cited by 46
“There are other areas not discussed in depth in this survey, such as quantum error correction [11,52,53,91,158] and machine learning [112,160], which are also employed in the study of robust quantum systems.”
Topology-driven quantum architecture search framework
Su, J., Fan, J., Wu, S., Li, G., Qin, S., & Gao, F. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4486-x · Cited by 39
“These limitations impede the widespread application of quantum computing [18].”
Accuracy threshold for concatenated error detection in one dimension
Stephens, A. M., & Evans, Z. W. E. (2009) · Physical Review A · doi:10.1103/physreva.80.022313 · Cited by 30
Robust readout of bosonic qubits in the dispersive coupling regime
Hann, C. T., Elder, S. S., Wang, C. S., Chou, K., Schoelkopf, R. J., & Jiang, L. (2018) · Physical Review A · doi:10.1103/physreva.98.022305 · Cited by 28
Holonomic Quantum Computation in Surface Codes
Wu, C., Wang, Y., Feng, X., & Chen, J. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.014055 · Cited by 21
Dynamics of spatially indistinguishable particles and quantum entanglement protection
Nosrati, F., Castellini, A., Compagno, G., & Franco, R. L. (2020) · Physical Review A · doi:10.1103/physreva.102.062429 · Cited by 23
Ligand Radicals as Modular Organic Electron Spin Qubits
McGuire, J., Miras, H. N., Donahue, J. P., Richards, E., & Sproules, S. A. (2018) · Chemistry - A European Journal · doi:10.1002/chem.201804165 · Cited by 23
Quantum Computation with Topological Codes: from qubit to topological fault-tolerancePreprint
Fujii, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.01444 · Cited by 23
“mputing has been studied as one of the most important issues in quantum information science. In 2005, Knill proposed a novel scheme based on the C4/C6 errordetecting code, namely the Fibonacci scheme [Kni05], and achieved a considerably higher threshold, a few %. Recently, Fujii et al. have further improved this appro…”
MethodComparing Shor and Steane error correction using the Bacon-Shor code
Huang, S., Brown, K. R., & Cetina, M. (2024) · Science Advances · doi:10.1126/sciadv.adp2008 · Cited by 37
“Knill and Steane present alternative methods where logical qubits in the same code are used to determine the error syndrome in one or two steps 20,21 .”
Highly photon-loss-tolerant quantum computing using hybrid qubits
Omkar, S., Teo, Y. S., Lee, S.-W., & Jeong, H. (2021) · Physical Review A · doi:10.1103/physreva.103.032602 · Cited by 25
“[53], where QEC is shown to be possible by concatenating different error detecting codes.”
Method6-qubit optimal Clifford circuits
Bravyi, S. B., Latone, J. A., & Maslov, D. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00583-7 · Cited by 48
“(6) over variables η(U) ≥ 0 with U 2 Rn, subject to the normalization P U2RnηðUÞ 1⁄4 1 and the Pauli mixing constraints Eqs.”
BackgroundAchieving fault tolerance against amplitude-damping noise
Jayashankar, A., My, L. D. H., Ng, H. K., & Mandayam, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023034 · Cited by 27
Quantum control of spin qubits using nanomagnets
Niknam, M., Chowdhury, M. F. F., Rajib, M. M., Misba, W. A., Schwartz, R. N., Wang, K. L., Atulasimha, J., & Bouchard, L. (2022) · Communications Physics · doi:10.1038/s42005-022-01041-8 · Cited by 26
Fast quantum transfer mediated by topological domain walls
Zurita, J., Creffield, C. E., & Platero, G. (2023) · Quantum · doi:10.22331/q-2023-06-22-1043 · Cited by 33
Quantum simulations of localization effects with dipolar interactions
Álvarez, G. A., Kaiser, R., & Suter, D. (2013) · Annalen der Physik · doi:10.1002/andp.201300096 · Cited by 22
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.