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

The DOI matches its Crossref record; 52 of the 57 references it cites were found in a registry or an index; 25 of the 36 sources its claims cite were checked for support.

Quantum computational advantage with a programmable photonic processor

Open access

Abstract

A quantum computer attains computational advantage when outperforming the best classical computers running the best-known algorithms on well-defined tasks. No photonic machine offering programmability over all its quantum gates has demonstrated quantum computational advantage: previous machines 1,2 were largely restricted to static gate sequences. Earlier photonic demonstrations were also vulnerable to spoofing 3 , in which classical heuristics produce samples, without direct simulation, lying closer to the ideal distribution than do samples from the quantum hardware. Here we report quantum computational advantage using Borealis, a photonic processor offering dynamic programmability on all gates implemented. We carry out Gaussian boson sampling 4 (GBS) on 216 squeezed modes entangled with three-dimensional connectivity 5 , using a time-multiplexed and photon-number-resolving architecture. On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution, whereas Borealis requires only 36 μs. This runtime advantage is over 50 million times as extreme as that reported from earlier photonic machines. Ours constitutes a very large GBS experiment, registering events with up to 219 photons and a mean photon number of 125. This work is a critical milestone on the path to a practical quantum computer, validating key technological features of photonics as a platform for this goal.

Overview

CoChat Summary

TL;DR

The paper reports a photonic Gaussian boson sampling experiment, Borealis, claiming quantum computational advantage with a fully programmable processor. Using 216 squeezed modes and photon-number-resolving detection, the authors estimate that exact classical simulation would take more than 9,000 years for one sample, while the experiment takes 36 μs.

Key findings

  • Borealis implements Gaussian boson sampling on 216 squeezed modes with three-dimensional connectivity, and the paper reports events with up to 219 photons and a mean photon number of 125.
  • The authors estimate that the best available classical algorithms and supercomputers would need more than 9,000 years on average to produce one sample from the programmed distribution, versus 36 μs for Borealis.
  • In the low-photon-number regime, the paper reports fidelities in excess of 99% and TVDs below or equal to 6.5% for total photon-number sectors 3 to 6.
  • For the intermediate regime, they analyze 10^6 samples and state that the best adversary (the greedy sampler) remained below the experiment in cross-entropy; for the large regime, the experimental total photon-number distribution has its highest probability at N = 124.35 ± 0.02, with support past 160 photons.

Methods

  • The experiment uses a time-multiplexed photonic processor with three loop-based interferometers, a 6 MHz pulsed squeezed-light source, and 16-channel demultiplexing to route outputs to superconducting TES photon-number-resolving detectors.
  • The device synthesizes a 216-mode Gaussian state by injecting 216 squeezed-light pulses into the interferometer; the loops enable couplings at separations of 1, 6, and 36 time bins.
  • Performance is assessed by comparing experimental samples to the calibrated lossy ground truth using fidelity, total variation distance, cross-entropy benchmarks, Bayesian log averages, and cumulant comparisons against several classical adversaries.

Limitations

  • The paper states that because estimating all probabilities from the characterized transmission matrix would require orders of magnitude more samples, their analysis is limited; this is why data beyond N > 6 were left for later benchmarks.
  • The authors note that the demultiplexer and filter stack introduce losses, estimated at roughly 15% and 20%, respectively, and say improved detector speed could eliminate the demultiplexer.
  • Evident from the text: the reported advantage is tied to a specific programmed distribution and a calibrated lossy ground truth, so it is not a general proof of all photonic computations.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41586-022-04725-x

Cites

