Error Suppression for Hamiltonian-Based Quantum Computation Using Subsystem Codes
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We present general conditions for quantum error suppression for Hamiltonian-based quantum computation using subsystem codes. This involves encoding the Hamiltonian performing the computation using an error detecting subsystem code and the addition of a penalty term that commutes with the encoded Hamiltonian. The scheme is general and includes the stabilizer formalism of both subspace and subsystem codes as special cases. We derive performance bounds and show that complete error suppression results in the large penalty limit. To illustrate the power of subsystem-based error suppression, we introduce fully two-local constructions for protection against local errors of the swap gate of adiabatic gate teleportation and the Ising chain in a transverse field.
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
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457
Universal Computation by Multiparticle Quantum Walk
Childs, A. M., Gosset, D., & Webb, Z. (2013) · Science · doi:10.1126/science.1229957 · Cited by 456
The quantum adiabatic optimization algorithm and local minima
Reichardt, B. W. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007428 · Cited by 110
Cited by
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
“Progress on NISQ processors has been steady, with improved hardware, new experimental and theoretical advances, and error-mitigation strategies [120].”
BackgroundDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
Self-citationAchieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
“The idea of encoding a Hamiltonian in this way with a classical or quantum code has previously been used to protect adiabatic quantum algorithms against noise (see [29] and references therein).”
Method
Metadata
- Authors
- Marvian, M., & Lidar, D. A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2017-01-20
- Volume
- 118
- Issue
- 3
- Pages
- 030504-030504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2424766119
- Cited by
- 35
- References
- 6
- FWCI
- 3.12
- Type
- journal article
- Language
- en
- Open access
- green
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.