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 901–1,000 of 1,003
Benchmarking Quantum Computational Advantages on Supercomputers
Wu, J., & Liu, Y. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400143 · Cited by 5
Deterministic geometric quantum phase gates for two atoms in decoherence-free subspace
Zheng, S. (2008) · Physics Letters A · doi:10.1016/j.physleta.2008.07.086 · Cited by 1
Low-overhead fault-tolerant error correction scheme based on quantum stabilizer codes
Chen, X., Zhao, L.-Y., Xu, G., Pan, X.-B., Chen, S., Cheng, Z., & Yang, Y. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac3817 · Cited by 4
(2018) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789813238411_0015 · Cited by 3
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_14 · Cited by 3
Trade-off between the tolerance of located and unlocated errors in nondegenrate quantum
Haselgrove, H. L., & Rohde, P. P. (2008) · Quantum Information and Computation · doi:10.26421/qic8.5-3 · Cited by 9
Quantum computation with noisy operations
Li, Y. (2015) · Physical Review A · doi:10.1103/physreva.91.052328 · Cited by 3
A distributed quantum phase gate via quantum Zeno dynamics
Shen, L.-T., Chen, R., Chen, X., & Pan, W.-Y. (2011) · Physica Scripta · doi:10.1088/0031-8949/85/01/015401 · Cited by 3
Soft-decision decoder for quantum erasure and probabilistic-gate error models
Goto, H., & Uchikawa, H. (2014) · Physical Review A · doi:10.1103/physreva.89.022322 · Cited by 5
Fast and noise-resistant ion-trap quantum computation with inherent dynamical decoupling
Zheng, S.-B. (2014) · Physical Review A · doi:10.1103/physreva.89.022314 · Cited by 3
Proposal for reversing the weak measurement with arbitrary maximum photon number
Zeng, X., Al-Amri, M., Zhu, S., & Zubairy, M. S. (2016) · Physical Review A · doi:10.1103/physreva.93.053826 · Cited by 3
Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture
Sohn, I., Bang, J., & Heo, J. (2019) · Scientific Reports · doi:10.1038/s41598-019-39439-0 · Cited by 5
Decoherence-Resilient Linear Optical Two-Qubit Quantum Gate
Mičuda, M., Stárek, R., Fiurášek, J., & Filip, R. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.054066 · Cited by 5
Spin Relaxation Mechanisms in the Organic Semiconductor Alq3
Patibandla, S., Kanchibotla, B., Pramanik, S., Bandyopadhyay, S., & Cahay, M. M. (2009) · International Journal of Nanotechnology and Molecular Computation · doi:10.4018/jnmc.2009120902 · Cited by 3
Coherence and control of a single electron spin in a quantum dot
Koppens, F. H. L. (2007) · Research Repository (Delft University of Technology) · Cited by 6
Dür, W., & Briegel, H. J. (2006) · Wiley eBooks · doi:10.1002/9783527618637.ch11 · Cited by 3
Multipartite Entanglement: Transformations, Quantum Secret Sharing, Quantum Error Correction
Helwig, W. (2014) · TSpace (University of Toronto) · Cited by 8
Characterization and Control in Large Hilbert spaces.
Ryan, C. A. (2008) · UWSpace (University of Waterloo) · Cited by 7
Puzzuoli, D. (2014) · UWSpace (University of Waterloo) · Cited by 3
Experimentally Testable Noncontextuality Inequalities Via Fourier-Motzkin Elimination
Krishna, A. (2015) · UWSpace (University of Waterloo) · Cited by 5
Computational quantum-classical boundary of complex and noisy quantum systemsPreprint
Fujii, K., & Tamate, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.6932 · Cited by 3
Normalizer Circuits and Quantum ComputationPreprint
Bermejo-Vega, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.09274 · Cited by 9
“, our generalized Gottesman-Knill theorem) in the study of fault-tolerant quantum-computing schemes that employ this form of generalized stabilizer codes: we remind the reader that the standard Gottesman-Knill theorem [1, 2] is often applied in fault-tolerant schemes for quantum computing with traditional qubits, in o…”
BackgroundOn the Structure of Protocols for Magic State DistillationPreprint
Campbell, E. T., & Browne, D. E. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0838 · Cited by 22
“Note that, Knill’s scheme for postselected quantum computing [16] contains a protocol reminiscent of magic state distillation, but which at first appears to be unrelated to any stabilizer code.”
BackgroundModelling and Simulating the Noisy Behaviour of Near-term Quantum ComputersPreprint
Γεωργόπουλος, Κ., Emary, C., & Zuliani, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.02109 · Cited by 3
“Effectively, a Pauli operator is chosen to be applied at operations that have a probability to produce an erroneous result [10, 13, 20].”
BackgroundGleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)Preprint
Tao, R., Shi, Y., Yao, J., Hui, J., Chong, F. T., & Gu, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.06349 · Cited by 3
“The theory of Quantum Error Correction (QEC) [9, 16, 34, 41, 42] enables fault tolerant computation [7, 16, 40] using redundant qubits, but full fault tolerance is still prohibitively expensive for modern noisy devices—some 103 to 104 physical qubits are required to encode a single logical qubit [13, 28].”
BackgroundTowards fault-tolerant quantum computation with higher-dimensional systems
Anwar, H. (2014) · UCL Discovery (University College London) · Cited by 8
Single-shot quantum error correction with the three-dimensional subsystem toric code
Kubica, A., & Vasmer, M. (2022) · Nature Communications · doi:10.1038/s41467-022-33923-4 · Cited by 94
Mitigating fabrication errors by recovering defective syndrome qubits in surface code
Heng, S., Kim, D., & Han, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.012420 · Cited by 3
Universal and robust quantum coherent control based on a chirped-pulse driving protocol
Yin, Y.-H., Yang, J.-X., & Cen, L.-X. (2024) · Physical Review A · doi:10.1103/physreva.109.042430 · Cited by 2
A 3D lattice defect and efficient computations in topological MBQC
Tournaire, G., Schwiering, M., Raussendorf, R., & Bachmann, S. (2026) · Quantum · doi:10.22331/q-2026-02-06-1997 · Cited by 4
“…has focused on (i) relaxing the preconditions under which the theorem can be applied [7, 8], (ii) improving the value of the error threshold [9], (iii) reducing the cost of fault-tolerance [10, 11, 12, 13, 14], and (iv) adapting fault-tolerance to specific architectures with certain…”
Physical implementability for reversible magic state manipulation
Chen, Y.-A., Gour, G., Wang, X., Zhang, L., & Zhu, C. (2025) · Communications Physics · doi:10.1038/s42005-024-01914-0 · Cited by 3
“To achieve universal quantum computation and unlock potential quantum advantage 16,17 , it is necessary to incorporate and manipulate magic states.”
Hardness of measuring magic resource
Garcia, R. J., Bhole, G., Bu, K., Chen, L., Arthanari, H., & Jaffe, A. (2025) · Physical Review Research · doi:10.1103/qcqv-3ym8 · Cited by 9
Invested and Potential Magic Resources in Measurement-Based Quantum Computation
Li, G.-C., Chen, L., Zhang, S.-Q., Hong, X.-S., Xu, H., Liu, Y., Zhou, Y., Chen, G., Li, C., Guo, G.-C., et al. (2025) · Physical Review Letters · doi:10.1103/4yyv-hggz · Cited by 14
A Cryo-BiCMOS Controller for Quantum Computers based on Trapped Beryllium Ions
Toth, P., Eugine, P. S., Kudabay, Y., Yamashita, K., Halama, S., Parvizinejad, J., Bonkowski, M., Ishikuro, H., Ospelkaus, C., & Іссаков, В. (2025) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2025.3632204 · Cited by 3
“As the systems grow more complex, the utilization of error correction methods becomes inevitable [5].”
Analog QAOA with Bayesian optimisation on a neutral atom QPU
Tibaldi, S., Leclerc, L., Vodola, D., Tignone, E., & Ercolessi, E. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00437-z · Cited by 7
“As a result, significant research efforts are focused on understanding the sources and dynamics of noise in quantum hardware [2, 3] and developing classical methods to mitigate its effects, either during execution or in post-processing stages [4–6].”
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
Kordonowy, S., & Leipold, H. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01192-4 · Cited by 15
Parallel Logical Measurements via Quantum Code Surgery
Cowtan, A., He, Z., Williamson, D. J., & Yoder, T. J. (2026) · PRX Quantum · doi:10.1103/gj8x-n5gg · Cited by 80
Pauli Propagation: A Computational Framework for Simulating Quantum Systems
Rudolph, M. S., Jones, T., Teng, Y., Angrisani, A., & Holmes, Z. (2026) · PRX Quantum · doi:10.1103/6vd7-l9bn · Cited by 156
“For example, consider a circuit containing a long sequence of only Clifford operations, as are typical in quantum error correction circuits [56].”
Experimental observation of a quadrupolar phase via quench dynamics on a spin simulator
Zhao, D., Xue, S., Ruan, D., Li, J., Lu, D., Huang, W., Xin, T., Li, H., Nie, X., & Long, G. (2021) · Physical Review A · doi:10.1103/physreva.104.062615 · Cited by 3
Numerical Simulation of the Performance of Single Qubit Gates for Trapped Ions
Akopyan, L. A., Lakhmanskaya, O., Zarutskiy, S. Y., Korolev, N. D., Guseva, O., & Lakhmanskiy, K. (2022) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/s0021364022601956 · Cited by 4
Channel polarization of two-dimensional-input quantum symmetric channels
Yi, Z., Liang, Z., & Wang, X. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03949-8 · Cited by 2
“For Surface Code[7–24] which is the most promising QECC at present, and the concatenated QECCs[25–27] which is the earliest and also a promising method to realize fault-tolerant quantum computing, their coding rate tends to 0 with the increase of its code length.”
MethodDynamics of steered quantum coherence and magic resource under sudden quench
Ansari, S., Akbari, A., & Jafari, R. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04414-w · Cited by 3
Superconducting qubits in the millions: The potential and limitations of modularity
Saadatmand, S. N., Wilson, T. L., Hodson, M. J., Field, M., Devitt, S. J., Vijayan, M. K., Robertson, A., Le, T. P., Ruh, J., Paler, A., et al. (2026) · Physical Review Applied · doi:10.1103/k3d5-v43c · Cited by 22
“Due to the probabilistic nature of quantum measurements, we must track the set of measurement results classically using a process called Pauli frame tracking [33, 41–43].”
Pratapsi, S. S., Buffoni, L., & Gherardini, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023296 · Cited by 3
“Real quantum computations, however, are limited in practice by the fidelity of quantum operations [4, 5], a problem that is transversal to several quantum platforms [6–9].”
BackgroundLow-Depth Flagged Syndrome Extraction for Calderbank-Shor-Steane Codes of Distance 3
Du, C., Ma, Z., Liu, Y., Wang, H., & Duan, Q. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3425853 · Cited by 4
“The traditional FTEC protocol includes Shor’s [2], Steane’s [3], and Knill’s methods [4], [5].”
BackgroundMethodInfluentialNieman, K., Durand, H., Patel, S., Koch, D., & Alsing, P. M. (2024) · Digital Chemical Engineering · doi:10.1016/j.dche.2024.100180 · Cited by 2
Resource estimation for entanglement routing in quantum networks
Dawar, M., Riedinger, R., Vyas, N., & Mendes, P. (2026) · Physical Review A · doi:10.1103/vf4x-rjsd · Cited by 6
Shallower CNOT Circuits on Realistic Quantum Hardware
de Brugière, T. G., & Martiel, S. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3700884 · Cited by 7
“CNOT circuits are themselves a subclass of the so-called Clifford circuits which play a major role in many different areas of quantum computation such as quantum error correction [10], randomized benchmarking protocols [16, 18], and quantum state distillation [4, 15].”
Low-density parity-check representation of fault-tolerant quantum circuits
Li, Y. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013115 · Cited by 8
“These include transversal gates, which are a standard approach in fault-tolerant quantum computing [33–36], as well as protocols like cat state, error-correcting teleportation and flagged circuit, proposed to minimise errors and control their propagation [24, 37– 39].”
Transversal cnot gate with multicycle error correction
Kim, Y., Sevior, M. E., & Usman, M. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.024074 · Cited by 7
A Fundamental Energy-Complexity Uncertainty Relation
Nye, L. (2025) · Journal of Quantum Information Science · doi:10.4236/jqis.2025.151003 · Cited by 2
Quantum trajectory sensing problem and its solution
Chin, Z. E., & Chuang, I. L. (2025) · Physical Review A · doi:10.1103/physreva.111.052447 · Cited by 3
Logical channel for heralded and pure loss with the Gottesman-Kitaev-Preskill code
Harris, T. B., Matsuura, T., Baragiola, B. Q., & Menicucci, N. C. (2025) · Physical Review A · doi:10.1103/rmlm-vbfd · Cited by 10
“(2.19) does not depend on the integer part of the syndromes, ⌊ m ⌋ , and therefore we only need to integrate over the remainders [30] An equivalent method to perform GKP error correction, known as Knill error correction [42], involves tele-portation of the noisy state through a GKP Bell pair.”
InfluentialDistributing Quantum Computations, Shot-Wise
Bisicchia, G., Clemente, G., García-Alonso, J. M., Murillo, J. M., D’Elia, M., & Brogi, A. (2025) · Future Internet · doi:10.3390/fi17110507 · Cited by 14
“John Preskill introduced the term NISQ (Noise Intermediate-scale Quantum) devices [35] to highlight their vulnerability to external noise [36] and their limited qubit count, typically ranging from a few dozen to a few hundred [24].”
Quantum Error Correction and Fault Tolerant Quantum Computing
Grassl, M., & Rötteler, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_152 · Cited by 3
Optimizing the Frequency of Quantum Error Correction
Abu-Nada, A., Fortescue, B., & Byrd, M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.190502 · Cited by 2
Active Fault-Tolerant Quantum Error Correction: The Curse of the Open System
Hagar, A. (2009) · Philosophy of Science · doi:10.1086/648600 · Cited by 5
“…theorems proven in 1996–97, started from a phenomenological point of view, assuming a very simple, “well-behaved,” error model: “We assume that a gate’s error consists of random, independent applications of products of Pauli operators with probabilities determined by the gate” (Knill 2005, 40).”
BackgroundQuantum computers: A status update [Point of View]
Gea-Banacloche, J. R. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2077210 · Cited by 3
Quantum circuit’s reliability assessment with VHDL-based simulated fault injection
Boncalo, O., Amaricăi, A., Udrescu, M., & Vlăduţiu, M. (2009) · Microelectronics Reliability · doi:10.1016/j.microrel.2009.11.008 · Cited by 3
Physical Implementation of Large-Scale Quantum Computation
Suominen, K. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_44 · Cited by 4
The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction
Hagar, A. (2010) · Synthesis lectures on quantum computing · doi:10.2200/s00290ed1v01y201007qmc004 · Cited by 4
Francis-Jones, R. J. A. (2017) · Springer theses · doi:10.1007/978-3-319-64188-1 · Cited by 2
Ultrafast Fault-Tolerant Long-Distance Quantum Communication with Static Linear Optics
Ewert, F., & van Loock, P. (2017) · Quantum Information and Measurement (QIM) · doi:10.1364/qim.2017.qf3b.2 · Cited by 4
Tiotsop, M., Fautso, G. K., Fotué, A. J., Fotsin, H. B., & Fai, L. C. (2019) · Indian Journal of Physics · doi:10.1007/s12648-019-01463-1 · Cited by 2
One-dimensional error-correcting code for Majorana qubits
Stenger, J., & Mong, R. S. K. (2020) · Physical Review A · doi:10.1103/physreva.101.042338 · Cited by 2
Resource Optimal Realization of Fault-Tolerant Quantum Circuit
Kole, A., & Sengupta, I. (2020) · IEEE International Test Conference India (ITC India) · doi:10.1109/itcindia49857.2020.9171796 · Cited by 3
“The success of a fault-tolerant encoded computation relies on the control and measurement error threshold [28], [29].”
BackgroundGate-Error-Resilient Quantum Steane Codes
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3027638 · Cited by 2
“Further investigations of Steane code state preparation were presented in [6]–[9], where the logical states such as | 0 (cid:105) and |+(cid:105) are prepared fault-tolerantly.”
BackgroundMesoscopic entanglement of noninteracting qubits using collective spontaneous emission
Kielpinski, D. (2007) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2
Impact of laser frequency noise on high-extinction optical modulation
West, G. N., Loh, W., Kharas, D., & Ram, R. J. (2020) · Optics Express · doi:10.1364/oe.413850 · Cited by 3
Implementation of Hybridly Protected Quantum Gates
Wu, C., Sun, C., Wang, G., Feng, X., & Yi, X. X. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.034003 · Cited by 2
Finding Subsampling Index Sets for Kronecker Product of Unitary Matrices for Incoherent Tight Frames
Kwon, J., & Yu, N. Y. (2022) · Applied Sciences · doi:10.3390/app122111055 · Cited by 2
Learning a Quantum Computer's Capability
Hothem, D., Young, K. C., Catanach, T., & Proctor, T. J. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3430215 · Cited by 11
“Furthermore, note that coherent errors can be converted into stochastic Pauli errors using randomized compiling [65, 66] or Pauli frame randomization [67].”
MethodImplementation of three-qubit Toffoli gates via the HeisenbergXYmodel in coupled cavities
Bian, M.-M., Chen, M., Yang, Z., & Wu, H. (2015) · Journal of Modern Optics · doi:10.1080/09500340.2015.1034432 · Cited by 2
Quantum Phase Gates for Trapped Ions via Adiabatic Passage
Shi-Biao, Z. (2007) · Communications in Theoretical Physics · doi:10.1088/0253-6102/48/4/010 · Cited by 2
Postselection threshold against biased noise
Reichardt, B. W. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.64 · Cited by 5
Entanglement Purification on Separate Atoms in an Error-Detected Pattern
Liu, A., Guo, Q., Su, S., Cheng, L., Wang, H., & Zhang, S. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04030-w · Cited by 2
Intrasystem Entanglement Generator and Unambiguos Bell States Discriminator on Chip
Bovino, F. A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683820 · Cited by 2
“We can rewrite the product CNOT · (H ⊗ I) in CNOT · SWAP · (I ⊗H) · SWAP so that we can implement the Bell Synthesizer by the physical circuit described in Fig.(2).”
MethodInfluentialSpin based neuromorphic computing
Bindal, N., Kulkarni, A. A., Singh, G. K., & Kaushik, B. K. (2019) · Spintronics · doi:10.1117/12.2528292 · Cited by 2
Realistic Fault Models and Fault Simulation for Quantum Dot Quantum Circuits
Hsieh, C.-Y., Wu, C.-H., Huang, C.-H., Goan, H.-S., & Li, J. C. M. (2020) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218573 · Cited by 2
“It has been shown that quantum gate fidelity must be greater than 99% to be practically useful [9].”
BackgroundScalable approaches to the characterization of open quantum system dynamics
López, C. C. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Integrated chips and optical cavities for trapped ion quantum information processing
Leibrandt, D. R. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 7
Spin Transport in Organic Semiconductors: A Brief Overview of the First Eight YearsPreprint
Alam, K. M., & Pramanik, S. (2011) · arXiv (Cornell University) · doi:10.1201/b11388-6 · Cited by 2
“This is still low enough to allow fault tolerant quantum computing with the aid of error correction codes [158].”
MethodResource comparison of two surface code implementations of small angle Z rotationsPreprint
Mishra, P., & Fowler, A. G. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4948 · Cited by 6
Error Channels and the Threshold for Fault-tolerant Quantum ComputationPreprint
Eastin, B. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2560 · Cited by 5
“Interested readers are referred to References [6, 29, 36, 40, 23].”
BackgroundMethodResultInfluentialSuppression and characterization of decoherence in practical quantum information processing devices
Silva, M. P. D. (2008) · UWSpace (University of Waterloo) · Cited by 3
Palomaki, T. (2008) · University Libraries (University of Maryland) · Cited by 2
An upper bound on quantum fault tolerant thresholdsPreprint
Fern, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0801.2608 · Cited by 5
“Knill noise [15, 16] refers to the case where there is probability p m = p of a measurement error, which results in m = 1 − p .”
BackgroundRobust scheme for implement ion of quantum phase gates for two atoms
Shi-Biao, Z. (2009) · Chinese Physics B · doi:10.1088/1674-1056/18/8/054 · Cited by 2
Characterizing Noise in Quantum Systems
Magesan, E. (2012) · UWSpace (University of Waterloo) · Cited by 5
Characterizing Errors in Quantum Information Processors
Sanders, Y. R. (2016) · UWSpace (University of Waterloo) · Cited by 6
Fibonacci schemes of fault-tolerant quantum computationPreprint
Aliferis, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0709.3603 · Cited by 2
“The goal of this paper was to rigorously analyze the scheme based on messagepassing decoding, and to support Knill’s numerical findings [2] that it has an accuracy threshold comparable to the postselection scheme (whose disadvantage is, of course, the extreme overhead cost incurred by the extreme use of postselection).”
BackgroundMethodInfluentialReal-time decoding of stabilizer measurements in a bit-flip codePreprint
Ristè, D., Govia, L. C. G., Donovan, B., Fallek, S. D., Kalfus, W. D., Brink, M., Bronn, N. T., & Ohki, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.12280 · Cited by 2
“This corresponds to a Pauli-frame update (PFU) [2] applied just before the measurement.”
MethodQuantum teleportation and computation with Rydberg atoms in an optical latticePreprint
Wu, H., Yang, Z., & Shen, L.-T. (2016) · Cited by 2
Quantum Computation and Communication in Bosonic SystemsPreprint
Noh, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.09445 · Cited by 8
Dür, W., & Briegel, H. J. (2016) · Wiley eBooks · doi:10.1002/9783527805785.ch12 · Cited by 3
Fault-Tolerant Quantum Computation
Reichardt, B. W. (2015) · Springer eBooks · doi:10.1007/978-3-642-27848-8_143-2 · Cited by 2
Quantum Computing: Applications and Future TrendsPreprint
Kote, S., Kshirsagar, D., Kulkarni, R. B., Lahane, V., Lambade, V., & Biradar, M. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4662230 · Cited by 2
YUCT Приложение X: Обобщение теории информации ШеннонаPreprint
yakushev, A. (2026) · doi:10.24108/preprints-3115450 · Cited by 2
YUCT Appendix X: Generalization of Shannon Information TheoryPreprint
Yakushev, A. (2026) · doi:10.24108/preprints-3115451 · Cited by 2
Optimized architectures for long distance quantum communication
Li, L., Muralidharan, S., Zou, C., Albert, V. V., Kim, J., Lütkenhaus, N., Lukin, M. D., Girvin, S. M., & Jiang, L. (2017) · IEEE/LEOS Summer Topical Meetings · doi:10.1109/phosst.2017.8012694 · Cited by 2
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.