Protected gates for topological quantum field theories
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
We study restrictions on locality-preserving unitary logical gates for topological quantum codes in two spatial dimensions. A locality-preserving operation is one which maps local operators to local operators — for example, a constant-depth quantum circuit of geometrically local gates, or evolution for a constant time governed by a geometrically local bounded-strength Hamiltonian. Locality-preserving logical gates of topological codes are intrinsically fault tolerant because spatially localized errors remain localized, and hence sufficiently dilute errors remain correctable. By invoking general properties of two-dimensional topological field theories, we find that the locality-preserving logical gates are severely limited for codes which admit non-abelian anyons, in particular, there are no locality-preserving logical gates on the torus or the sphere with M punctures if the braiding of anyons is computationally universal. Furthermore, for Ising anyons on the M-punctured sphere, locality-preserving gates must be elements of the logical Pauli group. We derive these results by relating logical gates of a topological code to automorphisms of the Verlinde algebra of the corresponding anyon model, and by requiring the logical gates to be compatible with basis changes in the logical Hilbert space arising from local F-moves and the mapping class group.
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
Anyons in an exactly solved model and beyond
Kitaev, A. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.10.005 · Cited by 5,245 · cited 1×
“For a thorough treatment of the category-theoretic concepts, we recommend the appendix of [24].”
BackgroundQuantum field theory and the Jones polynomial
Witten, E. (1989) · Communications in Mathematical Physics · doi:10.1007/bf01217730 · Cited by 4,758
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 · cited 1×
“In other words, braiding alone, without additional tricks such as magic state distillation [9] (which has a large overhead [14]), is not in general sufficient to provide universal fault-tolerant computation; unfortunately, the known systems with universal braiding behavior are of a rather complex nature, requiring e.”
BackgroundUniversal 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×
“In other words, braiding alone, without additional tricks such as magic state distillation [9] (which has a large overhead [14]), is not in general sufficient to provide universal fault-tolerant computation; unfortunately, the known systems with universal braiding behavior are of a rather complex nature, requiring e.”
BackgroundThe finite group velocity of quantum spin systems
Lieb, E. H., & Robinson, D. W. (1972) · Communications in Mathematical Physics · doi:10.1007/bf01645779 · Cited by 1,463
Topological quantum field theory
Atiyah, M. F. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02698547 · Cited by 976
Chen, X., Gu, Z.-C., & Wen, X.-G. (2010) · Physical Review B · doi:10.1103/physrevb.82.155138 · Cited by 891 · cited 5×
“The Hamiltonian HΣ on Hphys,Σ is local, i.e., it consists only of interactions between “neighbors” within constant-diameter regions on the lattice.”
MethodInfluentialTopological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573 · cited 2×
“cality-preserving automorphism U on the M-punctured sphere S2(τM) is trivial (i.e., proportional to the identity). This proofis a direct consequence of Corollary 4.2 and the known density of braiding [21, 19]. We additionally provide an independent proof not relying on this result. Finally, we consider systems with M…”
MethodInfluentialHigh-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×
“Examples in 2D include the toric code and quantum double models [23], the surface codes [8], the 2D color codes [4], variants of these codes [3, 15] and the Levin-Wen model [28].”
MethodRestrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Quantum 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 by
Noise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Self-citationError Mitigation for Universal Gates on Encoded Qubits
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200505 · Cited by 81
Bravyi, S., & Cross, A. (2015) · arXiv · doi:10.48550/arxiv.1509.03239 · Cited by 27
Metadata
- Authors
- Beverland, M. E., Buerschaper, O., Koenig, R., Pastawski, F., Preskill, J., & Sijher, S.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2016-01-13
- Volume
- 57
- Issue
- 2
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2168875157
- Cited by
- 53
- References
- 12
- FWCI
- 4.15
- Type
- journal article
- Language
- en
- Open access
- bronze
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.