Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
A lattice surgery protocol is introduced to optimize quantum computing, helping to eliminate extra circuit components and gate scheduling complexities, or reduce runtimes and the total space-time costs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“These approaches all perform non-Clifford gates by teleportation [12, 13] of magic states prepared by some distillation procedure [14–20].”
MethodQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596 · cited 1×
“Notice that the rows of this matrix generate the codewords of the [3, 2, 2] classical code.”
BackgroundSelf-citationHigh-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486 · cited 1×
“[7, 45, 46] by adding virtual vertices at the boundaries of the surface code.”
BackgroundEven More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Lee, J., Berry, D. W., Gidney, C., Huggins, W. J., McClean, J. R., Wiebe, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030305 · Cited by 304
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281 · cited 5×
“This last circuit represents the standard PBC approach for computing T ⊗ 2 . often more efficient to directly prepare Toffoli magic states [29– 32].”
BackgroundMethodInfluentialSelf-citationHalving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279 · cited 1×
“For instance, such a measurement appears in Gidney’s circuits for adders [36] and more generally any uncomputation subroutine of an algorithm where the Toffoli gates are replaced with Pauli measurements and”
BackgroundBonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223 · cited 2×
“[45, 46] with the exception that two idle locations were included during measurement and re-initialization of the ancillas.”
BackgroundSelf-citationQubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Berry, D. W., Gidney, C., Motta, M., McClean, J. R., & Babbush, R. (2019) · Quantum · doi:10.22331/q-2019-12-02-208 · Cited by 222 · cited 1×
“As such, more recent and careful overhead analyses [32, 39–41] have assumed only a few factories, which is enough to achieve T magic ≈ T PBC and results in only a small percentage of device footprint (often less than 1% ) being used as a magic state factory.”
BackgroundMagic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
Bias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158
Self-citationEfficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152
Fault-tolerant quantum computation with few qubits
Chao, R., & Reichardt, B. W. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0085-z · Cited by 137
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105 · cited 2×
“[45, 46] with the exception that two idle locations were included during measurement and re-initialization of the ancillas.”
BackgroundSelf-citationBeverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Early fault-tolerant simulations of the Hubbard model
Campbell, E. T. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3110 · Cited by 81
Self-citationCodes and Protocols for Distilling T , controlled- S , and Toffoli Gates
Haah, J., & Hastings, M. B. (2018) · Quantum · doi:10.22331/q-2018-06-07-71 · Cited by 79
Low overhead quantum computation using lattice surgery
Fowler, A. G., & Gidney, C. (2018) · arXiv · doi:10.48550/arxiv.1808.06709 · Cited by 69
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Higgott, O., & Breuckmann, N. P. (2021) · Physical Review X · doi:10.1103/physrevx.11.031039 · Cited by 48
Time-optimal quantum computation
Fowler, A. G. (2012) · arXiv · doi:10.48550/arxiv.1210.4626 · Cited by 45
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2 · cited 1×
“Promising code candidates include codes tailored for biased noise such as the XZZX surface codes [63, 65–67], subsystem codes with high thresholds [68] and other codes families with high encoding rates such as hyperbolic surface codes [69, 70].”
Background
Research works printed but not linked: 41
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1088/1367-2630/9/6/199 · DOI · Paper page
- 10.1103/PhysRevX.7.021029 · DOI · Paper page
- 10.22331/q-2018-05-04-62 · DOI · Paper page
- 10.22331/q-2019-03-05-128 · DOI · Paper page
- 10.1103/PhysRevA.62.052316 · DOI · Paper page
- 10.1103/PhysRevA.86.052329 · DOI · Paper page
- 10.26421/QIC13.3-4-2 · DOI · Paper page
- 10.1103/PhysRevA.87.042305 · DOI · Paper page
- 10.22331/q-2018-03-14-56 · DOI · Paper page
- 10.22331/q-2019-05-20-143 · DOI
- 10.1038/s41534-020-00319-5 · DOI
- 10.1103/PhysRevLett.112.010505 · DOI · Paper page
- 10.1088/1367-2630/18/4/043038 · DOI · Paper page
- 10.1103/PhysRevX.6.031039 · DOI · Paper page
- 10.1103/PhysRevLett.117.010501 · DOI
- 10.1103/PhysRevA.95.022313 · DOI
- 10.1103/PhysRevX.6.021043 · DOI · Paper page
- 10.1103/PhysRevA.87.022328 · DOI · Paper page
- 10.1103/PhysRevA.87.032321 · DOI · Paper page
- 10.1103/PhysRevA.95.022316 · DOI · Paper page
- 10.1103/PhysRevLett.118.060501 · DOI · Paper page
- 10.22331/q-2019-07-18-167 · DOI · Paper page
- 10.22331/q-2020-07-16-296 · DOI · Paper page
- 10.1103/PhysRevA.90.062320 · DOI · Paper page
- 10.1088/1367-2630/ab0199 · DOI · Paper page
- 10.1103/PhysRevLett.105.030403 · DOI · Paper page
- 10.22331/q-2017-04-25-2 · DOI · Paper page
- 10.1103/PhysRevLett.121.050502 · DOI · Paper page
- 10.22331/q-2018-02-08-53 · DOI · Paper page
- 10.1088/1367-2630/ab3a62 · DOI · Paper page
- 10.1103/PhysRevA.101.012342 · DOI · Paper page
- 10.1103/PRXQuantum.1.010302 · DOI · Paper page
- 10.1088/2058-9565/abc6f4 · DOI · Paper page
- 10.1088/2058-9565/aafc8f · DOI
- 10.1103/PRXQuantum.2.020340 · DOI
- 10.1103/PhysRevLett.124.130501 · DOI
- 10.1109/JSAC.2020.2968997 · DOI
- 10.1103/PhysRevX.9.041031 · DOI
- 10.1088/2058-9565/aa7d3b · DOI · Paper page
- 10.1098/rsta.2017.0323 · DOI · Paper page
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“Each datapoint represents 10 5 repetitions decoded with the neural network and is averaged over logical basis ( X L and Z L ).”
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“By considering this space-time decoding, the performance of the code will improve when compared to single-round decoding, but the code threshold significantly decreases compared to the perfect measurement scenario (Chamberland and Campbell, 2022; Fowler et al., 2012; Higgott et al., 2023).”
BackgroundInfluentialLow-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043125 · Cited by 15
Facilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
Metadata
- Authors
- Chamberland, C., & Campbell, E. T.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2022-02-25
- Volume
- 3
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3196987254
- Cited by
- 80
- References
- 30
- FWCI
- 5.49
- Type
- journal article
- Language
- en
- Open access
- gold
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.
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.