Cited by 49Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum and electron transport phenomena

Simple pulses for universal quantum computation with a HeisenbergABABchain

Open access
Benjamin, Simon C.·2001·Physical Review A

Abstract

Recently, Levy has shown that quantum computation may be performed using an $\mathrm{ABAB}\dots{}$ chain of spin-1/2 systems with nearest-neighbor Heisenberg interactions. Levy notes that all necessary elementary computational ``gates'' may be achieved purely by manipulating the spin-spin interaction: he proposes using ``spin-resonance'' techniques involving modulating the interaction strength at high frequency. Here, we establish an alternative: it is possible to perform the elementary gates via simple, nonoscillatory switching of the interaction strength. This approach removes a time ``bottle neck'' in Levy's scheme, so that all elementary operations may now be performed within a time scale of order $\ensuremath{\Elzxh}{/(E}_{A}\ensuremath{-}{E}_{B}).$

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/physreva.64.054303

Cites

2 of 2 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 time evolution of the network in the S_G subspace can be expressed as a continuous-time quantum walk on G.

    “Due to this, one may express the time evolution of the network in the S G subspace as a continuous-time quantum walk on G (first considered by Farhi and Gutmann in 1998 [10]).”

    From Perfect State Transfer in Quantum Spin Networks (2004) · cites this paper as [10]

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
Benjamin, S. C.
Affiliations
University of Oxford (GB)
Corresponding author
Benjamin, Simon C.
Venue
Physical Review A
Published
2001-10-18
Volume
64
Issue
5
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1987335061
Cited by
49
References
2
Citations by year
2025: 2 · 2021: 1 · 2020: 1 · 2019: 2 · 2016: 3 · 2015: 1 · 2014: 1 · 2013: 1 · 2012: 3
FWCI
7.45
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (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 and electron transport phenomena
Keywords
universal quantum computation, spin-1/2 systems, nearest-neighbor interactions, spin resonance

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