Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 533

The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.

Theory of decoherence-free fault-tolerant universal quantum computation

Open access
Kempe, J., Bacon, D., Lidar, D. A., Whaley, K. B. · 2001 · Physical Review A

Abstract

Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.63.042307

Cites

61 of 61 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 6

  1. P.W. Shor, 1996, Proceedings of the 37th Symposium on Foundations of Computing
  2. D. Aharonov, 1997, Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC)
  3. P. Zanardi, 1998, Phys. Rev. A, 57, 3276, 10.1103/PhysRevA.57.3276 · DOI
  4. A. Beige, 2000, J. Phys., 2
  5. S. Lloyd, 1995, Phys. Rev. A, 75, 346
  6. L.-M. Duan, 1998, Phys. Rev. A, 57, 737, 10.1103/PhysRevA.57.737 · DOI · Paper page

Cited by

See all 533

Metadata

Authors
Kempe, J., Bacon, D., Lidar, D. A., & Whaley, K. B.
Venue
Physical Review A
Published
2001-03-20
Volume
63
Issue
4
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2029568264
Cited by
533
References
61
FWCI
35.30
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.