Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 302

The DOI matches its Crossref record; 153 of the 153 references it cites were found in a registry or an index.

Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer

Open access
Bourassa, J. Eli, Alexander, Rafael N., Vasmer, Michael, Patil, Ashlesha, Tzitrin, Ilan, Matsuura, Takaya, Su, Daiqin, Baragiola, Ben Q., Guha, Saikat, Dauphinais, Guillaume, Sabapathy, Krishna K., Menicucci, Nicolas C., Dhand, Ish·2021·Quantum

Abstract

Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional resource states comprising both bosonic qubits and squeezed vacuum states. The proposal exploits state-of-the-art procedures for the non-deterministic generation of bosonic qubits combined with the strengths of continuous-variable quantum computation, namely the implementation of Clifford gates using easy-to-generate squeezed states. Moreover, the architecture is based on two-dimensional integrated photonic chips used to produce a qubit cluster state in one temporal and two spatial dimensions. By reducing the experimental challenges as compared to existing architectures and by enabling room-temperature quantum computation, our design opens the door to scalable fabrication and operation, which may allow photonics to leap-frog other platforms on the path to a quantum computer with millions of 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2021-02-04-392

Cites

153 of 153 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 153 references

Research works printed but not linked: 23

  1. Kosuke Fukui, Akihisa Tomita, Atsushi Okamoto, and Keisuke Fujii. High-threshold fault-tolerant quantum computation with analog quantum error correction. Phys. Rev. X, 8: 021054, May 2018b. 10.1103/PhysRevX.8.021054. · DOI · Paper page
  2. Kosuke Fukui. High-threshold fault-tolerant quantum computation with the GKP qubit and realistically noisy devices. arXiv preprint arXiv:1906.09767, 2019. · DOI · Paper page
  3. Daniel Gottesman. Stabilizer codes and quantum error correction. arXiv preprint quant-ph/9705052, 1997. · arXiv
  4. Jacob Hastrup, Mikkel V Larsen, Jonas S Neergaard-Nielsen, Nicolas C Meniccuci, and Ulrik L Andersen. Cubic phase gates are not suitable for non-Clifford operations on GKP states. arXiv preprint arXiv:2009.05309, 2020. · arXiv
  5. Austin G Fowler and Kovid Goyal. Topological cluster state quantum computing. Quantum Inf. Comput., 9 (9-10): 0721–0738, 2009. 10.26421/QIC9.9-10. · doi:10.26421/qic9.9-10
  6. Naomi Nickerson and Héctor Bombín. Measurement based fault tolerance beyond foliation. arXiv preprint arXiv:1810.09621, 2018. · arXiv
  7. Hector Bombin. 2D quantum computation with 3D topological codes. arXiv preprint arXiv:1810.09571, 2018a. · arXiv
  8. Hector Bombin. Transversal gates and error propagation in 3D topological codes. arXiv preprint arXiv:1810.09575, 2018b. · arXiv
  9. Hayata Yamasaki, Kosuke Fukui, Yuki Takeuchi, Seiichiro Tani, and Masato Koashi. Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code. arXiv preprint arXiv:2006.05416, 2020. · arXiv
  10. Christopher Bishop. Pattern recognition and machine learning. Springer, New York, 2006. ISBN 0-387-31073-8.
  11. Christoph Buchheim, Ruth Hübner, and Anita Schöbel. Ellipsoid bounds for convex quadratic integer programming. SIAM J. Optim., 25 (2): 741–769, January 2015. 10.1137/130929187. · doi:10.1137/130929187
  12. Nicolas Delfosse and Naomi H Nickerson. Almost-linear time decoding algorithm for topological codes. arXiv preprint arXiv:1709.06218, 2017. · arXiv
  13. Pavel Panteleev and Gleb Kalachev. Degenerate quantum LDPC codes with good finite length performance. arXiv preprint arXiv:1904.02703, 2019. · arXiv
  14. Austin G. Fowler. Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time. Quantum Inf. Comput., 15 (1-2): 145–158, 2014. 10.5555/2685188.2685197. · doi:10.5555/2685188.2685197
  15. J Harrington. Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes. PhD thesis, Caltech, 2004.
  16. Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca. Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and $T$ gates. Quantum Info. Comput., 13 (7–8): 607–630, July 2013a. 10.5555/2535649.2535653. · doi:10.5555/2535649.2535653
  17. Panos Aliferis, Daniel Gottesman, and John Preskill. Quantum accuracy threshold for concatenated distance-3 codes. Quantum Inf. Comput., 6 (2): 097–165, 2006. 10.26421/QIC6.2. · doi:10.26421/qic6.2
  18. Panos Aliferis, Daniel Gottesman, and John Preskill. Accuracy threshold for postselected quantum computation. Quantum Inf. Comput., 8 (3-4): 181–244, mar 2008. 10.26421/QIC8.3-4. · doi:10.26421/qic8.3-4
  19. Daniel Gottesman. Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput., 14 (15-16): 1338–1372, oct 2014. 10.26421/QIC14.15-16. · doi:10.26421/qic14.15-16
  20. Christian D. Lorenz and Robert M. Ziff. Precise determination of the bond percolation thresholds and finite-size scaling corrections for the sc, fcc, and bcc lattices. Phys. Rev. E, 57: 230–236, Jan 1998. 10.1103/PhysRevE.57.230. · doi:10.1103/physreve.57.230
  21. Yong Zhang, M Menotti, K Tan, VD Vaidya, DH Mahler, L Zatti, M Liscidini, B Morrison, and Z Vernon. Single-mode quadrature squeezing using dual-pump four-wave mixing in an integrated nanophotonic device. arXiv preprint arXiv:2001.09474, 2020. · arXiv
  22. Adrian Cho. IBM promises 1000-qubit quantum computer—a milestone—by 2023. Science, September 2020. 10.1126/science.abe8122. · doi:10.1126/science.abe8122
  23. Matteo G.A. Paris. Displacement operator by beam splitter. Phys. Lett. A, 217 (2-3): 78–80, July 1996. 10.1016/0375-9601(96)00339-8. · doi:10.1016/0375-9601(96)00339-8

Cited by

See all 302

Metadata

Authors
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., Sabapathy, K. K., Menicucci, N. C., & Dhand, I.
Venue
Quantum
Published
2021-02-04
Volume
5
Pages
392
ISSN
2521-327X (ISSN-L)
OpenAlex
W3092581746
Cited by
302
References
153
FWCI
16.23
Type
journal article
Language
en
Open access
gold

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer. https://app.cochat.ai/papers/10.22331/q-2021-02-04-392
The paper
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., Sabapathy, K. K., Menicucci, N. C., & Dhand, I. (2021). Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer. Quantum. https://doi.org/10.22331/q-2021-02-04-392

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.