CoChat

Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas

Hastings, Matthew B., Geller, A. · 2015 · Quantum Information and Computation

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

Crossref · 10.26421/qic15.11-12-6

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Cited by

See all 52

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.