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 701–800 of 1,003
Measuring the Capabilities of Quantum Computers
Proctor, T. J., Rudinger, K., Nielsen, E., Young, K. C., & Blume-Kohout, R. (2021) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.5281/zenodo.5197499 · Cited by 13
Low-temperature environments for quantum computation and quantum simulation*
Fu, H., Wang, P., Hu, Z., Li, Y., & Lin, X. (2020) · Chinese Physics B · doi:10.1088/1674-1056/abd762 · Cited by 11
Darmawan, A. S., Nakata, Y., Tamiya, S., & Yamasaki, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023055 · Cited by 19
Limitations of Classically Simulable Measurements for Quantum State Discrimination
Zhu, C., Liu, Z., Zhu, C., & Wang, X. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.010202 · Cited by 20
“Fault-tolerant quantum computation (FTQC) provides a scheme to overcome obstacles of physical implementation such as deco-herence and inaccuracies [6–8].”
BackgroundNo-broadcasting of magic states
Zhang, Z., Feng, L., & Luo, S. (2024) · Physical Review A · doi:10.1103/physreva.110.012462 · Cited by 11
Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
Plenio, M. B., & Virmani, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/3/033012 · Cited by 17
A Method to Reduce Resources for Quantum Error Correction
Majumdar, R., Basu, S., & Sur‐Kolay, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59936-6_12 · Cited by 11
Using three-partite GHZ states for partial quantum error detection in entanglement-based protocols
Moreno, M. G. M., Fonseca, A., & Cunha, M. M. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1960-4 · Cited by 9
“Our procedure, inspired by some results reported in [18], follows the basic ideas of reference [19], using an ancillary system which allows for detection of the noise incidence and post-selection of the desired outputs, a process that has been considered as a viable mean of computation [20].”
InfluentialSelf-correction in Wegner's three-dimensional Ising lattice gauge theory
Poulin, D., Melko, R. G., & Hastings, M. B. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.094103 · Cited by 17
“It is well established that reliable computation can be realized from unreliable components using fault-tolerant techniques both in the classical [9, 28, 32, 36] and quantum [1, 19, 21, 22, 30, 31, 33] settings.”
BackgroundExponential families for Bayesian quantum process tomography
Schultz, K. (2019) · Physical Review A · doi:10.1103/physreva.100.062316 · Cited by 9
Quasi-inversion of quantum and classical channels in finite dimensions
Shahbeigi, F., Sadri, K., Moradi, M., Życzkowski, K., & Karimipour, V. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac13db · Cited by 14
Physical requirements for scaling up network-based biocomputation
Zhu, J., Korten, T., Kugler, H., van Delft, F. C. M. J. M., Månsson, A., Reuter, D., Diez, S., & Linke, H. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac2a5d · Cited by 10
“Quantum computation [23, 24] offers unique potential for quantum simulations [25, 26], but upscaling remains highly challenging due to decoherence [27] and associated error rates [28, 29].”
BackgroundParity-encoding-based quantum computing with Bayesian error tracking
Lee, S.-H., Omkar, S., Teo, Y. S., & Jeong, H. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00705-9 · Cited by 15
“These Pauli-Z operators are compensated by updating the Pauli frame [34] classically.”
MethodRobust Engineering of Maximally Entangled States by Identical Particle Interferometry
Piccolini, M., Giovannetti, V., & Franco, R. L. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300146 · Cited by 11
Arithmetic logic unit of a computer based on spin-polarised single electrons
Basu, T., Sarkar, S. K., & Bandyopadhyay, S. (2007) · IET Circuits Devices & Systems · doi:10.1049/iet-cds:20060036 · Cited by 9
Analysis of experimental error sources in a linear-optics quantum gate
Nagata, T., Okamoto, R., Hofmann, H. F., & Takeuchi, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/4/043053 · Cited by 10
“In 2001, Knill et al discovered a way to overcome this problem by proposing a controlledZ (CZ) gate where the correct gate operation is heralded by a success signal, resulting in a possible implementation of scalable quantum computation where only the heralded operations are selected [7].”
BackgroundLópez, G. V., Gorin, T., & Lara, L. (2008) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/41/5/055504 · Cited by 10
Precision Spectroscopy and Quantum Information Processing with Trapped Calcium Ions
Benhelm, J. (2008) · Cited by 26
Multi-qubit joint measurements in circuit QED: stochastic master equation analysis
Criger, B., Ciani, A., & Divincenzo, D. (2015) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-016-0044-6 · Cited by 13
“This can be accomplished using an ancilla register which is prepared in a specific state, interacts with the encoded state, and is then measured (possibly destructively) [9–12].”
BackgroundSingle spin Toffoli–Fredkin logic gate
Trivedi, A. R., & Bandyopadhyay, S. (2008) · Journal of Applied Physics · doi:10.1063/1.2937200 · Cited by 9
Very low overhead fault-tolerant quantum error correction with the surface-GKP codePreprint
Noh, K., Chamberland, C., & Brandão, F. G. S. L. (2021) · arXiv (Cornell University) · Cited by 9
Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer
Schillo, N., & Sturm, A. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3532017 · Cited by 15
“For the second one (noise model 2), we randomly and independently insert Pauli operators after gates and before measurements with probabilities determined by the gate [20].”
Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
Zen, R. A. M., Ollé, J., Colmenárez, L., Puviani, M. B., Müller, M., & Marquardt, F. (2025) · Physical Review X · doi:10.1103/gqpr-dgz7 · Cited by 58
Fault-tolerant operation and materials science with neutral atom logical qubits
Chung, W. C., Cole, D. C., Gokhale, P., Jones, E. B., Kuper, K. W., Mason, D., Omole, V., Radnaev, A. G., Rines, R., Teo, M. H., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01095-w · Cited by 50
“Concatenation of error detecting codes can lead to error correcting codes, such as the C 4 / C 6 code 29 and many-hypercube code 30 .”
Trapped-ion entangling gates robust against qubit frequency errors
Lishman, J., & Mintert, F. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033117 · Cited by 12
“Throughout their development, quantum gate implementations have always contended with noise reduction, with varying estimates placing the maximum allowable probability of failure per gate at between 10 − 2 and 10 − 4 [11].”
BackgroundAsaoka, R., Tokunaga, Y., Kanamoto, R., Goto, H., & Aoki, T. (2021) · Physical Review A · doi:10.1103/physreva.104.043702 · Cited by 9
Quantumness and speedup limit of a qubit under transition-frequency modulation
Rajabalinia, A., Shadfar, M. K., Nosrati, F., Mortezapour, A., Morandotti, R., & Franco, R. L. (2022) · Physical Review A · doi:10.1103/physreva.106.062431 · Cited by 10
Liou, P.-H., & Lai, C. (2023) · Physical Review A · doi:10.1103/physreva.107.022614 · Cited by 16
“To perform a fault-tolerant syndrome extraction for error correction, one may use one of the Shor, Steane, and Knill syndrome extraction procedures [6, 11, 13].”
MethodDecoherence-Protected Implementation of Quantum Gates
Wu, C., Sun, C., Chen, J., & Yi, X. X. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034069 · Cited by 8
Terazawa, A., Yokotsuka, S., & Okada, H. (2024) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ad16be · Cited by 11
A quantum computing concept for 1-D elastic wave simulation with exponential speedup
Schade, M., Bösch, C., Hapla, V., & Fichtner, A. (2024) · Geophysical Journal International · doi:10.1093/gji/ggae160 · Cited by 22
“The current stage of the QC development is called Noisy Intermediate Scale Quantum (NISQ; coined by Preskill, 2018), since their efficiency is mainly hampered by elevated noise (e.g., Knill, 2005; Nielsen and Chuang, 2010; Preskill, 2018).”
MethodSyndrome decoding by quantum approximate optimization
Lai, C., Kuo, K.-Y., & Liao, B.-J. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04568-7 · Cited by 9
Lightcone bounds for quantum circuit mapping via uncomplexity
Steinberg, M., Bandić, M., Szkudlarek, S., Almudéver, C. G., Sarkar, A., & Feld, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00909-7 · Cited by 14
Quantum-error-correction benchmarks for continuous weak-parity measurements
Denhez, G., Blais, A., & Poulin, D. (2012) · Physical Review A · doi:10.1103/physreva.86.032318 · Cited by 12
Accurate Sampling with Noisy Forces from Approximate Computing
Rengaraj, V., Lass, M., Plessl, C., & Kühne, T. D. (2020) · Computation · doi:10.3390/computation8020039 · Cited by 8
“The possibility to apply similar ideas to N-body simulations [73,74] and to combine it with further algorithmic approximations [75] is to be underlined and will be presented elsewhere.”
Quantum process tomography of a Mølmer-Sørensen gate via a global beam
Tinkey, H. N., Meier, A. M., Clark, C. R., Seck, C. M., & Brown, K. R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac0543 · Cited by 15
Ultimate precision of joint parameter estimation under noisy Gaussian environment
Lahcen, B., & Daoud, M. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.127947 · Cited by 10
Message passing in fault-tolerant quantum error correction
Evans, Z. W. E., & Stephens, A. M. (2008) · Physical Review A · doi:10.1103/physreva.78.062317 · Cited by 9
De, A., & Pryadko, L. P. (2014) · Physical Review A · doi:10.1103/physreva.89.032332 · Cited by 9
An atom–molecule platform for quantum computing
Kuznetsova, E., Yelin, S. F., & Côté, R. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0308-0 · Cited by 8
Effect on ion-trap quantum computers from the quantum nature of the driving field
Yang, B., & Yang, L. (2020) · Science China Information Sciences · doi:10.1007/s11432-019-2689-4 · Cited by 10
Quantum Computing for Computer Architects, Second Edition
Metodi, T. S., Faruque, A. I., & Chong, F. T. (2011) · Synthesis lectures on computer architecture · doi:10.2200/s00331ed1v01y201101cac013 · Cited by 19
Voltage-current curves for small Josephson junction arrays: Semiclassical treatment
Douçot, B., & Ioffe, L. B. (2007) · Physical Review B · doi:10.1103/physrevb.76.214507 · Cited by 8
Intensity stabilisation of optical pulse sequences for coherent control of laser-driven qubits
Thom, J., Yuen, B., Wilpers, G., Riis, E., & Sinclair, A. G. (2018) · Applied Physics B · doi:10.1007/s00340-018-6955-4 · Cited by 9
Error-correcting one-way quantum computation with global entangling gates
Joo, J., & Feder, D. L. (2009) · Physical Review A · doi:10.1103/physreva.80.032312 · Cited by 9
How Quantum Computers Can FailPreprint
Kalai, G. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0607021 · Cited by 11
“and beautiful; see, e.g., [13, 14, 15, 16 , 17, 18, 19].”
Logical qubits with erasure conversion using metastable neutral atoms
Zhang, B., Liu, G., Bornet, G., Horvath, S. P., Peng, P., Ma, S., Huang, S., Puri, S., & Thompson, J. D. (2026) · Nature Physics · doi:10.1038/s41567-026-03309-0 · Cited by 57
“58 and in measurement-based quantum computing implementations 26,59 .”
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers
Kudrow, D., Bier, K., Deng, Z., Franklin, D. M., Tomita, Y., Brown, K. R., & Chong, F. T. (2013) · ACM SIGARCH Computer Architecture News · doi:10.1145/2508148.2485937 · Cited by 10
Multimode rotation-symmetric bosonic codes from homological rotor codes
Xu, Y., Wang, Y., & Albert, V. V. (2024) · Physical Review A · doi:10.1103/physreva.110.022402 · Cited by 18
Fidelity-dissipation relations in quantum gates
Vu, T. V., Kuwahara, T., & Saito, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033225 · Cited by 9
“However, it is important to acknowledge that quantum gates, by their nature, cannot be perfectly shielded from interactions with their dissipative environment [38].”
BackgroundStructured error recovery for code-word-stabilized quantum codes
Li, Y., Dumer, I. I., Grassl, M., & Pryadko, L. P. (2010) · Physical Review A · doi:10.1103/physreva.81.052337 · Cited by 7
Gui, X., Calder, S., Cao, H. B., Yu, T., & Xie, W. (2019) · The Journal of Physical Chemistry C · doi:10.1021/acs.jpcc.8b11371 · Cited by 7
Spatial transfer of entangled states in the correlated quantum dots system
Maslova, N. S., Mantsevich, V. N., Arseyev, P. I., & Sokolov, I. M. (2022) · Laser Physics Letters · doi:10.1088/1612-202x/ac6250 · Cited by 7
“Entanglement is an important resource in modern nanoelectronics and in quantum information technology since it allows for protocols that can not be implemented classically [3, 4].”
Holography - Recent Advances and Applications
Rosen, J. (2022) · IntechOpen eBooks · doi:10.5772/intechopen.102216 · Cited by 9
Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
Li, Z., Kim, I. H., & Hayden, P. M. (2023) · Quantum · doi:10.22331/q-2023-08-22-1089 · Cited by 14
“While our main focus lies in fault-tolerant quantum error correction, let us remark that, insofar as the state in Eq.”
BackgroundDeterministic error model for quantum computer simulation
Chi, E. C., Lyon, S. A., & Martonosi, M. (2008) · Physical Review A · doi:10.1103/physreva.77.052315 · Cited by 8
Trapped-ion quantum error-correcting protocols using only global operations
Goodwin, J. F., Brown, B. J., Stutter, G., Dale, H., Thompson, R. C., & Rudolph, T. (2015) · Physical Review A · doi:10.1103/physreva.92.032314 · Cited by 8
Geometric phase: an indicator of entanglement
Sandhya, S. N., & Banerjee, S. (2012) · The European Physical Journal D · doi:10.1140/epjd/e2012-30211-5 · Cited by 8
Small codes for magic state distillation
Howard, M., & Dawkins, H. (2016) · The European Physical Journal D · doi:10.1140/epjd/e2016-60682-y · Cited by 12
“The magic state distillation protocol, as introduced by Knill [2] and Bravyi and Kitaev [3], provides a method of producing these resource states through an iterative procedure in which less pure magic states are consumed to produce a higher purity magic state using only stabilizer operations.”
MethodHuang, S., & Brown, K. R. (2021) · Physical Review A · doi:10.1103/physreva.104.022429 · Cited by 10
Fault Models in Reversible and Quantum Circuits
Lukáč, M., Kameyama, M., Perkowski, M. A., Kerntopf, P., & Moraga, C. (2016) · Emergence, complexity and computation · doi:10.1007/978-3-319-33924-5_19 · Cited by 7
Fault-tolerant linear optics quantum computation by error-detecting quantum state transfer
Cho, J. (2007) · Physical Review A · doi:10.1103/physreva.76.042311 · Cited by 7
Decoherence effects on quantum control by reverse optimized pulse sequences
Guerra, C. A. E., Villamizar, D. V., & Rego, L. G. C. (2012) · Physical Review A · doi:10.1103/physreva.86.023411 · Cited by 8
The idiots guide to Quantum Error CorrectionPreprint
Devitt, S. J., Nemoto, K., & Munro, W. J. (2009) · arXiv (Cornell University) · Cited by 9
Quantum Error Correction with Biased Noise
Brooks, P. (2013) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/1tvt-j780 · Cited by 10
Fault-tolerant thresholds for encoded ancillae with homogeneous errors
Eastin, B. (2007) · Physical Review A · doi:10.1103/physreva.75.022301 · Cited by 7
A thesis submitted for the degree of Doctor of Philosophy
Burrell, A. H. (2010) · Cited by 7
Detrimental DecoherencePreprint
Kalai, G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.2443 · Cited by 8
Quantum Computing's Role in Advancing Sustainability
Kumar, A. (2025) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-83549-109-620251004 · Cited by 11
Berthusen, N. F., Tan, S. J. S., Huang, E., & Gottesman, D. (2025) · PRX Quantum · doi:10.1103/ps3r-wf84 · Cited by 18
“Several other codes utilize concatenation where the lowest level code consists of the [[4 , 2 , 2]] code: the C 4 /C 6 code [38], the C 4 /Steane code [39], many-hypercube code [40], and the [[4 , 2 , 2]]-Toric code [41].”
Quantum repeaters based on stationary Gottesman-Kitaev-Preskill qubits
Häußler, S., & van Loock, P. (2025) · Physical Review A · doi:10.1103/physreva.111.062611 · Cited by 11
“The second method of error correction using GKP states is based on quantum teleportation [14, 24].”
MethodATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks
Afane, M., Ebbrecht, G., Wang, Y. N., Chen, J., & Farooq, J. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.01902 · Cited by 10
“However, quantum algorithms are still constrained by the availability of qubits, noise, and decoherence in hardware [19, 29].”
Efficient Self-Consistent Learning of Gate Set Pauli Noise
Chen, S., Zhang, Z., Jiang, L., & Flammia, S. T. (2026) · PRX Quantum · doi:10.1103/1pnv-t9px · Cited by 35
Bespoke pulse design for robust rapid two-qubit gates with trapped ions
Vedaie, S. S., Paez, E. J., Nguyen, N. H., Linke, N. M., & Sanders, B. C. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023098 · Cited by 8
Clifford orbits and stabilizer states
Feng, L., & Luo, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad7710 · Cited by 8
“Gottesman suggested to regard certain quantum states in ( C 2 ) ⊗ n as stabilizer states (fixed points) of 2 n commuting discrete Heisenberg–Weyl operators [2, 3], which form an Abelian subgroup of the discrete Heisenberg–Weyl group and can be generated by n elements.”
Cheng, L., Liu, S.-C., Peng, L.-Y., & Gong, Q. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.034021 · Cited by 7
Chen, Y.-L., Li, R.-R., He, R., Chen, S.-Q., Qi, W.-H., Cui, J., Huang, Y., Li, C., & Guo, G. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.054003 · Cited by 12
Fault-tolerant quantum computing with the parity code and biased-noise qubits
Messinger, A., Torggler, V., Klaver, B., Fellner, M., & Lechner, W. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.044032 · Cited by 13
“A long standing goal in quantum computation is to develop quantum computers which are able to solve real-world problems of practical interest which are classically intractable [1–6].”
High-fidelity two-qubit gates via dynamical decoupling of local 1/f noise at the optimal point
D’Arrigo, A., Falci, G., & Paladino, E. (2016) · Physical Review A · doi:10.1103/physreva.94.022303 · Cited by 7
Control of a qubit under Markovian and non-Markovian noise
Delben, G. J., Beims, M. W., & da Luz, M. G. E. (2023) · Physical Review A · doi:10.1103/physreva.108.012620 · Cited by 9
Entropic characterization of stabilizer states and magic states
Li, H., Luo, S., & Zhang, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad28a8 · Cited by 6
Characterizing stabilizer states and H-type magic states via uncertainty relations
Li, H., Luo, S., & Zhang, Y. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05011-7 · Cited by 6
Qubit coherent control and entanglement with squeezed light fields
Shahmoon, E., Levit, S., & Ozeri, R. (2009) · Physical Review A · doi:10.1103/physreva.80.033803 · Cited by 6
Till, B. C., Longo, J., Dobell, A. R., & Driessen, P. F. (2013) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1112 · Cited by 7
Entanglement generation by communication using phase-squeezed light with photon loss
Matsuoka, F., Tomita, A., & Okamoto, A. (2016) · Physical Review A · doi:10.1103/physreva.93.032308 · Cited by 9
Hybrid magic state distillation for universal fault-tolerant quantum computation
Zheng, W., Yu, Y.-F., Pan, J., Zhang, J., Li, J., Li, Z., Suter, D., Zhou, X., Peng, X., & Du, J. (2015) · Physical Review A · doi:10.1103/physreva.91.022314 · Cited by 6
Yang, L., Yang, B., & Chen, Y. (2013) · IEEE Journal of Quantum Electronics · doi:10.1109/jqe.2013.2257690 · Cited by 7
“Knill has used numerical calculations and obtained a failure probability threshold of the order 10−2 [30] based on a faulttolerant structure suggested by himself.”
MethodGate control of the spin-splitting energy in a quantum dot: Application in single qubit rotation
Bhowmik, D., & Bandyopadhyay, S. (2008) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2008.10.008 · Cited by 6
Edge local complementation for logical cluster states
Joo, J., & Feder, D. L. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/6/063025 · Cited by 10
Generation of graph-state streams
Ballester, D., Cho, J., & Kim, M. S. (2011) · Physical Review A · doi:10.1103/physreva.83.010302 · Cited by 7
Experimental implementation of a codeword-stabilized quantum code
Zhang, J., Grassl, M., Zeng, B., & Laflamme, R. (2012) · Physical Review A · doi:10.1103/physreva.85.062312 · Cited by 7
Reliable Channel-Adapted Error Correction: Bacon-Shor Code Recovery from Amplitude Damping
Piedrafita, Á., & Renes, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.250501 · Cited by 9
“Indeed, this fact means that we can appeal to standard faulttolerant methods such as Steane or Knill error correction and passive implementation of Pauli corrections by tracking the “Pauli frame” [21, 23, 24].”
MethodTurbo‐coded secure and reliable quantum teleportation
Cane, R., Xie, W., & Ng, S. X. (2020) · IET Quantum Communication · doi:10.1049/iet-qtc.2020.0004 · Cited by 8
“The quantum depolarising channel [15] is characterised by three possible error events, namely the quantum bit-flip error, the phase flip error, and the combination of the two (the simultaneous occurrence of both bit and phase flip errors).”
BackgroundMulti-qubit joint measurements in circuit QED: stochastic master equation analysis
Criger, B., Ciani, A., & Divincenzo, D. P. (2016) · RWTH Publications (RWTH Aachen) · Cited by 6
Tracking control of two qubit entanglement using piecewise time-independent method
Delben, G. J., & Beims, M. W. (2020) · Physica Scripta · doi:10.1088/1402-4896/abd0bc · Cited by 6
Chen, S., Yu, W., Zeng, P., & Flammia, S. T. (2021) · University of Chicago · doi:10.6082/cbqhv-2k196 · Cited by 15
Asymptotically deterministic robust preparation of maximally entangled bosonic states
Piccolini, M., Giovannetti, V., & Franco, R. L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013073 · Cited by 11
Self-Evolving Network Software
Tschudin, C., & Yamamoto, L. (2005) · PIK - Praxis der Informationsverarbeitung und Kommunikation · doi:10.1515/piko.2005.206 · Cited by 6
Quantum gates robust to secular amplitude drifts
Su, Q. D., Bruinsma, R., & Campbell, W. C. (2021) · Physical Review A · doi:10.1103/physreva.104.052625 · Cited by 6
Upper bounds on the noise threshold for fault-tolerant quantum computing
Kempe, J., Regev, O., Unger, F., & de Wolf, R. (2010) · Quantum Information and Computation · doi:10.26421/qic10.5-6-1 · Cited by 20
“In particular, Knill has recently developed various schemes which, according to numerical calculations, seem to be able to tolerate more than 1% noise [13,14].”
Background
Metadata
- Authors
- Knill, E.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Knill, E.
- ORCID
- Knill, E.
- Venue
- Nature
- Published
- 2005-03
- Volume
- 434
- Issue
- 7029
- Pages
- 39-44
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2032147770
- Semantic Scholar
- 5d1ac222556297a0a79eb0cc815a05600a168446
- Cited by
- 1,184
- References
- 54
- Citations by year
- 2026: 46 · 2025: 102 · 2024: 78 · 2023: 66 · 2022: 69 · 2021: 81 · 2020: 74 · 2019: 48 · 2018: 40 · 2017: 49 · 2016: 52 · 2015: 39 · 2014: 44 · 2013: 41 · 2012: 36
- FWCI
- 54.93
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- fault-tolerant quantum computing, decoherence, quantum computing architecture, resource overhead, quantum error correction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.