Cited by 59Quantum Computing Algorithms and ArchitectureQuantum and electron transport phenomenaQuantum Information and Cryptography

Quantum-dot cluster-state computing with encoded qubits

Open access
Weinstein, Yaakov S., Hellberg, C. Stephen, Levy, Jeremy·2005·Physical Review A

Abstract

A class of architectures is advanced for cluster-state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to supercoherent qubits introduced by Bacon et al. [Phys. Rev. Lett. 87, 247902 (2001)] for which we discuss the effects of various errors and present a means of error protection.

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

Cites

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 [57]

Self-check

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

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

The citation lists haven’t been fetched yet

References 27 · Cited by 59

Authors
Weinstein, Y. S., Hellberg, C. S., & Levy, J.
Affiliations
  • United States Naval Research Laboratory (US)
  • University of Pittsburgh (US)
Venue
Physical Review A
Published
2005-08-30
Volume
72
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1966826407
Cited by
59
References
27
Citations by year
2025: 1 · 2024: 1 · 2023: 2 · 2021: 2 · 2019: 2 · 2017: 2 · 2016: 2 · 2015: 4 · 2014: 1 · 2013: 2 · 2012: 2
FWCI
8.77
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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum and electron transport phenomena
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum dots, encoded qubits, logical qubits, error protection, quantum error correction

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