From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable. However, existing schemes typically require extensive adaptive switching, which is experimentally challenging and noisy, thousands of photon sources per renormalized qubit, and/or large quantum memories for repeat-until-success strategies. Our work overcomes all these problems. We present a scheme to construct a cluster state universal for quantum computation, which uses no adaptive switching, no large memories, and which is at least an order of magnitude more resource efficient than previous passive schemes. Unlike previous proposals, it is constructed entirely from loss-detecting gates and offers a robustness to photon loss. Even without the use of an active loss-tolerant encoding, our scheme naturally tolerates a total loss rate ∼1.6% in the photons detected in the gates. This scheme uses only 3 Greenberger-Horne-Zeilinger states as a resource, together with a passive linear-optical network. We fully describe and model the iterative process of cluster generation, including photon loss and gate failure. This demonstrates that building a linear-optical quantum computer needs to be less challenging than previously thought.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
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
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
Self-citationOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Experimental validation of photonic boson sampling
Spagnolo, N., Vitelli, C., Bentivegna, M., Brod, D. J., Crespi, A., Flamini, F., Giacomini, S., Milani, G., Ramponi, R., Mataloni, P., et al. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.135 · Cited by 312
Varnava, M., Browne, D. E., & Rudolph, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.060502 · Cited by 248
Self-citationLoss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction
Varnava, M., Browne, D. E., & Rudolph, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.120501 · Cited by 203
Self-citation
Cited by
Solid-state single-photon emitters
Aharonovich, I., Englund, D., & Toth, M. (2016) · Nature Photonics · doi:10.1038/nphoton.2016.186 · Cited by 1,786
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
Qiang, X., Zhou, X., Wang, J., Wilkes, C. M., Loke, T., O’Gara, S., Kling, L., Marshall, G. D., Santagati, R., Ralph, T. C., et al. (2018) · Nature Photonics · doi:10.1038/s41566-018-0236-y · Cited by 516
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Self-citationSilverstone, J. W., Bonneau, D., O'Brien, J. L., & Thompson, M. G. (2016) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2016.2573218 · Cited by 352
Why I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350
“Type-II fusion [31] is an operation that with probability 1/2 joins up (fuses) cluster state, the boosted form [30] exploits the ideas of [32, 33] to increase the success probability to 3/4.”
BackgroundSelf-citationHybrid integration methods for on-chip quantum photonics
Kim, J.-H., Aghaeimeibodi, S., Carolan, J., Englund, D., & Waks, E. (2020) · Optica · doi:10.1364/optica.384118 · Cited by 272
“For example, fast low-loss switching can be used to turn these probabilistic operations into near-deterministic ones via multiplexing [176].”
BackgroundApplications of single photons to quantum communication and computing
Couteau, C., Barz, S., Durt, T., Gerrits, T., Huwer, J., Prevedel, R., Rarity, J., Shields, A., & Weihs, G. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00583-2 · Cited by 216
“Theoretical scalable quantum computing proposals envision the notion of flexible cluster state computation modes 148–150 , in which heralded single photons are assembled into three-photon Greenberger–Horne–Zeilinger states and then merged into complex 3D cluster states developing fusion gate…”
BackgroundChip-to-chip quantum photonic interconnect by path-polarization interconversion
Wang, J., Bonneau, D., Villa, M., Silverstone, J. W., Santagati, R., Miki, S., Yamashita, T., Fujiwara, M., Sasaki, M., Terai, H., et al. (2016) · Optica · doi:10.1364/optica.3.000407 · Cited by 156
Programmable four-photon graph states on a silicon chip
Adcock, J. C., Vigliar, C., Santagati, R., Silverstone, J. W., & Thompson, M. G. (2019) · Nature Communications · doi:10.1038/s41467-019-11489-y · Cited by 129
Error-protected qubits in a silicon photonic chip
Vigliar, C., Paesani, S., Ding, Y., Adcock, J. C., Wang, J., Morley-Short, S., Bacco, D., Oxenløwe, L. K., Thompson, M. G., Rarity, J. G., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01333-w · Cited by 118
High-extinction ratio integrated photonic filters for silicon quantum photonics
Piekarek, M., Bonneau, D., Miki, S., Yamashita, T., Fujiwara, M., Sasaki, M., Terai, H., Tanner, M. G., Natarajan, C. M., Hadfield, R. H., et al. (2017) · Optics Letters · doi:10.1364/ol.42.000815 · Cited by 96
Independent high-purity photons created in domain-engineered crystals
Graffitti, F., Barrow, P., Proietti, M., Kundys, D., & Fedrizzi, A. (2018) · Optica · doi:10.1364/optica.5.000514 · Cited by 95
Metadata
- Authors
- Gimeno-Segovia, M., Shadbolt, P., Browne, D. E., & Rudolph, T.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2015-07-08
- Volume
- 115
- Issue
- 2
- Pages
- 020502-020502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2413270780
- Cited by
- 215
- References
- 11
- FWCI
- 14.08
- Type
- journal article
- Language
- en
- Open access
- green
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
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.