Efficient Quantum Computation with Probabilistic Quantum Gates
Open accessAbstract
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.
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 type-I fusion operation allows one to efficiently generate arbitrarily long linear cluster states.
“the type-I fusion operation allows one to efficiently generate arbitrarily long linear cluster states.”
From Multiphoton entanglement and interferometry (2012) · cites this paper as Duan and Raussendorf, 2005
The paper states on p. 2 that 1D cluster states of arbitrary length can be created efficiently. But its construction uses probabilistic controlled phase-flip (CPF) gates, as described on pp. 1–2; our copy does not identify these as type-I fusion operations or establish the claim specifically for type-I fusion. (LLM, conf=0.88)
Experimental — accuracy not yet measuredIt was recently shown that an efficient preparation of cluster states is possible with probabilistic two-qubit controlled phase flip gates (Duan and Raussendorf, 2005; Chen et al., 2006a).
“It was recently shown that an efficient preparation of cluster states is possible with probabilistic two-qubit controlled phase flip gates (Duan and Raussendorf, 2005;Chen et al., 2006a).”
From Multiphoton entanglement and interferometry (2012) · cites this paper as Duan and Raussendorf, 2005
Due to the non-deterministic nature of entangling gates, the one-way model is the most natural approach to scalable quantum computation in hybrid optical-matter schemes.
“Due to the non-deterministic nature of the entangling gates, the one-way model is, again, the most natural approach to scalable quantum computation either via non-deterministic strategies 39,53 , repeat-until-success strategies 52 or so-called 'broker-client' approaches 54 .”
From Measurement-based quantum computation (2009) · cites this paper as [39]
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
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works
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
Self-citationLong-distance quantum communication with atomic ensembles and linear optics
Duan, L.-M., Lukin, M. D., Cirac, J. I., & Zoller, P. (2001) · Nature · doi:10.1038/35106500 · Cited by 3,576 · see citing works
Self-citationQuantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481 · see citing works
Persistent Entanglement in Arrays of Interacting Particles
Briegel, H. J., & Raussendorf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.910 · Cited by 1,950 · see citing works
Self-citationMeasurement-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 · see citing works
Self-citationScalable Photonic Quantum Computation through Cavity-Assisted Interactions
Duan, L., & Kimble, H. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.127902 · Cited by 864 · see citing works
Self-citationGeneration of nonclassical photon pairs for scalable quantum communication with atomic ensembles
Kuzmich, A., Bowen, W. P., Boozer, A. D., Boca, A., Chou, C. W., Duan, L.-M., & Kimble, H. J. (2003) · Nature · doi:10.1038/nature01714 · Cited by 683 · see citing works
Self-citationObservation of entanglement between a single trapped atom and a single photon
Blinov, B. B., Moehring, D. L., Duan, L., & Monroe, C. R. (2004) · Nature · doi:10.1038/nature02377 · Cited by 660 · see citing works
Self-citationOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614 · see citing works
Efficient high-fidelity quantum computation using matter qubits and linear optics
Barrett, S. D., & Kok, P. (2005) · Physical Review A · doi:10.1103/physreva.71.060310 · Cited by 614 · see citing works
Atomic Memory for Correlated Photon States
van der Wal, C. H., Eisaman, M. D., André, A., Walsworth, R. L., Phillips, D. F., Zibrov, A. S., & Lukin, M. D. (2003) · Science · doi:10.1126/science.1085946 · Cited by 471 · see citing works
Efficient Engineering of Multiatom Entanglement through Single-Photon Detections
Duan, L.-M., & Kimble, H. J. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.253601 · Cited by 406 · see citing works
Self-citationQuantum State Transfer Between Matter and Light
Matsukevich, D., & Kuzmich, A. (2004) · Science · doi:10.1126/science.1103346 · Cited by 336 · 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
Scalable trapped ion quantum computation with a probabilistic ion-photon mapping
Duan, L., Blinov, B. B., Moehring, D. L., & Monroe, C. R. (2004) · Quantum Information and Computation · doi:10.26421/qic4.3-1 · Cited by 115 · see citing works
Self-citationEntangling Many Atomic Ensembles through Laser Manipulation
Duan, L. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.170402 · Cited by 85 · see citing works
Self-citationScalable trapped ion quantum computation with a probabilistic ion-photon mapping
Duan, L., Blinov, B. B., Moehring, D. L., et al. (2004) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011617.2011618 · Cited by 84 · see citing works
Self-citationNonclassical photon pairs generated from a room-temperature atomic ensemble
Jiang, W., Han, C., Xue, P., Duan, L.-M., & Guo, G. (2004) · Physical Review A · doi:10.1103/physreva.69.043819 · Cited by 43 · see citing works
Self-citation
Flagged first, then by citations
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 · see citing works
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 · see citing works
Multiphoton entanglement and interferometry
Pan, J.-W., Chen, Z.-B., Lu, C.-Y., Weinfurter, H., Zeilinger, A., & Żukowski, M. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.777 · Cited by 1,410 · see citing works
“• Create a “+-shape” cluster (Duan and Raussendorf, 2005), with four ancillary legs each of length n0, by type-II fusing the two middle qubits of two linear clusters.”
BackgroundMeasurement-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
Self-citationEntanglement of single-atom quantum bits at a distance
Moehring, D. L., Maunz, P., Olmschenk, S., Younge, K. C., Matsukevich, D. N., Duan, L.-M., & Monroe, C. (2007) · Nature · doi:10.1038/nature06118 · Cited by 820 · see citing works
Self-citationExperimental entanglement of six photons in graph states
Lu, C.-Y., Zhou, X.-Q., Gühne, O., Gao, W.-B., Zhang, J., Yuan, Z.-S., Goebel, A., Yang, T., & Pan, J.-W. (2007) · Nature Physics · doi:10.1038/nphys507 · Cited by 683 · see citing works
<i>Colloquium</i>: Quantum networks with trapped ions
Duan, L.-M., & Monroe, C. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1209 · Cited by 530 · see citing works
Self-citationSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472 · see citing works
Quantum interference of photon pairs from two remote trapped atomic ions
Maunz, P., Moehring, D. L., Olmschenk, S., Younge, K. C., Matsukevich, D. N., & Monroe, C. (2007) · Nature Physics · doi:10.1038/nphys644 · Cited by 268 · see citing works
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 · see citing works
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 · see citing works
Cluster state preparation using gates operating at arbitrary success probabilities
Kieling, K., Gross, D., & Eisert, J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/200 · Cited by 21 · see citing works
Robust and scalable scheme to generate large-scale entanglement webs
Fujii, K., Maeda, H., & Yamamoto, K. (2011) · Physical Review A · doi:10.1103/physreva.83.050303 · Cited by 17 · see citing works
- Authors
- Duan, L.-M., & Raussendorf, R.
- Affiliations
- University of Michigan (US)
- California Institute of Technology (US)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-08-17
- Volume
- 95
- Issue
- 8
- Pages
- 080503-080503
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1965648392
- Cited by
- 185
- References
- 21
- Citations by year
- 2026: 2 · 2025: 8 · 2024: 11 · 2023: 3 · 2021: 1 · 2020: 4 · 2019: 6 · 2018: 1 · 2017: 2 · 2016: 6 · 2015: 7 · 2014: 6 · 2013: 11 · 2012: 9
- FWCI
- 21.13
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- 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 many-body systems
- Keywords
- quantum repeaters, cluster states, entangling gates, fault tolerance, quantum computing, noise mitigation, computational overhead
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
