Methods for Scalable Optical Quantum Computation
Open accessAbstract
We propose a scalable method for implementing linear optics quantum computation using the "linked-state" approach. Our method avoids the two-dimensional spread of errors occurring in the preparation of the linked state. Consequently, a proof is given for the scalability of this modified linked-state model, and an exact expression for the efficiency of the method is obtained. Moreover, a considerable improvement in the efficiency, relative to the original linked-state method, is achieved. The proposed method is applicable to Nielsen's optical "cluster-state" approach as well.
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.
Integrity signals
Registry
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.
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 one-way quantum computer may be advantageously combined with the KLM scheme of optical quantum computation, and fault-tolerant schemes using photons have been developed.
“First, after it was realized 37,42,68 that the one-way quantum computer may be advantageously combined with the KLM scheme of optical quantum computation 7 and fault-tolerant schemes using photons were developed 69-71 .”
From Measurement-based quantum computation (2009) · cites this paper as [68]
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
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 · see citing works
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477 · see citing works
Boschi, D., Branca, S., De Martini, F., Hardy, L., & Popescu, S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.1121 · Cited by 1,777 · see citing works
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · see citing works
Optical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614 · see citing works
Deterministic Linear Optics Quantum Computation with Single Photon Qubits
Yoran, N., & Reznik, B. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.037903 · Cited by 138 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · see citing works
- Authors
- Mor, T., & Yoran, N.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- ORCID
- Mor, Tal
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-08-31
- Volume
- 97
- Issue
- 9
- Pages
- 090501-090501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2087091395
- Cited by
- 2
- References
- 6
- FWCI
- 0.38
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Engineering and Physical Sciences Research Council (GR/S27405/01)
- 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 Mechanics and Applications
- Keywords
- optical quantum computation, linear optics, scalability, error propagation, cluster states, computational efficiency
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