Optical Quantum Computing
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index; 10 of the 48 sources its claims cite were checked for support.
Abstract
In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.
Overview
CoChat Summary
TL;DR
This review argues that all-optical quantum computing became feasible in 2001 with linear optics, single-photon sources, and detectors, and that later cluster-state and error-encoding schemes greatly reduced the resource overhead. It identifies high-efficiency indistinguishable single-photon sources, low-loss scalable optical circuits, high-efficiency detectors, and low-loss interfacing as key remaining challenges.
Key findings
- Linear optical quantum computing was shown in 2001 to be scalable using only single-photon sources, linear optical elements, and single-photon detectors, despite requiring a strong optical nonlinearity for a conventional CNOT.
- The original nondeterministic optical CNOT succeeded with probability \(P < 1\) (1/16 in the original scheme), failing the rest of the time (\(P = 15/16\)); teleportation-based approaches could make it deterministic on average by consuming 32 entangled states.
- Early overhead was daunting: more than 10,000 pairs of entangled photons were needed for a near-deterministic CNOT with success probability >95%; newer cluster-state and error-encoding techniques reduced resources by 3–4 orders of magnitude.
- Fault-tolerance estimates include a 1% threshold reported by Knill, an optical threshold requiring source–detector efficiency product >2/3 if all other components are perfect, and more complete treatments giving thresholds of \(10^{-3}\)–\(10^{-4}\).
Methods
- Review/synthesis of theoretical and experimental work on optical quantum computing, covering linear optical quantum computing, cluster states, teleportation, error encoding, fault tolerance, sources, detectors, circuits, and nonlinear/hybrid approaches.
- No primary data, sample, or new experiment is reported; the paper cites prior proofs-of-principle and proposals, including CNOT demonstrations and encoding against measurement error.
- Main analysis is conceptual and comparative, assessing resource overheads, thresholds, and component requirements across optical architectures.
Limitations
- The paper states that high-efficiency sources of indistinguishable single photons, low-loss scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components remain key challenges.
- It notes that most experimental demonstrations to date relied on non-scalable single-photon sources, large-scale optical elements, and modest-efficiency detectors, and that it is not yet known whether the circuit or cluster model is most promising.
- Evident from the text: this is a 2007 review, not an original research article, so its claims depend on cited prior work and may be overtaken by later developments.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
5 Valid · 0 Not valid · 27 Not checked · 14 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“Quantum teleportation has been realized with single photons [14].”
What the sources say
- Supportedcites [14] D. Bouwmeester, et al. , Nature 390 , 575 (1997). source
The opening passage (p. 1) says quantum teleportation was demonstrated experimentally by transferring the polarization of an initial photon to another photon. The Next Steps section (p. 6) likewise describes transferring the polarization state of one photon onto another. (LLM, conf=0.94)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“There have already been experimental proof-of-principle demonstrations of these new schemes ( eg. [31, 32, 33, 34]).”
What the sources say
- Partly supportedcites [31] P. Walther, et al. , Nature 434 , 169 (2005). sourceExperimental — accuracy not yet measured
The Conclusion (p. 18) reports generating a four-qubit cluster state and demonstrating quantum logic gates and Grover’s algorithm with it. The paper also calls the experiment a proof of principle (A One-Way Quantum Computer, p. 11), but the passages do not report an experimental demonstration of an error-encoding scheme; references to encoded qubits concern the cluster-state computation. (LLM, conf=0.86)
- Supportedcites [32] N. Kiesel, et al. , Phys. Rev. Lett. 95 , 210502 (2005). source
The paper reports an experimental demonstration of a four-photon cluster state (Abstract) and describes its preparation and characterization as a four-qubit entangled cluster state (Operators Expectation value). It therefore serves as an example of a proof-of-principle cluster-state demonstration among the sentence’s several citations. (LLM, conf=0.89)
- Partly supportedcites [33] R. Prevedel, et al. , Nature 445 , 65 (2007). sourceExperimental — accuracy not yet measured
On p. 2, the paper reports an experimental demonstration of feed-forward computation on a four-qubit cluster state, supporting this source as a proof-of-principle example of a cluster-state scheme. It describes correcting introduced Pauli errors, but does not report a demonstration of an error-encoding scheme. (LLM, conf=0.83)
- Partly supportedcites [34] C.-Y. Lu, et al. , Nature Physics 3 , 91 (2007). sourceExperimental — accuracy not yet measured
The paper reports experimentally creating a six-photon cluster state, supporting a proof-of-principle demonstration of a cluster-state scheme (Abstract; page unavailable). It describes quantum-error-correction experiments as a potential use of the test-bed and relates a star-ring graph state to an encoding procedure, but does not report experimentally demonstrating error encoding. (LLM, conf=0.85)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“One of the most encouraging results for all approaches to quantum computing was the high threshold of 1% recently reported by Knill [35].”
What the sources say
- Partly supportedcites [35] E. Knill, Nature 434 , 39 (2005). sourceExperimental — accuracy not yet measured
The abstract (p. 1) does prominently carry the 1% figure, but as the error probability per gate at which non-trivial quantum computations could be implemented given resources comparable to today's digital computers — not as the reported threshold. The threshold Knill reports is higher: 'thresholds of above γ = 0.03' with extrapolation to 'γ ≥ 0.06' for postselected computing (pp. 7-8, 1), and the Discussion (p. 10) puts faithful methods' limit near 0.09 versus the extrapolated 0.05 of his work. So the cited 1% number is real and from this paper, but labelling it 'the high threshold' misstates the source's own threshold value; the framing 'for all approaches to quantum computing' is the citing authors' and the paper's high thresholds are for its postselected C4/C6 architecture. (LLM, conf=0.75)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Another is to use a strong optical nonlinearity that is significantly weaker than that required in Fig. 2: single photons are made to interact with one-another via a bright laser pulse and the nonlinear medium [46].”
What the sources say
- Supportedcites [46] S. D. Barrett, et al. , Phys. Rev. A 71 , 060302 (2005). source
Barrett et al. (2005) build their analyzer on cross-Kerr nonlinearities 'small here means much less than the size of non-linearity required to perform a maximally entangling/disentangling gate directly between photons', with a bright coherent probe mediating the photon-photon interaction (Summary, p. 4; Intro, p. 1: 'small-but-not-tiny Kerr nonlinearities, and additional coherent state resources'). The p. 3 result makes the mechanism explicit: discrimination works with weak nonlinearities (theta << pi) provided the probe amplitude alpha_c is large enough that alpha_c theta^2 >~ 1.2, i.e. signal photons are coupled to one another through the intense probe mode of Eq. (1) (p. 1-2). The 'Fig. 2' comparison is the citing paper's own figure and is not part of what is attributed to this source. (LLM, conf=0.85)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Recently attention has been given to the idea of combining linear optics with optical nonlinearities that would not allow a CNOT gate to be realized in the fashion suggested in Fig. 2, but would nevertheless offer significant advantages.”
What the sources say
- Supportedcites [45] J. D. Franson, B. C. Jacobs, T. B. Pittman, Phys. Rev. A 70 , 062302 (2004). source
Section II (page unavailable) explicitly proposes combining linear optics with some nonlinearity to reduce or eliminate the need for large numbers of ancilla photons, and identifies its Zeno gates as an example. That supports the attributed idea and its advantage; the reference to Fig. 2 describes the citing paper’s particular gate design. (LLM, conf=0.88)
- Supportedcites [46] S. D. Barrett, et al. , Phys. Rev. A 71 , 060302 (2005). source
The summary (p. 4) says the proposed Bell-state analyzer uses cross-Kerr nonlinearities much smaller than those required for a direct maximally entangling gate, yet distinguishes all four Bell states near-deterministically. The introduction (p. 1) describes it as an interferometric analyzer using small nonlinearities and coherent-state resources, supporting the claimed advantage without requiring a direct nonlinear gate. (LLM, conf=0.92)
- Partly supportedcites [47] Y. L. Lim, S. D. Barrett, A. Beige, P. Kok, L. C. Kwek, Phys. Rev. A 73 , 012304 (2006). sourceExperimental — accuracy not yet measured
The passage describing the scheme (indexed as Abstract; page unavailable) combines photons mixed at a beam splitter with ion–cavity interactions, and the concluding passage reports advantages for entanglement generation under imperfect conditions. The copy does not say that these interactions could not realize a CNOT gate in the manner shown in the citing paper’s Fig. 2; it instead says the ideal scheme could be generalized to quantum gates. (LLM, conf=0.78)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
18 more claims
Create a free account to see all 46 claims and to verify the 38 references still open.
- It may state two separate claims as one. 16
- Probably not a substantial claim. 13
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 cited source doesn’t support the claim as written.
In the citing paper
“However, the fundamental building block, a coherent photonic two-level system that can be programmed and dynamically controlled, is still missing.”
From Electronically programmable photonic molecule (2019) · cites this paper as [13]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measured
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
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
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Quantum-Enhanced Measurements: Beating the Standard Quantum Limit
Giovannetti, V., Lloyd, S., & Maccone, L. (2004) · Science · doi:10.1126/science.1104149 · Cited by 3,038
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Indistinguishable photons from a single-photon device
Santori, C., Fattal, D., Vučković, J., Solomon, G. S., & Yamamoto, Y. (2002) · Nature · doi:10.1038/nature01086 · Cited by 1,559
Research works printed but not linked: 5
- T. C. Ralph, N. K. Langford, T. B. Bell, A. G. White, Phys. Rev. A65, 062324 (2001).
- H. F. Hofmann, S. Takeuchi, Phys. Rev. A66, 024308 (2001).
- M. Varnava D. Browne T. Rudolph arXiv:quant-ph/0702044 (2007). · arXiv
- J. Beugnonet al., Nature440, 779 (2007).
- K. Kieling T. Rudolph J. Eisert arXiv:quant-ph/0611140 (2006). · arXiv
Cited by
Items 1,001–1,001 of 1,001
Funneling single photons into ridge-waveguide photonic integrated circuits
Poor, S. F., Midolo, L., Li, L. H., Linfield, E. H., Schouwenberg, J. F. P., Xia, T., van Otten, F. W. M., Hoang, T. B., & Fiore, A. (2013) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2001996
Metadata
- Authors
- O'Brien, J. L.
- Affiliations
- Centre for Quantum Photonics, H. H. Wills Physics Laboratory and Department of Electrical and Electronic Engineering, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK.
- Venue
- Science
- Published
- 2007-12-07
- Volume
- 318
- Issue
- 5856
- Pages
- 1567-1570
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2047131277
- Semantic Scholar
- d067e3c0198fdfb36f01d9fde0695d1a1d6f5e9b
- Cited by
- 1,221
- References
- 52
- Citations by year
- 2026: 86 · 2025: 132 · 2024: 132 · 2023: 90 · 2022: 85 · 2021: 107 · 2020: 65 · 2019: 76 · 2018: 54 · 2017: 38 · 2016: 56 · 2015: 49 · 2014: 39 · 2013: 41 · 2012: 42
- FWCI
- 31.39
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Bristol Research (University of Bristol) (submittedVersion)
- arXiv (Cornell University)
- 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 › Semiconductor Quantum Structures and Devices
- Keywords
- optical quantum computing, single-photon sources, single-photon detectors, linear optical elements, cluster states, resource overhead, scalable quantum computing, photon indistinguishability, optical circuits
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
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
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.