Cited by 68Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Cluster states from Heisenberg interactions

Open access
Borhani, Massoud, Loss, Daniel·2005·Physical Review A

Abstract

We show that a special type of entangled states, cluster states, can be created with Heisenberg interactions and local rotations in $2d$ steps where $d$ is the dimension of the lattice. We find that, by tuning the coupling strengths, anisotropic exchange interactions can also be employed to create cluster states. Finally, we propose electron spins in quantum dots as a possible realization of a one-way quantum computer based on cluster states.

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.71.034308

Cites

15 of 15 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?

  • There have been proposals to implement one-way quantum computation or create cluster states in solid state systems using superconducting circuits and quantum dots.

    “In addition to these works, there have been a series of proposals how to implement one-way quantum computation (or to create cluster states) in solid state systems, using superconducting circuits 55 and quantum dots 56,57 .”

    From Measurement-based quantum computation (2009) · cites this paper as [56]

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
Borhani, M., & Loss, D.
Affiliations
University of Basel (CH)
Venue
Physical Review A
Published
2005-03-23
Volume
71
Issue
3
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2124002916
Cited by
68
References
15
Citations by year
2023: 1 · 2021: 1 · 2019: 2 · 2017: 1 · 2016: 1 · 2015: 1 · 2014: 5 · 2013: 1 · 2012: 4
FWCI
11.28
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 many-body systems
Keywords
cluster states, Heisenberg exchange interaction, entangled states, local rotation, anisotropic exchange interaction, one-way quantum computation, quantum dot spin qubits

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