52 of 52 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 High-dimensional GBS from a fully programmable photonic processor. A periodic pulse train of single-mode squeezed states from a pulsed OPO enters a sequence of three dynamically programmable loop-based interferometers. Each loop contains a VBS, including a programmable phase shifter, and an optical fibre delay line. At the output of the interferometer, the Gaussian state is sent to a 1-to-16 binary switch tree (demux), which partially demultiplexes the output before readout by PNRs. The resulting detected sequence of 216 photon numbers, in approximately 36 μs, comprises one sample. The fibre delays and accompanying beamsplitters and phase shifters implement gates between both temporally adjacent and distant modes, enabling high-dimensional connectivity in the quantum circuit. Above each loop stage is depicted a lattice representation of the multipartite entangled Gaussian state being progressively synthesized. The first stage (τ) effects two-mode programmable gates (green edges) between nearest-neighbour modes in one dimension, whereas the second (6 τ) and third (36 τ) mediate couplings between modes separated by six and 36 time bins in the second and third dimensions (red and blue edges, respectively). Each run of the device involves the specification of 1,296 real parameters, corresponding to the sequence of settings for all VBS units.
Fig. 1 High-dimensional GBS from a fully programmable photonic processor. A periodic pulse train of single-mode squeezed states from a pulsed OPO enters a sequence of three dynamically programmable loop-based interferometers. Each loop contains a VBS, including a programmable phase shifter, and an optical fibre delay line. At the output of the interferometer, the Gaussian state is sent to a 1-to-16 binary switch tree (demux), which partially demultiplexes the output before readout by PNRs. The resulting detected sequence of 216 photon numbers, in approximately 36 μs, comprises one sample. The fibre delays and accompanying beamsplitters and phase shifters implement gates between both temporally adjacent and distant modes, enabling high-dimensional connectivity in the quantum circuit. Above each loop stage is depicted a lattice representation of the multipartite entangled Gaussian state being progressively synthesized. The first stage (τ) effects two-mode programmable gates (green edges) between nearest-neighbour modes in one dimension, whereas the second (6 τ) and third (36 τ) mediate couplings between modes separated by six and 36 time bins in the second and third dimensions (red and blue edges, respectively). Each run of the device involves the specification of 1,296 real parameters, corresponding to the sequence of settings for all VBS units.CC BY · PubMed Central
Fig. 2 Experimental validation of the GBS device. Each panel compares experimentally obtained sample probabilities, against those calculated from the ground truth (r, T), for up to six-photon events in a 16-mode state. A total of 84.1 × 106 samples were collected and divided according to their total photon number N and further split according to the collision pattern, from no collision (no more than one photon detected per PNR) to collisions of different densities (more than one photon per PNR). The overall fidelity (F) and TVD to simulations for each photon-number event is shown below. Further analysis of TVD for classical adversaries in the 16-mode GBS instance can be found in the Supplementary Information.
Fig. 2 Experimental validation of the GBS device. Each panel compares experimentally obtained sample probabilities, against those calculated from the ground truth (r, T), for up to six-photon events in a 16-mode state. A total of 84.1 × 106 samples were collected and divided according to their total photon number N and further split according to the collision pattern, from no collision (no more than one photon detected per PNR) to collisions of different densities (more than one photon per PNR). The overall fidelity (F) and TVD to simulations for each photon-number event is shown below. Further analysis of TVD for classical adversaries in the 16-mode GBS instance can be found in the Supplementary Information.CC BY · PubMed Central
Fig. 3 Benchmarks against the ground truth. a, Cross-entropy benchmark against the ground truth. Experimental samples from a high-dimensional GBS instance of 216 modes, averaging N¯=21.120±0.006 photons per sample, are bundled according to their total photon number N, from 10 to 26. Each point (score) corresponds to an average (equation (1)) over 10,000 samples per N. Genuine samples from the quantum hardware score higher than all classical spoofers, validating the high device fidelity with the ground truth. Error bars are standard errors of the mean. b, Bayesian log average score against the ground truth. Experimental samples from a 72-mode GBS instance and N¯=22.416±0.006 photon number per sample. Each score is averaged over 2,000 samples with N from 10 to 26. Error bars are standard errors of the mean. All scores are above zero, including error bar, indicating that the samples generated by Borealis are closer to the ground truth than from the adversarial distribution corresponding to squashed, thermal, coherent and distinguishable squeezed spoofers.
Fig. 3 Benchmarks against the ground truth. a, Cross-entropy benchmark against the ground truth. Experimental samples from a high-dimensional GBS instance of 216 modes, averaging N¯=21.120±0.006 photons per sample, are bundled according to their total photon number N, from 10 to 26. Each point (score) corresponds to an average (equation (1)) over 10,000 samples per N. Genuine samples from the quantum hardware score higher than all classical spoofers, validating the high device fidelity with the ground truth. Error bars are standard errors of the mean. b, Bayesian log average score against the ground truth. Experimental samples from a 72-mode GBS instance and N¯=22.416±0.006 photon number per sample. Each score is averaged over 2,000 samples with N from 10 to 26. Error bars are standard errors of the mean. All scores are above zero, including error bar, indicating that the samples generated by Borealis are closer to the ground truth than from the adversarial distribution corresponding to squashed, thermal, coherent and distinguishable squeezed spoofers.CC BY · PubMed Central
Fig. 4 Quantum computational advantage. a, Measured photon statistics of 106 samples of a high-dimensional Gaussian state compared with those generated numerically from different hypotheses. The inset shows the same distribution in a log scale having significant support past 160 photons, up to 219. b, Scatter plot of two-mode cumulants Cij for all the pairs of modes comparing experimentally obtained ones versus the ones predicted by four different hypotheses. A perfect hypothesis fit (shown in plot) would correspond to the experimentally obtained cumulants lying on a straight line at 45° (shown in plot). Note that the ground truth is the only one that explains the cumulants well. Moreover, to make a fair comparison all the hypothesis have exactly the same first-order cumulants (mean photon in each mode). c, Distribution of classical simulation times for each sample from this experiment, shown as Borealis in red and for Jiuzhang 2.0 in blue2. For each sample of both experiments, we calculate the pair (Nc, G) and then construct a frequency histogram populating this two-dimensional space. Note that because the samples from Jiuzhang 2.0 are all threshold samples they have G = 2, whereas samples from Borealis, having collisions and being photon-number resolved, have G ≥ 2. Having plotted the density of samples for each experiment in (Nc, G) space, we indicate with a star the sample with the highest complexity in each experiment. For each experiment, the starred sample is at the very end of the distribution and occurs very rarely; for Jiuzhang 2.0 this falls within the line G = 2. Finally, we overlay lines of equal simulation time as given by equation (4) as a function of Nc and G. To guide the eye we also show boundaries delineating two standard deviations in plotted distributions (dashed lines).
Fig. 4 Quantum computational advantage. a, Measured photon statistics of 106 samples of a high-dimensional Gaussian state compared with those generated numerically from different hypotheses. The inset shows the same distribution in a log scale having significant support past 160 photons, up to 219. b, Scatter plot of two-mode cumulants Cij for all the pairs of modes comparing experimentally obtained ones versus the ones predicted by four different hypotheses. A perfect hypothesis fit (shown in plot) would correspond to the experimentally obtained cumulants lying on a straight line at 45° (shown in plot). Note that the ground truth is the only one that explains the cumulants well. Moreover, to make a fair comparison all the hypothesis have exactly the same first-order cumulants (mean photon in each mode). c, Distribution of classical simulation times for each sample from this experiment, shown as Borealis in red and for Jiuzhang 2.0 in blue2. For each sample of both experiments, we calculate the pair (Nc, G) and then construct a frequency histogram populating this two-dimensional space. Note that because the samples from Jiuzhang 2.0 are all threshold samples they have G = 2, whereas samples from Borealis, having collisions and being photon-number resolved, have G ≥ 2. Having plotted the density of samples for each experiment in (Nc, G) space, we indicate with a star the sample with the highest complexity in each experiment. For each experiment, the starred sample is at the very end of the distribution and occurs very rarely; for Jiuzhang 2.0 this falls within the line G = 2. Finally, we overlay lines of equal simulation time as given by equation (4) as a function of Nc and G. To guide the eye we also show boundaries delineating two standard deviations in plotted distributions (dashed lines).CC BY · PubMed Central

