Scaling and networking a modular photonic quantum computer
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Photonics offers a promising platform for quantum computing1–4, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture’s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications. A proof-of-principle study reports a complete photonic quantum computer architecture that can, once appropriate component performance is achieved, deliver a universal and fault-tolerant quantum computer.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405 · cited 2×
“Within photonics-based platforms, machines have hosted sampling-based demonstrations of quantum computational advantage 22,23 , although they suffer from high photon losses and other noise sources that make them vulnerable to classical simulation 24 , as well as a wide array of programmable quantum…”
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119 · cited 1×
“Neutral atom-and ion-trap-based platforms 4,20,21 have demonstrated logical gate implementation with convincing evidence of subthreshold operation.”
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Self-citationQuantum 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-citationHow to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Quantum circuits with many photons on a programmable nanophotonic chip
Arrazola, J. M., Bergholm, V., Brádler, K., Bromley, T. R., Collins, M. J., Dhand, I., Fumagalli, A., Gerrits, T., Goussev, A., Helt, L. G., et al. (2021) · Nature · doi:10.1038/s41586-021-03202-1 · Cited by 567 · cited 3×
“Although promising progress on the performance and function of many building blocks for both approaches has been repor ted 6,25,26,32–34 , no complete photonic architecture has been experimentally demonstrated in practice at any scale, leaving claims of modularity, networkability and scalability…”
Self-citationHigh-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456 · cited 1×
“To benchmark the key functionalities 1–4 listed above, 2 core experiments were carried out using the machine.”
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
Fault-tolerant control of an error-corrected qubit
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2021) · Nature · doi:10.1038/s41586-021-03928-y · Cited by 348
Self-citationQuantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Time-Domain-Multiplexed Measurement-Based Quantum Operations with 25-MHz Clock Frequency
Asavanant, W., Charoensombutamon, B., Yokoyama, S., Ebihara, T., Nakamura, T., Alexander, R. N., Endo, M., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.034005 · Cited by 76 · cited 1×
“Although promising progress on the performance and function of many building blocks for both approaches has been repor ted 6,25,26,32–34 , no complete photonic architecture has been experimentally demonstrated in practice at any scale, leaving claims of modularity, networkability and scalability…”
Self-citationFault-Tolerant Operation of a Quantum Error-Correction Code
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.11482 · Cited by 65
Self-citationQuantum algorithms: A survey of applications and end-to-end complexities
Dalzell, A. M., McArdle, S., Berta, M., Bienias, P., Chen, C.-F., Gilyén, A., Hann, C. T., Kastoryano, M. J., Khabiboulline, E. T., Kubica, A., et al. (2023) · arXiv · doi:10.48550/arxiv.2310.03011 · Cited by 49
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Paetznick, A., da Silva, M. P., Ryan-Anderson, C., Bello-Rivas, J. M., Campora, J. P., Chernoguzov, A., Dreiling, J. M., Foltz, C., Frachon, F., Gaebler, J. P., et al. (2024) · arXiv · doi:10.48550/arxiv.2404.02280 · Cited by 42
Deterministic multi-mode gates on a scalable photonic quantum computing platform
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Nature Physics · doi:10.1038/s41567-021-01296-y · Cited by 4 · cited 1×
“22, 24 and 30–33, respectively.”
Self-citation
Metadata
- Authors
- Aghaee Rad, H., Ainsworth, T., Alexander, R. N., Altieri, B., Askarani, M. F., Baby, R., Banchi, L., Baragiola, B. Q., Bourassa, J. E., Chadwick, R. S., Charania, I., Chen, H., Collins, M. J., Contu, P., D’Arcy, N., Dauphinais, G., De Prins, R., Deschenes, D., Di Luch, I., Duque, S., Edke, P., Fayer, S. E., Ferracin, S., Ferretti, H., Gefaell, J., Glancy, S., González-Arciniegas, C., Grainge, T., Han, Z., Hastrup, J., Helt, L. G., Hillmann, T., Hundal, J., Izumi, S., Jaeken, T., Jonas, M., Kocsis, S., Krasnokutska, I., Larsen, M. V., Laskowski, P., Laudenbach, F., Lavoie, J., Li, M., Lomonte, E., Lopetegui, C. E., Luey, B., Lund, A. P., Ma, C., Madsen, L. S., Mahler, D. H., Mantilla Calderón, L., Menotti, M., Miatto, F. M., Morrison, B., Nadkarni, P. J., Nakamura, T., Neuhaus, L., Niu, Z., Noro, R., Papirov, K., Pesah, A., Phillips, D. S., Plick, W. N., Rogalsky, T., Rortais, F., Sabines-Chesterking, J., Safavi-Bayat, S., Sazhaev, E., Seymour, M., Rezaei Shad, K., Silverman, M., Srinivasan, S. A., Stephan, M., Tang, Q. Y., Tasker, J. F., Teo, Y. S., Then, R. B., Tremblay, J. E., Tzitrin, I., Vaidya, V. D., Vasmer, M., Vernon, Z., Villalobos, L. F. S. S. M., Walshe, B. W., Weil, R., Xin, X., Yan, X., Yao, Y., Zamani Abnili, M., & Zhang, Y.
- Venue
- Nature
- Published
- 2025-01-22
- Volume
- 638
- Issue
- 8052
- Pages
- 912-919
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W4406693713
- Cited by
- 178
- References
- 22
- FWCI
- 73.65
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.