The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Deterministic Linear Optics Quantum Computation with Single Photon Qubits
Overview
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
Verification
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 Yoran-Reznik protocol uses entanglement chains of photons to pass quantum information through the circuit via teleportation, and for it to work the nondeterministic nature of optical teleportation must be circumvented.
“The first proposal for linear optical quantum computing along these lines by Yoran and Reznik (2003) is not strictly based on the cluster-state model, but it has many attributes in common.Most notably, it uses”
From Linear optical quantum computing with photonic qubits (2007) · cites this paper as Yoran and Reznik (2003)
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
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
The p66shc adaptor protein controls oxidative stress response and life span in mammals
Migliaccio, E., Giorgio, M., Mele, S., Pelicci, G., Reboldi, P., Pandolfi, P. P., Lanfrancone, L., & Pelicci, P. G. (1999) · Nature · doi:10.1038/46311 · Cited by 1,712
An optical method for teleportation
Popescu, S. (1995) · arXiv · doi:10.48550/arxiv.quant-ph/9501020 · Cited by 14
Flagged first, then by citations
Research works printed but not linked: 5
- D. Bouwmeester, 2000, The Physics of Quantum Information, 10.1007/978-3-662-04209-0 · DOI · Paper page
- 10.1103/PhysRevA.65.012314 · DOI · Paper page
- 10.1103/PhysRevA.66.052306 · DOI · Paper page
- 10.1103/PhysRevLett.89.137901 · DOI · Paper page
- 10.1103/PhysRevLett.73.58 · DOI · Paper page
Cited by
Sorted by citations
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
Optical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Efficient Quantum Computation with Probabilistic Quantum Gates
Duan, L.-M., & Raussendorf, R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.080503 · Cited by 185
Ralph, T. C., Hayes, A. J. F., & Gilchrist, A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.100501 · Cited by 172
Fault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161
Repeat-until-success quantum computing using stationary and flying qubits
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006) · Physical Review A · doi:10.1103/physreva.73.012304 · Cited by 138
Noise Thresholds for Optical Quantum Computers
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.020501 · Cited by 127
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97
Noise thresholds for optical cluster-state quantum computation
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review A · doi:10.1103/physreva.73.052306 · Cited by 79
Photonic module: An on-demand resource for photonic entanglement
Devitt, S. J., Greentree, A. D., Ionicioiu, R., O’Brien, J. L., Munro, W. J., & Hollenberg, L. C. L. (2007) · Physical Review A · doi:10.1103/physreva.76.052312 · Cited by 73
Optical generation of matter qubit graph states
Benjamin, S. C., Eisert, J., & Stace, T. M. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/194 · Cited by 50
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29
Methods for Scalable Optical Quantum Computation
Mor, T., & Yoran, N. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.090501 · Cited by 2
Self-citation
Metadata
- Authors
- Yoran, N., & Reznik, B.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2003-07-17
- Volume
- 91
- Issue
- 3
- ISSN
- 0031-9007
- 1079-7114
- Cited by
- 118
- References
- 4
- Language
- en
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