Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas
The DOI matches its Crossref record; 16 of the 18 references it cites were found in a registry or an index.
Abstract
We propose two distinct methods of improving quantum computing protocols based on surface codes. First, we analyze the use of dislocations instead of holes to produce logical qubits, potentially reducing spacetime volume required. Dislocations\cite{dis2,dis} induce defects which, in many respects, behave like Majorana quasi-particles. We construct circuits to implement these codes and present fault-tolerant measurement methods for these and other defects which may reduce spatial overhead. One advantage of these codes is that Hadamard gates take exactly $0$ time to implement. We numerically study the performance of these codes using a minimum weight and a greedy decoder using finite-size scaling. Second, we consider state injection of arbitrary ancillas to produce arbitrary rotations. This avoids the logarithmic (in precision) overhead in online cost required if $T$ gates are used to synthesize arbitrary rotations. While this has been considered before\cite{ancilla}, we consider also the parallel performance of this protocol. Arbitrary ancilla injection leads to a probabilistic protocol in which there is a constant chance of success on each round; we use an amortized analysis to show that even in a parallel setting this leads to only a constant factor slowdown as opposed to the logarithmic slowdown that might be expected naively.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“For example, qubits stored using dislocations [43] could be denser than qubits stored using lattice surgery. However, dislocations also create runs of stabilizers over not-quite-adjacent physical qubits. Measuring these stabilizers requires additional physical operations, creating more opportunities for errors, and so errors will propagate more quickly along these runs.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [43]
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
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
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
High-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 2×
“[12]) or a pair of dislocations, then in fact one should just measure all qubits in the Z basis inside the loop.”
BackgroundQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394 · cited 2×
“Indeed, a calculation shows that the second choice of boundary conditions will have k − 1 extra logical qubits[1], and hence in a sense each switch from electric to magnetic or magnetic to electric adds “half a qubit”.”
BackgroundEfficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214
Theory of defects in Abelian topological states
Barkeshli, M., Jian, C.-M., & Qi, X.-L. (2013) · Physical Review B · doi:10.1103/physrevb.88.235103 · Cited by 179
Projective non-Abelian statistics of dislocation defects in a ZN rotor model
You, Y., & Wen, X.-G. (2012) · Physical Review B · doi:10.1103/physrevb.86.161107 · Cited by 150
Faster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
Universality Class of the Nishimori Point in the 2D±JRandom-Bond Ising Model
Honecker, A., Picco, M., & Pujol, P. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.047201 · Cited by 107
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Paetznick, A., & Svore, K. M. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-2 · Cited by 81
A Simple Decoder for Topological Codes
Wootton, J. R. (2015) · Entropy · doi:10.3390/e17041946 · Cited by 54
Fault-tolerant renormalization group decoder for Abelian topological codes
Duclos-Cianci, G., & Poulin, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-1 · Cited by 52
Time-optimal quantum computation
Fowler, A. G. (2012) · arXiv · doi:10.48550/arxiv.1210.4626 · Cited by 45 · cited 1×
“6, it was proposed to implement a quantum computer using alternating rounds of Clifford and T gates.”
MethodCan quantum chemistry be performed on a small quantum computer
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2013) · Cited by 16
Self-citationXue, Z.-Y. (2013) · The European Physical Journal D · doi:10.1140/epjd/e2013-30582-y · Cited by 16
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
“Another way of encoding qubits in the surface code is by means of pairs of distant dislocations (Bombin, 2010a); the use of this scheme for fault-tolerant quantum computation was analyzed by Hastings and Geller (2014).”
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
“For example, qubits stored using dislocations [66] could be denser than qubits stored using lattice surgery.”
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Bonilla 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
“These approaches include braiding punctures [48–50, 53], lattice surgery [29, 30, 47, 54] and computation with twist defects [30, 55, 56].”
BackgroundPoking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code
Brown, B. J., Laubscher, K., Kesselring, M. S., & Wootton, J. R. (2017) · Physical Review X · doi:10.1103/physrevx.7.021029 · Cited by 121
“Alternatively, by the addition of lattice dislocations [24],”
BackgroundMethodInfluential
Metadata
- Authors
- Hastings, M. B., & Geller, A.
- Affiliations
- Microsoft (United States) (US)
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2015-09
- Volume
- 15
- Issue
- 11&12
- Pages
- 962-986
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W1831774655
- Cited by
- 25
- References
- 18
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 1 · 2022: 2 · 2021: 4 · 2020: 1 · 2019: 1 · 2018: 5 · 2017: 5 · 2016: 1 · 2015: 1
- FWCI
- 3.92
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Quantum Information and Computation (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- surface code, logical qubits, finite-size scaling, amortized analysis, parallel quantum computation
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.