CoChat

Optical generation of matter qubit graph states

Open access
Benjamin, S C, Eisert, J, Stace, T M · 2005 · New Journal of Physics

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

Abstract

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.

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.1088/1367-2630/7/1/194

Cites

42 of 42 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

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?

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

Show all 42 references

Research works printed but not linked: 8

  1. Nielsen M A and Chuang I L 2000 Quantum Computation (Cambridge: Cambridge University Press)
  2. Benjamin S C 2005 Preprint quant-ph/0504111 · arXiv
  3. van den Nest M 2005 PhD Thesis KU Leuven
  4. Schön C, Solano E, Verstraete F, Cirac J I and Wolf M M 2005 Preprint quant-ph/0501096 · arXiv
  5. Svore K M, Terhal B M and DiVincenzo D P 2004 Preprint quant-ph/0410047 · arXiv
  6. Varnava M, Browne D E and Rudolph T 2005 Preprint quant-ph/0507036 · arXiv
  7. Gross D 2005 Diploma Thesis University of Potsdam
  8. Danos V, Kashefi E and Panangaden P 2004 Preprint quant-ph/0412135 · arXiv

Cited by

See all 65

Metadata

Authors
Benjamin, S. C., Eisert, J., & Stace, T. M.
Affiliations
  • University of Oxford (GB)
  • Imperial College London (GB)
  • University of Cambridge (GB)
Venue
New Journal of Physics
Published
2005-09-16
Volume
7
Pages
194-194
ISSN
1367-2630 (ISSN-L)
OpenAlex
W2124173135
Cited by
50
References
38
Citations by year
2020: 1 · 2019: 1 · 2018: 1 · 2017: 1 · 2016: 2 · 2014: 3 · 2012: 1
FWCI
9.16
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • New Journal of Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Deutsche Forschungsgemeinschaft
  • Engineering and Physical Sciences Research Council
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
graph states, one-way quantum computation, entanglement generation, three-level system, cavity quantum electrodynamics, error analysis

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optical generation of matter qubit graph states. https://app.cochat.ai/papers/10.1088/1367-2630/7/1/194
The paper
Benjamin, S. C., Eisert, J., & Stace, T. M. (2005). Optical generation of matter qubit graph states. New Journal of Physics. https://doi.org/10.1088/1367-2630/7/1/194

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.