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
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],”
BackgroundMethodInfluentialLattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
Litinski, D., & Oppen, F. V. (2018) · Quantum · doi:10.22331/q-2018-05-04-62 · Cited by 86
“It was pointed out that braiding of twists can also be implemented via a classical tracking protocol [17], in accordance with the Gottesman-Knill theorem [18].”
BackgroundMethodYoder, T. J., & Kim, I. H. (2017) · Quantum · doi:10.22331/q-2017-04-25-2 · Cited by 98
“Figure 1: Converting a dislocation code [24, 25] into an asymmetric triangle code.”
BackgroundInfluentialLogical Blocks for Fault-Tolerant Topological Quantum Computation
Bombín, H., Dawson, C., Mishmash, R. V., Nickerson, N., Pastawski, F., & Roberts, S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020303 · Cited by 59
“Examples of fault-tolerant instruments that are included within this model are transversal gates, code deformations, gauge fixing, and lattice surgeries [4, 5, 17, 18, 20, 24, 64, 65].”
BackgroundKesselring, M. S., Pastawski, F., Eisert, J., & Brown, B. J. (2018) · Quantum · doi:10.22331/q-2018-10-19-101 · Cited by 58
Quantum computing with Majorana fermion codes
Litinski, D., & von Oppen, F. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.205404 · Cited by 98
Universal fault-tolerant measurement-based quantum computation
Brown, B. J., & Roberts, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033305 · Cited by 89
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77
Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
Cao, C., & Lackey, B. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020332 · Cited by 68
Fault-Tolerant Postselection for Low-Overhead Magic State Preparation
Bombín, H., Pant, M., Roberts, S., & Seetharam, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010302 · Cited by 67
Braiding by Majorana tracking and long-range CNOT gates with color codes
Litinski, D., & von Oppen, F. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.205413 · Cited by 54
“Even though surface codes do not feature transversal single-qubit Clifford gates, they can still be used to implement single-qubit Clifford gates with zero time overhead [43,52,53] by encoding logical qubits in surface code twist defects [54].”
MethodFault-tolerant quantum gates with defects in topological stabilizer codes
Webster, P., & Bartlett, S. D. (2020) · Physical Review A · doi:10.1103/physreva.102.022403 · Cited by 46
“[21] M.”
BackgroundDemonstrating non-Abelian statistics of Majorana fermions using twist defects
Zheng, H., Dua, A., & Jiang, L. (2015) · Physical Review B · doi:10.1103/physrevb.92.245139 · Cited by 41
Floquet codes with a twistPreprint
Ellison, T. D., Sullivan, J., & Dua, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.08027 · Cited by 38
Noise 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
The role of entropy in topological quantum error correction
Beverland, M. E., Brown, B. J., Kastoryano, M. J., & Marolleau, Q. (2019) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab25de · Cited by 36
A family of stabilizer codes for anyons and Majorana modes
Wootton, J. R. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/21/215302 · Cited by 32
Error-correcting codes for fermionic quantum simulation
Chen, Y.-A., Gorshkov, A. V., & Xu, Y. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.1.033 · Cited by 31
“There are also proposals that utilize defects of surface codes for fermionic quantum simulation [31–33], and those defects are recently implemented by Google Quantum AI [34].”
Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
Lavasani, A., & Barkeshli, M. (2018) · Physical Review A · doi:10.1103/physreva.98.052319 · Cited by 22
Corrected quantum walk for optimal Hamiltonian simulation
Criger, B., & Terhal, B. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.15-16 · Cited by 28
“It may be possible to do a phase S = diag(1, i) and Hadamard gate in the J4, 2, 2K-toric code or a plain surface code if one encodes in lattice defects as in [15].”
BackgroundQuantum Weight Enumerators and Tensor Networks
Cao, C., & Lackey, B. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3340503 · Cited by 27
“In order to construct good quantum codes, many have drawn on topics from various areas of physics such as quantum many-body theory [1], [2], [3], [4], topological quantum field theory [5], [6], topological order [7], [8], and lattice with defects [9], [10], [11], [12].”
BackgroundSoft symmetries of topological orders
Kobayashi, R., & Barkeshli, M. (2026) · Physical review. B./Physical review. B · doi:10.1103/cwn4-jl57 · Cited by 25
Fault-tolerant complexesPreprint
Bombín, H., Dawson, C., Farrelly, T., Liu, Y.-H., Nickerson, N., Pant, M., Pastawski, F., & Roberts, S. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.07844 · Cited by 22
Genons, Double Covers and Fault-tolerant Clifford GatesPreprint
Burton, S., Durso-Sabina, E., & Brown, N. C. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2406.09951 · Cited by 15
“These are also called twists, dislocations or defects in the literature [5, 4, 22, 10, 37, 6].”
BackgroundComparison of 2D topological codes and their decoding performances
Kuo, K.-Y., & Lai, C. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834489 · Cited by 13
McLauchlan, C., & Béri, B. (2024) · Quantum · doi:10.22331/q-2024-07-10-1400 · Cited by 11
“These twists and holes can be braided to fault-tolerantly enact gates on encoded qubits [39, 47], and can reduce error-correction overheads [50–52].”
BackgroundDesign automation for quantum architectures
Roetteler, M., Svore, K. M., Wecker, D., & Wiebe, N. (2017) · Design, Automation, and Test in Europe · doi:10.23919/date.2017.7927196 · Cited by 10
Fujiu, K., Nagayama, S., Nishio, S., Kawaguchi, H., & Satoh, T. (2026) · Physical Review A · doi:10.1103/7lm4-3bnh · Cited by 8
“To alleviate this issue, several schemes have been investigated to reduce the physical-qubit overhead per a codeword of the surface code [2, 21–23].”
Low-density parity-check representation of fault-tolerant quantum circuits
Li, Y. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013115 · Cited by 8
Braiding defects in topological stabiliser codes of any dimension cannot be universalPreprint
Webster, P., & Bartlett, S. D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.11789 · Cited by 7
“[11] M.”
Color Code with a Logical Control- S Gate Using Transversal T Rotations
Brown, B. J. (2025) · Physical Review Letters · doi:10.1103/lwxd-fdlb · Cited by 6
The XZZX surface codePreprint
Ataides, J. P. B., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2020) · doi:10.21203/rs.3.rs-90087/v1 · Cited by 5
A 3D lattice defect and efficient computations in topological MBQC
Tournaire, G., Schwiering, M., Raussendorf, R., & Bachmann, S. (2026) · Quantum · doi:10.22331/q-2026-02-06-1997 · Cited by 4
“The computational implementation of Bombin’s lattice defects proposed in [39] is different from ours in that it ultimately uses braiding of twists around each other (see also [40] for a more complete discussion), while we braid a twist around holes.”
Hirai, Y., Ikari, S., Ueno, Y., & Suzuki, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.13632 · Cited by 4
“Thus, it might make it possible to realize logical operations that utilize twist-defect braiding in the surface code [16, 22, 31, 32].”
Clifford-hierarchy stabilizer formalism with applications to twisted quantum doublesPreprint
Fechisin, C., Cooney, K., Raja, M., Albert, V. V., Williamson, D. J., Kawagoe, K., & Musser, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.00464 · Cited by 3
“These include surface codes with boundaries [16], punctures [17, 18], and twist defects [19, 20], which utilize the physics of anyon condensation at gapped boundaries [21–23] and topological defects [24, 25] to encode logical information.”
Color codes with twists: Construction and universal-gate-set implementation
Gowda, M. G., & Sarvepalli, P. K. (2021) · Physical Review A · doi:10.1103/physreva.104.012603 · Cited by 2
Quantum computation with charge-and-color-permuting twists in qudit color codes
Gowda, M. G., & Sarvepalli, P. K. (2022) · Physical Review A · doi:10.1103/physreva.105.022621 · Cited by 2
Symmetry-Protected Topological Phases for Robust Quantum Computation
Roberts, S. (2019) · The Sydney eScholarship Repository (The University of Sydney) · Cited by 2
Magic and Majorana Fermions in Quantum Computing, Topological Matter, and Dynamics
McLauchlan, C. (2024) · Apollo (University of Cambridge) · doi:10.17863/cam.109559 · Cited by 2
Practical gates by Majorana fermion motionPreprint
Lensky, Y. D., Kobrin, B., Kechedzhi, K., & Aleǐner, I. L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.03916 · Cited by 2
Large-Scale Topological Quantum Computing with and without Majorana Fermions
Litinski, D. (2019) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-4064
Surface code dislocations have code distance L+O(1)Preprint
Gidney, C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.00363
“This short note shows that, when Y errors are allowed, the code distance reduces to L + O(1).”
BackgroundInfluentialFault-Tolerant Logical Operators in Quantum Error-Correcting Codes
Webster, P. (2021) · The Sydney eScholarship Repository (The University of Sydney)
(2023) · SciPost Physics · doi:10.21468/scipost.report.8241
Report on scipost_202308_00020v1
(2023) · SciPost Physics · doi:10.21468/scipost.report.8088
(2023) · SciPost Physics · doi:10.21468/scipost.report.8347
Color codes with domino twists: construction, logical measurements, and computation
Gowda, M. G. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04703-y
Shen, Y., & Zhang, F. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.131175
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.