Verification

Claims the paper makes

15 Valid · 6 Not valid · 3 Not checked · 69 Own results and interpretations

53 more claims · 8 with their cited sources checked

Create a free account to see all 93 claims and to verify the 3 references still open.

See all claims — free account
  • It may state two separate claims as one. 26
  • Probably not a substantial claim. 10

Create a free account to see these claims.

Citations

Cites

Show all 57 references

Research works printed but not linked: 1

  1. 56th edition of the top 500 Top 500 the List https://www.top500.org/lists/top500/2020/11/ (2020).

Cited by

See all 1,101

Metadata

Authors
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., Lita, A. E., Gerrits, T., Nam, S. W., Vaidya, V. D., Menotti, M., Dhand, I., Vernon, Z., Quesada, N., & Lavoie, J.
Affiliations
  • Xanadu Quantum Technologies (Canada) (CA)
  • National Institute of Standards and Technology (US)
Corresponding author
  • Quesada, Nicolás
  • Lavoie, Jonathan
Venue
Nature
Published
2022-06-01
Volume
606
Issue
7912
Pages
75-81
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4281891658
Cited by
1,101
References
57
Citations by year
2026: 202 · 2025: 282 · 2024: 302 · 2023: 259 · 2022: 56
FWCI
60.16
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • FIU - Digital Commons (Florida International University) (submittedVersion, cc-by)
  • Florida International University Digital Commons (Florida International University) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
Funders
  • Government of Ontario
  • University of Toronto
  • National Institute of Standards and Technology
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Reservoir Computing
Keywords
quantum advantage, Borealis, Gaussian boson sampling, photon-number-resolving detection, spoofing attacks, quantum computing hardware

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).

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: Quantum computational advantage with a programmable photonic processor. https://app.cochat.ai/papers/10.1038/s41586-022-04725-x
The paper
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., Lita, A. E., Gerrits, T., Nam, S. W., Vaidya, V. D., Menotti, M., Dhand, I., Vernon, Z., Quesada, N., & Lavoie, J. (2022). Quantum computational advantage with a programmable photonic processor. Nature. https://doi.org/10.1038/s41586-022-04725-x

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.