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 accessAbstract
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.
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.
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 note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 3×
“This allows for the measurement of a multi-qubit logical Pauli operator involving a logical Y , alleviating the cost of distilling the eigenstates of the Pauli-Y operator |y〉 to implement logical P gates with the surface code [80, 104].”
BackgroundMethodError Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“In the case of the so-called Calderbank-Shor-Steane (CSS) codes [81, 82], this can be implemented using cluster states corresponding to foliated (i.”
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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Research works printed but not linked: 23
- 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
- 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
- Daniel Gottesman. Stabilizer codes and quantum error correction. arXiv preprint quant-ph/9705052, 1997. · arXiv
- 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
- 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
- Naomi Nickerson and Héctor Bombín. Measurement based fault tolerance beyond foliation. arXiv preprint arXiv:1810.09621, 2018. · arXiv
- Hector Bombin. 2D quantum computation with 3D topological codes. arXiv preprint arXiv:1810.09571, 2018a. · arXiv
- Hector Bombin. Transversal gates and error propagation in 3D topological codes. arXiv preprint arXiv:1810.09575, 2018b. · arXiv
- 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
- Christopher Bishop. Pattern recognition and machine learning. Springer, New York, 2006. ISBN 0-387-31073-8.
- 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
- Nicolas Delfosse and Naomi H Nickerson. Almost-linear time decoding algorithm for topological codes. arXiv preprint arXiv:1709.06218, 2017. · arXiv
- Pavel Panteleev and Gleb Kalachev. Degenerate quantum LDPC codes with good finite length performance. arXiv preprint arXiv:1904.02703, 2019. · arXiv
- 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
- J Harrington. Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes. PhD thesis, Caltech, 2004.
- 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
- 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
- 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
- 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
- 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
- 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
- Adrian Cho. IBM promises 1000-qubit quantum computer—a milestone—by 2023. Science, September 2020. 10.1126/science.abe8122. · doi:10.1126/science.abe8122
- 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
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Self-citationNon-Gaussian Quantum States and Where to Find Them
Walschaers, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030204 · Cited by 306
Recent progress in quantum photonic chips for quantum communication and internet
Luo, W., Cao, L., Shi, Y., Wan, L., Zhang, H., Li, S., Chen, G., Li, Y., Li, S., Wang, Y., et al. (2023) · Light: Science & Applications · doi:10.1038/s41377-023-01173-8 · Cited by 284
Quantum computational advantage via high-dimensional Gaussian boson sampling
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., et al. (2022) · Science Advances · doi:10.1126/sciadv.abi7894 · Cited by 106
Self-citationLocalized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
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.