Cited by 76Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Quantum Computation with Untunable Couplings

Open access
Zhou, Xingxiang, Zhou, Zheng-Wei, Guo, Guang-Can, Feldman, Marc J.·2002·Physical Review Letters

Abstract

Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme to remove the necessity of switching the couplings between qubits for two bit gates, which are more costly in many cases. Our strategy is to compute with encoded qubits in and out of carefully designed interaction free subspaces analogous to decoherence free subspaces. We give two examples to show how universal quantum computation is realized in our scheme with local manipulations to physical qubits only, for both diagonal and off diagonal interactions.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.89.197903

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

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?

  • The spin-chain channel does not require the ability to switch interactions on and off, nor does it require modulation by external fields.

    “neither does the spin chain channel require the ability to switch interactions 'on' and 'off' (often a problem in quantum computer implementations [4, 5]), nor does it require any modulation by external fields (essential for quantum computation).”

    From Quantum Communication through an Unmodulated Spin Chain (2003) · cites this paper as [4]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhou, X., Zhou, Z.-W., Guo, G.-C., & Feldman, M. J.
Affiliations
  • University of Rochester (US)
  • University of Science and Technology of China (CN)
Venue
Physical Review Letters
Published
2002-10-21
Volume
89
Issue
19
Pages
197903-197903
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1979253254
Cited by
76
References
18
Citations by year
2026: 1 · 2025: 1 · 2022: 2 · 2020: 3 · 2018: 1 · 2016: 3 · 2015: 4 · 2014: 1 · 2013: 2 · 2012: 2
FWCI
10.39
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum computing, two-qubit gates, decoherence-free subspace, encoded qubits, universal 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