Optical generation of matter qubit graph states
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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?
In the citing paper
“already spins associated with impurities in diamond have shown great promise in this direction [40, 48].”
From Optical Quantum Computing (2007) · cites this paper as [48]
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
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
The quantum-jump approach to dissipative dynamics in quantum optics
Plenio, M. B., & Knight, P. L. (1998) · Reviews of Modern Physics · doi:10.1103/revmodphys.70.101 · Cited by 1,515
Gardiner, C. W., & Zoller, P. (2000) · Springer Series in Synergetics · doi:10.1007/978-3-662-04103-1 · Cited by 1,378
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate
Leibfried, D., DeMarco, B., Meyer, V., Lucas, D., Barrett, M., Britton, J., Itano, W. M., Jelenković, B., Langer, C., Rosenband, T., et al. (2003) · Nature · doi:10.1038/nature01492 · Cited by 1,083
Observation of Coherent Oscillations in a Single Electron Spin
Jelezko, F., Gaebel, T., Popa, I., Gruber, A., & Wrachtrup, J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.076401 · Cited by 1,054
Deterministic quantum teleportation with atoms
Riebe, M., Häffner, H., Roos, C. F., Hänsel, W., Benhelm, J., Lancaster, G. P. T., Körber, T. W., Becher, C., Schmidt-Kaler, F., James, D. F. V., et al. (2004) · Nature · doi:10.1038/nature02570 · Cited by 925
Multiparty entanglement in graph states
Hein, M., Eisert, J., & Briegel, H. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062311 · Cited by 915
Self-citation
Research works printed but not linked: 8
- Nielsen M A and Chuang I L 2000 Quantum Computation (Cambridge: Cambridge University Press)
- Benjamin S C 2005 Preprint quant-ph/0504111 · arXiv
- van den Nest M 2005 PhD Thesis KU Leuven
- Schön C, Solano E, Verstraete F, Cirac J I and Wolf M M 2005 Preprint quant-ph/0501096 · arXiv
- Svore K M, Terhal B M and DiVincenzo D P 2004 Preprint quant-ph/0410047 · arXiv
- Varnava M, Browne D E and Rudolph T 2005 Preprint quant-ph/0507036 · arXiv
- Gross D 2005 Diploma Thesis University of Potsdam
- Danos V, Kashefi E and Panangaden P 2004 Preprint quant-ph/0412135 · arXiv
Cited by
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221
Entanglement in graph states and its applications
Hein, M., Dür, W., Eisert, J., Raussendorf, R., den Nest, M. V., & Briegel, H. J. (2006) · arXiv (Cornell University) · doi:10.3254/978-1-61499-018-5-115 · Cited by 284
Self-citationDanos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors
Barrett, S. D., & Stace, T. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.200502 · Cited by 164
Self-citationDeterminism in the one-way model
Danos, V., & Kashefi, E. (2006) · Physical Review A · doi:10.1103/physreva.74.052310 · Cited by 139
Metadata
- Authors
- Benjamin, S. C., Eisert, J., & Stace, T. M.
- Affiliations
- University of Oxford (GB)
- Imperial College London (GB)
- University of Cambridge (GB)
- ORCID
- Stace, T M
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- 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
- gold
- doi.org
- 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.