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 501–600 of 1,003
On the Structure of Protocols for Magic State Distillation
Campbell, E. T., & Browne, D. E. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10698-9_3 · Cited by 37
“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.”
BackgroundRobust tripartite-to-bipartite entanglement localization by weak measurements and reversal
Yao, C., Ma, Z., Chen, Z., & Serafini, A. (2012) · Physical Review A · doi:10.1103/physreva.86.022312 · Cited by 23
Spiking network algorithms for scientific computing
Severa, W., Parekh, O., Carlson, K. D., James, C. D., & Aimone, J. B. (2016) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738681 · Cited by 39
“I. INTRODUCTION Neural computing technologies have been one of several proposed novel architectures to either replace or complement the ubiquitous von Neumann architecture platform that has dominated conventional computing for the last 70 years [1], [2], [3], [4].”
MethodNoise thresholds for the [4,2,2]-concatenated toric code
Criger, B., & Terhal, B. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.15-16-1 · Cited by 37
Comparing the Overhead of Topological and Concatenated Quantum Error CorrectionPreprint
Suchara, M., Faruque, A. I., Lai, C., Paz-Silva, G. A., Chong, F. T., & Kubiatowicz, J. D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.2316 · Cited by 42
“The tool-box supports estimation for six physical quantum technologies, seven quantum algorithms, and with error correction using the Steane [1], [2], Bacon-Shor [3], Knill [4] or surface [5], [6] QECCs.”
Quantum secure direct communication based on quantum error correction code
Ding, C.-W., Wang, W., Zhang, W.-D., Zhou, L., & Sheng, Y. (2025) · Applied Physics Letters · doi:10.1063/5.0245163 · Cited by 25
Overcoming synthesizer phase noise in quantum sensing
Long, G., Feng, G., & Sprenger, P. (2019) · Quantum Engineering · doi:10.1002/que2.27 · Cited by 20
Entanglement Robustness via Spatial Deformation of Identical Particle Wave Functions
Piccolini, M., Nosrati, F., Compagno, G., Livreri, P., Morandotti, R., & Franco, R. L. (2021) · Entropy · doi:10.3390/e23060708 · Cited by 21
“[4] Emanuel Knill, “Quantum computing with realistically noisy devices,” Nature 434, 39 (2005).”
BackgroundFree-electron interactions with photonic GKP states: Universal control and quantum error correction
Baranes, G., Even-Haim, S., Ruimy, R., Gorlach, A. A., Dahan, R., Diringer, A. A., Hacohen-Gourgy, S., & Kaminer, I. E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043271 · Cited by 32
“Using the Pauli frame allows avoiding the application of Pauli gates in teleported gates [64].”
MethodUniversal set of gates for microwave dressed-state quantum computing
Mikelsons, G., Cohen, I., Retzker, A., & Plenio, M. B. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/5/053032 · Cited by 25
Simulating the transverse Ising model on a quantum computer: Error correction with the surface code
You, H., Geller, M. R., & Stancil, P. C. (2013) · Physical Review A · doi:10.1103/physreva.87.032341 · Cited by 21
Topological one-way quantum computation on verified logical cluster states
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.82.060301 · Cited by 23
Transverse spin relaxation time in organic molecules
Kanchibotla, B., Pramanik, S., Bandyopadhyay, S., & Cahay, M. M. (2008) · Physical Review B · doi:10.1103/physrevb.78.193306 · Cited by 22
Energy Cost of Controlling Mesoscopic Quantum Systems
Horowitz, J. M., & Jacobs, K. A. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.130501 · Cited by 25
Gleipnir: toward practical error analysis for Quantum programs
Tao, R., Shi, Y., Yao, J., Hui, J., Chong, F. T., & Gu, R. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454029 · Cited by 33
“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].”
BackgroundQuantum-information encoding in dressed qubits
Machnikowski, P., Axt, V. M., & Kühn, T. (2007) · Physical Review A · doi:10.1103/physreva.75.052330 · Cited by 22
Experimental quantum error correction with high fidelity
Zhang, J., Gangloff, D. A., Moussa, O., & Laflamme, R. (2011) · Physical Review A · doi:10.1103/physreva.84.034303 · Cited by 24
High-speed geometric quantum phase gates for trapped ions in thermal motion
Zheng, S. (2006) · Physical Review A · doi:10.1103/physreva.74.032322 · Cited by 20
Fault-Tolerant Quantum Computation
Reichardt, B. W. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_143 · Cited by 21
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitariesPreprint
Paetznick, A., & Svore, K. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.1074 · Cited by 20
A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
“The current and near-term quantum technology can be broadly classified into digital gate-model and analog annealing-model architectures [15], [16], [17], [18].”
BackgroundConcatenate codes, save qubits
Yoshida, S., Tamiya, S., & Yamasaki, H. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01035-8 · Cited by 67
“The symbol with X K ( Z K ) denotes the measurements in X ( Z ) basis for all the K logical qubits in a code block. thiswork)exceptforthesurfacecode,weimplementthelogicalCNOTgates transversallyanduseKnill ’ s error correction gadget 13 for error correction.”
InfluentialFault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons
Lee, J., Kang, N., Lee, S.-H., Jeong, H., Jiang, L., & Lee, S.-W. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030322 · Cited by 47
“For the circuit-based model, we can employ the telecorrection [128] and Steane code in simulation equivalently with the works using H-coh and CV qubits [41, 102] for the direct comparison, details of which are in Appendix D.”
Constraints on magic state protocols from the statistical mechanics of Wigner negativity
Koukoulekidis, N., & Jennings, D. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00551-1 · Cited by 27
Phase-controlled robust quantum entanglement of remote mechanical oscillators
Liu, J., Yang, J., Lu, T.-X., Jiao, Y., & Jing, H. (2024) · Physical Review A · doi:10.1103/physreva.109.023519 · Cited by 20
Quantum Computing: Exploring Superposition and Entanglement for Cutting-Edge Applications
Parmar, S. J., Parmar, V. R., Verma, J. P. V., Roy, S., & Bhattacharya, P. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10474803 · Cited by 25
“The Paper [41] suggested a method for basic fault-tolerant quantum computing architecture and offered proof of feasible accurate quantum computing at EPGs up to three percent.”
Computational quantum-classical boundary of noisy commuting quantum circuits
Fujii, K., & Tamate, S. (2016) · Scientific Reports · doi:10.1038/srep25598 · Cited by 37
“is entangled with another ancilla qubit α|0〉 + β|1〉 (|α|2 + |β|2 = 1) as α ψ β ψ + H 0 1 , (38) where β/α = 2k with k ∈ [− n, n] being an integer.”
Design automation challenges for scalable quantum architectures
Polian, I., & Fowler, A. G. (2015) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2744769.2747921 · Cited by 24
“…for construction of scalable quantum computers is the inherent fragility of quantum-mechanical systems to noise and decoherence [32]. threshold error rate to around 10 , and even as high as 3% given extremely high qubit overhead and arbitrarily long-range interactions between qubits [15, 16, 19].”
BackgroundQuantum 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) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2485922.2485937 · Cited by 27
“These timings were used to determine the time overhead for error correction using the Bacon-Shor code[2] and Knill ancilla scheme[20] shown in Table 3.”
MethodTran, A., Bocharov, A., Bauer, B., & Bonderson, P. (2020) · SciPost Physics · doi:10.21468/scipostphys.8.6.091 · Cited by 26
“[21] More generally, a similar tracking strategy can be employed when the measurement outcomes are always guaranteed to be Abelian anyons, e.”
BackgroundQuantum control with noisy fields: computational complexity versus sensitivity to noise
Kallush, S., Khasin, M., & Kosloff, R. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/015008 · Cited by 24
Tracking quantum error correction
Fukui, K., Tomita, A., & Okamoto, A. (2018) · Physical Review A · doi:10.1103/physreva.98.022326 · Cited by 26
Tunable phase gate for two atoms with an immunity to decoherence
Zheng, S., & Guo, G. (2006) · Physical Review A · doi:10.1103/physreva.73.052328 · Cited by 20
Information Complexity of Quantum Gates
Kak, S. C. (2006) · International Journal of Theoretical Physics · doi:10.1007/s10773-006-9086-3 · Cited by 20
“This perspective may be useful in evaluating proposals ( Knill, 2004b ) for quantum computing with noisy components.”
BackgroundQuantum Diffusion ModelsPreprint
Cacioppo, A., Colantonio, L., Bordoni, S., & Giagu, S. (2023) · Research Square · doi:10.21203/rs.3.rs-3688288/v1 · Cited by 56
Gustin, C., & Hughes, S. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.085305 · Cited by 20
Designing tomorrow's quantum internet
Munro, W. J., Piparo, N. L., Dias, J., Hanks, M., & Nemoto, K. (2022) · AVS Quantum Science · doi:10.1116/5.0092069 · Cited by 30
Randomized benchmarking under different gate sets
Boone, K., Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019) · Physical Review A · doi:10.1103/physreva.99.032329 · Cited by 23
Entanglement-Free Parameter Estimation of Generalized Pauli Channels
Rehman, J. U., & Shin, H. (2021) · Quantum · doi:10.22331/q-2021-07-01-490 · Cited by 23
“Furthermore, any noise model on a multiqubit system can be modeled as having the form of a Pauli channel [19, 20].”
MethodError-Detection-Based Quantum Fault-Tolerance Threshold
Reichardt, B. W. (2007) · Algorithmica · doi:10.1007/s00453-007-9069-7 · Cited by 20
“) This error model allows comparison with Knill’s threshold estimates [18].”
BackgroundMethodResultInfluentialPrecision characterization of two-qubit Hamiltonians via entanglement mapping
Cole, J. H., Devitt, S. J., & Hollenberg, L. C. L. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/47/009 · Cited by 22
Quantum circuit optimization by topological compaction in the surface codePreprint
Paetznick, A., & Fowler, A. G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.2807 · Cited by 30
Streamlined quantum computing with macronode cluster states
Walshe, B. W., Alexander, R. N., Menicucci, N. C., & Baragiola, B. Q. (2021) · Physical Review A · doi:10.1103/physreva.104.062427 · Cited by 28
“(20), in qunaught states: Teleportation through an encoded Bell pair is the foundation for Knill-style GKP error correction [40], and indeed this choice yields the quantum operation with ˆΠ GKP being the projector onto the square-lattice GKP subspace [Eq.”
BackgroundAll-photonic one-way quantum repeaters with measurement-based error correction
Niu, D., Zhang, Y., Shabani, A., & Shapourian, H. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00775-9 · Cited by 38
Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning
Park, S., & Simeone, O. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3333224 · Cited by 35
“The density matrix ρ̃(x|θDtr) accounts also for the effect of quantum channels describing gate noise [29]–[32].”
BackgroundAn architecture for two-qubit encoding in neutral ytterbium-171 atoms
Jia, Z., Huie, W., Li, L., Sun, W. K. C., Hu, X., Aakash, A., Kogan, H., Karve, A., Lee, J. Y., & Covey, J. P. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00898-7 · Cited by 32
“Consider two AKLT segments C 1 and C 2 of lengths l 1 and l 2 , respectively, prepared from initial spin-1/2 chains withedge states ( L 1 , R 1 ) and ( L 2 , R 2 ).”
Goto, H., & Uchikawa, H. (2013) · Scientific Reports · doi:10.1038/srep02044 · Cited by 25
“HerethenoisylogicalCNOTgateisimplementedbyanoisytransversalCNOTgate followedbyerrorcorrectionbyteleportationwithnoisyphysicalCNOTgates,asKnilldidinRef.16.”
BackgroundMethodInfluentialCluster-based architecture for fault-tolerant quantum computation
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.81.042324 · Cited by 20
Topçu, T., & Derevianko, A. (2013) · Physical Review A · doi:10.1103/physreva.88.043407 · Cited by 19
Twins Percolation for Qubit Losses in Topological Color Codes
Vodola, D., Amaro, D., Martin-Delgado, M. A., & Müller, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.060501 · Cited by 17
“2(f), or by a corresponding Pauli frame update on a software level [47, 48].”
BackgroundA control microarchitecture for fault-tolerant quantum computing
Fu, X., Lao, L., Bertels, K., & Almudéver, C. G. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.06.011 · Cited by 23
Guo, R., He, X., Sheng, C., Yang, J., Xu, P., Wang, K., Zhong, J., Liu, M., Wang, J., & Zhan, M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.153201 · Cited by 21
“The low-crosstalk state readout and logic operation are crucially required for implementing quantum error correction [14, 15], which is essential for implementing the fault-tolerant quantum computation and allows us to realize the full potential of largescale quantum information processing devices [16, 17].”
BackgroundMagic state distillation with the ternary Golay code
Prakash, S. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2020.0187 · Cited by 31
“Here, we observe that the 11-qutrit Golay code is remarkably well suited for a promising approach to fault-tolerant quantum computing known as magic state distillation [6,7].”
MethodScheme for fault-tolerant holonomic computation on stabilizer codes
Oreshkov, O., Brun, T. A., & Lidar, D. A. (2009) · Physical Review A · doi:10.1103/physreva.80.022325 · Cited by 17
Between Shor and Steane: A Unifying Construction for Measuring Error Syndromes
Huang, S., & Brown, K. R. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.090505 · Cited by 35
High-performance fault-tolerant quantum computing with many-hypercube codes
Goto, H. (2024) · Science Advances · doi:10.1126/sciadv.adp6388 · Cited by 72
“In the following, we assume that error correction is done by error-correcting teleportation (ECT) [45, 65, 66].”
InfluentialUltrafast High-Fidelity State Readout of Single Neutral Atom
Wang, J., Huang, D.-Y., Zhou, X.-L., Shen, Z.-M., He, S.-J., Huang, Q.-Y., Liu, Y.-J., Li, C., & Guo, G.-C. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.240802 · Cited by 36
“However, practical quantum network applications still demand further advancements in nondestructive state readout meth-ods with higher speed to enhance the communication rate [18, 20, 35] and higher fidelity to minimize the consumption of physical qubits [36–38].”
Blueprint for fault-tolerant quantum computation with topological qubit arrays
Aasen, D., Aghaee, M., Alam, Z., Andrzejczuk, M., Antipov, A., Astafev, M., Avilovas, L., Barzegar, A., Bauer, B., Becker, J., et al. (2025) · Physical Review Research · doi:10.1103/qx36-4rv1 · Cited by 110
Condition for fault-tolerant quantum computation with a cavity-QED scheme
Goto, H., & Ichimura, K. (2010) · Physical Review A · doi:10.1103/physreva.82.032311 · Cited by 21
Parallel Simulation of Quantum Networks with Distributed Quantum State Management
Wu, X., Kolar, A., Chung, J., Jin, D., Suchara, M., & Kettimuthu, R. (2024) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3634701 · Cited by 24
Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
Steinberg, M., Feld, S., Almudéver, C. G., Marthaler, M., & Reiner, J.-M. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3160015 · Cited by 24
“Thirdly, noise considerations have severely hampered developments in quantum devices [40].”
BackgroundShor’s algorithm does not factor large integers in the presence of noise
Cai, J. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3961-3 · Cited by 32
“But fundamentally they assume that the group U(2) (or SU(2) if we factor out an irrelevant phase factor) exactly corresponds to operations on a qubit in reality, especially in its composition—that group composition, in its infinite precision defined over C , exactly corresponds to sequential…”
BackgroundMilburn, G. J. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014003 · Cited by 29
Alsina, D., & Razavi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.022402 · Cited by 31
Trapped Rydberg ions: A new platform for quantum information processing
Mokhberi, A., Hennrich, M., & Schmidt‐Kaler, F. (2020) · Advances in atomic, molecular, and optical physics · doi:10.1016/bs.aamop.2020.04.004 · Cited by 31
“er than few parts in thousand (Ballance et al., 2016; Gaebler et al., 2016), which meets one of the requirements for a future quantum computer, according to the DiVincenzo criteria (DiVincenzo, 2000; Knill, 2005). Multi-ion entanglement (Friis et al., 2018; Kaufmann et al., 2017a; Monz et al., 2011), the Deutsch Josza…”
MethodUniversally Optimal Verification of Entangled States with Nondemolition Measurements
Liu, Y., Shang, J., Han, R., & Zhang, X. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.090504 · Cited by 18
A comparative study of universal quantum computing models: Toward a physical unification
Wang, D. (2021) · Quantum Engineering · doi:10.1002/que2.85 · Cited by 23
“In this regard, the magic-state injection model [75, 76] and synthillation [142] can be seen as examples.”
BackgroundFault-tolerant holonomic quantum computation in surface codes
Zheng, Y.-C., & Brun, T. A. (2015) · Physical Review A · doi:10.1103/physreva.91.022302 · Cited by 19
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
Kempe, J., Regev, O., Unger, F., & de Wolf, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70575-8_69 · Cited by 22
Threshold error rates for the toric and surface codesPreprint
Wang, D. S., Fowler, A. G., Stephens, A. M., & Hollenberg, L. C. L. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0905.0531 · Cited by 83
“For example, given long-range interactions and a very large number of qubits, one finds the threshold for fault-tolerant computation to be over 3% [9].”
BackgroundAveraged Circuit Eigenvalue Sampling
Flammia, S. T. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2022.4 · Cited by 61
Error-Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis
Jose, S. T., & Simeone, O. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3229747 · Cited by 26
“Examples of quantum error mitigation techniques include quasi-probabilistic QEM [2], zero noise extrapolation [2], [13], randomized compiling [14], and Pauli-frame randomization [15].”
MethodConcatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code
Zhang, J., Wu, Y.-C., & Guo, G. (2023) · Physical Review A · doi:10.1103/physreva.107.062408 · Cited by 22
“It is unnecessary to perform real-time error correction, but one can keep track of the errors in the Pauli frame [57, 58] until a non-Clifford gate is applied.”
MethodVallabhapurapu, H. H., Hansen, I., Adambukulam, C., Stöhr, R., Denisenko, A., Yang, C. H., & Laucht, A. (2023) · Physical Review A · doi:10.1103/physreva.108.022606 · Cited by 16
Experimental Simulation of Topological Quantum Computing with Classical Circuits
Zou, D., Pan, N., Chen, T., Sun, H., & Zhang, X. (2023) · Advanced Intelligent Systems · doi:10.1002/aisy.202300354 · Cited by 18
Fault-tolerant computing with single-qudit encoding in a molecular spin
Mezzadri, M., Chiesa, A., Lepori, L., & Carretta, S. (2024) · Materials Horizons · doi:10.1039/d4mh00454j · Cited by 29
Engineering Topological States and Quantum‐Inspired Information Processing Using Classical Circuits
Chen, T., Zhang, W., Zou, D., Sun, Y., & Zhang, X. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400448 · Cited by 21
Lai, C., Zheng, Y.-C., & Brun, T. A. (2017) · Physical Review A · doi:10.1103/physreva.95.032339 · Cited by 21
Knots, links, and long-range magic
Fliss, J. R. (2021) · Journal of High Energy Physics · doi:10.1007/jhep04(2021)090 · Cited by 27
Universal set of gates for microwave dressed-state quantum computing
Mikelsons, G., Cohen, I., Retzker, A., & Plenio, M. B. (2015) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-46259 · Cited by 16
Howard, M., & Vala, J. (2012) · Physical Review A · doi:10.1103/physreva.85.022304 · Cited by 19
Order 3 symmetry in the Clifford hierarchy
Bengtsson, I., Blanchfield, K., Campbell, E. T., & Howard, M. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/45/455302 · Cited by 23
“This was first studied for qubits [6, 7] and then extended to higherdimensional qudit systems [9, 10].”
BackgroundMethodDissipative long-range entanglement generation between electronic spins
Benito, M., Schuetz, M. J. A., Cirac, J. I., Platero, G., & Giedke, G. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.94.115404 · Cited by 16
Error rates and resource overheads of encoded three-qubit gates
Takagi, R., Yoder, T. J., & Chuang, I. L. (2017) · Physical Review A · doi:10.1103/physreva.96.042302 · Cited by 19
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
Bermejo-Vega, J., Lin, C. Y.-Y., & den Nest, M. V. (2016) · Quantum Information and Computation · doi:10.26421/qic16.5-6-1 · Cited by 23
“Roughly speaking, the QFT over a group G is a transformation which relates two bases of the Hilbert space: namely, the standard basis {|g〉} and the Fourier basis.”
Decoherence in quantum walks and quantum computers
Hines, A. P., & Stamp, P. C. E. (2008) · Canadian Journal of Physics · doi:10.1139/p08-016 · Cited by 20
“Such noise models were used to derive fault-tolerant thresholds bounding the probability of an error occurring at each location in the circuit [7, 8].”
MethodScalability of quantum computation with addressable optical lattices
Beals, T. R., Vala, J., & Whaley, K. B. (2008) · Physical Review A · doi:10.1103/physreva.77.052309 · Cited by 18
Fault-Tolerance Threshold for a Distance-Three Quantum Code
Reichardt, B. W. (2006) · Lecture notes in computer science · doi:10.1007/11786986_6 · Cited by 22
“To apply the technique of magic states distillation to achieve uni-versality, following Knill [16, 22], we create an encoded Bell pair.”
BackgroundMethodInfluentialFault-Tolerant Quantum Computation: 1996; Shor, Aharonov, Ben-Or, Kitaev
Reichardt, B. W. (2008) · Springer eBooks · doi:10.1007/978-0-387-30162-4_143 · Cited by 18
Raman Scattering Errors in Stimulated-Raman-Induced Logic Gates in Ba+133
Boguslawski, M. J., Wall, Z. J., Vizvary, S. R., Moore, I. D., Bareian, M., Allcock, D. T. C., Wineland, D. J., Hudson, E. R., & Campbell, W. C. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.063001 · Cited by 15
Piparo, N. L., Hanks, M., Nemoto, K., & Munro, W. J. (2020) · Physical Review A · doi:10.1103/physreva.102.052613 · Cited by 20
Quantum image compression with autoencoders based on parameterized quantum circuits
Wang, H., Tan, J., Huang, Y., & Zheng, W. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04243-3 · Cited by 25
Practical fault tolerance for quantum circuits
Kubiatowicz, J. D., & Whitney, M. (2009) · Cited by 16
Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
Plenio, M. B., & Virmani, S. (2010) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-46600 · Cited by 15
A tunable rf SQUID manipulated as flux and phase qubits
Poletto, S., Chiarello, F., Castellano, M. G., Lisenfeld, J., Lukashenko, A., Carelli, P., & Ustinov, A. V. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014011 · Cited by 15
“One of the major challenges that superconducting qubits are now facing is to increase their coherence time in order to reach a useful number of quantum operations [5].”
BackgroundHigh Fidelity Quantum Gates with Vibrational Qubits
Berríos, E., Gruebele, M., Shyshlov, D., Wang, L., & Babikov, D. (2012) · The Journal of Physical Chemistry A · doi:10.1021/jp3055729 · Cited by 18
Randomized benchmarking of quantum gates implemented by electron spin resonance
Park, D. K., Feng, G., Rahimi, R., Baugh, J., & Laflamme, R. (2016) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2016.04.010 · Cited by 15
“work can be achieved, then such hybrid electron-nuclear spin systems could be ideal for testing quantum algorithms such as heat bath algorithmic cooling [20, 21, 22, 23] and quantum error correction [8, 9, 10, 11, 12, 13], in particular, multiple-round quantum error correction. Acknowledgements This research was suppo…”
MethodTowards Large-Scale Quantum ComputationPreprint
Fowler, A. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506126 · Cited by 21
Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture
Larsen, M. V., Chamberland, C., Noh, K., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · Cited by 13
Numerical optimization of amplitude-modulated pulses in microwave-driven entanglement generation
Duwe, M., Zarantonello, G., Pulido-Mateo, N., Mendpara, H., Krinner, L., Bautista-Salvador, A., Vitanov, N. V., Hammerer, K., Werner, R. F., & Ospelkaus, C. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac7b41 · Cited by 17
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.