The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Cluster-state quantum computation
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?
Using one parameter to describe both photon absorption and detector efficiency will not have a dramatic effect on the threshold.
“Similarly, using one parameter to describe both photon absorption and detector efficiency will not have a dramatic effect on the threshold (Nielsen 2006).”
From Linear optical quantum computing with photonic qubits (2007) · cites this paper as Nielsen 2006
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
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
Self-citationCan Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
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
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 · cited 1×
“Key words: quantum computation, cluster states, one-way quantum computer”
BackgroundResource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Flagged first, then by citations
Research works printed but not linked: 25
- Raussendorf, 2001, Phys. Rev. Lett., 86, 5188, 10.1103/PhysRevLett.86.5188 · DOI · Paper page
- Raussendorf, 2002, J. Mod. Opt., 49, 1299, 10.1080/09500340110107487 · DOI
- Nielsen, 2004, Phys. Rev. Lett., 93, 040503, 10.1103/PhysRevLett.93.040503 · DOI · Paper page
- Nielsen, 2003, Phys. Lett. A, 308, 96, 10.1016/S0375-9601(02)01803-0 · DOI · Paper page
- D. W. Leung: Two qubit projective measurements are universal for quantum computation, quant-ph/0111122. · arXiv
- D. W. Leung: Quantum computation by measurements, quant-ph/0310189. · arXiv
- P. Aliferis and D. W. Leung: Computation by measurements: a unifying picture, quant-ph/0404082. · arXiv
- A. M. Childs, D. W. Leung and M. A. Nielsen: Unified derivation of measurement-based schemes for quantum computation, quant-ph/0404132. · arXiv
- P. Jorrand and S. Perdrix: Unifying quantum computation with projective measurements only and one-way quantum computation, quant-ph/0404125. · arXiv
- T. Rudolph and S. S. Virmani: A relational quantum computer using only two-qubit total spin measurement and an initial supply of highly mixed single qubit states, quant-ph/0503151. · arXiv
- P. Aliferis and D. W. Leung: Fault-tolerant quantum computation with graph states, quant-ph/0503130. · arXiv
- V. Danos, E. Kashefi and P. Panangaden: The measurement calculus, quant-ph/0412135. · arXiv
- M. Mhalla and S. Perdrix: Complexity of graph state preparation, quant-ph/0412071. · arXiv
- M. A. Nielsen and C. M. Dawson: Fault-tolerant quantum computation with cluster states, quant-ph/0405134. · arXiv
- S. Perdrix and P. Jorrand: Measurement-based quantum Turing machines and their universality, quant-ph/0404146. · arXiv
- Verstraete, 2004, Phys. Rev. A, 70, 060302(R), 10.1103/PhysRevA.70.060302 · DOI · Paper page
- S. D. Barrett and P. Kok: Efficient high-fidelity quantum computation using matter qubits and linear optics, quant-ph/0408040. · arXiv
- Hutchinson, 2004, J. Mod. Opt., 51, 1211, 10.1080/09500340408230417 · DOI
- Raussendorf, 2002, J. Mod. Opt., 49, 1299, 10.1080/09500340110107487 · DOI
- Deutsch, 1989, 425, 73
- E. Knill: Approximating quantum circuits, quant-ph/9508006. · arXiv
- Raussendorf, 2001, Phys. Rev. Lett., 85, 910
- Zhou, 2000, Phys. Rev. A, 62, 052316, 10.1103/PhysRevA.62.052316 · DOI · Paper page
- E. Knill: Thresholds for linear optics quantum computation, quant-ph/0006120. · arXiv
- Haselgrove, 2003, Phys. Rev. Lett., 91, 052311, 10.1103/PhysRevLett.91.210401 · DOI
Cited by
Sorted by citations
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
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
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
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
High-Fidelity Readout of Trapped-Ion Qubits
Myerson, A. H., Szwer, D. J., Webster, S. C., Allcock, D. T. C., Curtis, M. J., Imreh, G., Sherman, J. A., Stacey, D. N., Steane, A. M., & Lucas, D. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.200502 · Cited by 334
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
Novel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220503 · Cited by 255
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
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
Cluster-state quantum computing in optical fibers
Soudagar, Y., Bussières, F., Berlín, G., Lacroix, S., Fernandez, J. M., & Godbout, N. (2007) · Journal of the Optical Society of America B · doi:10.1364/josab.24.000226 · Cited by 33
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29
Metadata
- Authors
- Nielsen, M. A.
- Venue
- Reports on Mathematical Physics
- Publisher
- Elsevier BV
- Published
- 2006-02
- Volume
- 57
- Issue
- 1
- Pages
- 147-161
- ISSN
- 0034-4877
- Cited by
- 315
- References
- 6
- 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
