Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.14602

Scalability and performance metrics for boson sampling devices

Dong-Gil Im, Chung-Hyun Lee, Joonsuk Huh, Yoon-Ho Kim

quant-phSubmitted Oct 10, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

Linear-optical platforms provide a promising route to demonstrate quantum computational advantage, particularly through the boson sampling problem. While a boson sampling system should be large enough to show the quantum advantage, the size of the boson sampling problem is often restricted by experimental constraints. In particular, as a boson sampling system is scaled up, experimental constraints can limit its effective problem size to permit efficient classical simulation. In this paper, we investigate the theoretical scalability bounds for boson sampling systems under practical experimental conditions, including photon loss, mode mismatch, and input state error. We employ non-negativity conditions for phase-space quasiprobability distribution functions to analyze these effects. In addition, we introduce two device-level metrics, the boson sampling score which measures the usable capacity of a given device and the boson sampling volume which provides a common hardware-level benchmark for comparing different platforms and assessing their access to an advantage-relevant problem size regime. Our results provide fundamental insights into the performance of boson sampling systems under realistic experimental conditions and offer practical guidelines for scaling up boson sampling systems.

AI Summary

The paper asks how loss, mode mismatch, input-state properties, and detector noise constrain boson-sampling scalability, and how these constraints can inform device benchmarks. It uses a phase-space representation in which nonnegative, efficiently sampleable input, channel, and measurement quasiprobability functions provide a sufficient condition for efficient classical sampling. Assuming uniform transmission and detector properties, an equal-overlap model, and approximately uniform mixing of distinguishable photons, the condition becomes $2\mu\eta_L(1-p_{ind})\nu+2D_c/\eta_D+\eta_Lp_{ind}(\bar t-1)\geq0$. Here $\nu=N/M$, $\mu$ is input brightness, and $\bar t$ is the input-state nonnegativity threshold. For decreasing transmission $\eta_L(M)$ and fixed filling fraction, this yields a mode-count boundary $M_B=\lceil\eta_L^{-1}(\eta_{th})\rceil$ beyond which the model certifies classical simulability. Two proposed metrics are a score $S_{BS}$ estimating usable detected indistinguishable-photon capacity, set to zero beyond $M_B$, and a volume $V_{BS}(M_L)=\max_{M\leq M_L}\min[S_{BS}(M),\sqrt M]$, imposing a low-collision size constraint. Transmission models with linear, logarithmic, and square-root interferometer depths translate target volumes into component-transmission requirements. Applied to selected Jiuzhang datasets, the volumes are 10 for 100 modes, 12 for 144 modes, and 90.42 for 8,176 modes; all are mode-limited under this definition, rather than limited by the PQD criterion. The criterion is sufficient, not necessary, and the volume does not certify quantum advantage. Outside the certified-simulable and low-collision regimes, optimized classical benchmarking remains necessary. For the hybrid 8,176-mode architecture, $M_B$ is undetermined because transmission scaling is unspecified.

Little sign of AI-generated textIncrementalStrong assumptionsPossible errorMissing comparison

Central claim may not hold: The mismatch-dependent simulability criterion replaces distinguishable photons with independent detector background without justifying the output distribution, so the phase-space sampler does not establish the claimed certification for physical mode mismatch. Although Eq. (Score) can define hypothetical device capacity, its interpretation as the implemented configuration's effective detected-photon count fails for partially populated inputs because it omits the actual input count N. For partially populated devices, the score's hypothetical input capacity and the fixed-filling-fraction simulability bound can describe different configurations, without a prescribed consistent recalculation.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
9 pages, 2 figures

Related papers

Simulating and assessing boson sampling experiments with phase-space representations

Bogdan Opanchuk, L. Rosales-Zárate, M. D. Reid +1 more

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples, with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible. This introduces a challenge: how does one design or understand such photonic networks? One must be able to calculate observables using general methods capable of treating arbitrary inputs, dissipation, and noise. We develop complex phase-space software for simulating these photonic networks, and apply this to boson sampling experiments. Our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples. We show that these techniques remove systematic errors in previous algorithms for estimating correlations, with large improvements in errors in some cases. In addition, we obtain a scalable channel-combination strategy for assessment of boson sampling devices.

arXiv:1609.05614•Physical Review A•Apr 4, 2018•25 citations

Non-linear Boson Sampling

Nicolò Spagnolo, Daniel J. Brod, Ernesto F. Galvão +1 more

Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.

arXiv:2110.13788•npj Quantum Information•Jan 9, 2023•33 citations

Quantum Energetic Advantage before Computational Advantage in Boson Sampling

Ariane Soret, Nessim Dridi, Stephen C. Wein +3 more

Understanding the energetic efficiency of quantum computers is essential for assessing their scalability and for determining whether quantum technologies can outperform classical computation beyond runtime alone. In this work, we analyze the energy required to solve the Boson Sampling problem, a paradigmatic task for quantum advantage, using a realistic photonic quantum computing architecture. Using the Metric-Noise-Resource methodology, we establish a quantitative connection between experimental control parameters, dominant noise processes, and energetic resources through a performance metric tailored to Boson Sampling. We estimate the energy cost per sample and identify operating regimes that optimize energetic efficiency. By comparing the energy consumption of quantum and state-of-the-art classical implementations, we demonstrate the existence of a quantum energetic advantage -- defined as a lower energy cost per sample compared to the best-known classical implementation -- that emerges before the onset of computational advantage, even in regimes where classical algorithms remain faster. Finally, we propose an experimentally feasible Boson Sampling architecture, including a complete noise and loss budget, that enables a near-term observation of quantum energetic advantage.

quant-pharXiv:2601.08068•Physical Review Letters•Jan 14, 2026•10 citations

Classical Simulation of Quantum Systems?

J. D. Franson

We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process.We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling.In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors.Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable.We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.

Physics•Jun 20, 2016•2 citations

Sufficient Conditions for Efficient Classical Simulation of Quantum Optics

Saleh Rahimi-Keshari, Timothy C. Ralph, Carlton M. Caves

We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process. We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling. In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors. Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable. We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.

arXiv:1511.06526•Physical Review X•Jun 20, 2016•171 citations

Classical simulability of noisy boson sampling

Jelmer J. Renema, V. S. Shchesnovich, Raúl García−Patrón

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For such a demonstration to be meaningful, experimental noise must not affect the computational power of the device; this occurs when a classical algorithm can use the noise to simulate the quantum system. In this work, we demonstrate an algorithm which simulates boson sampling, a quantum advantage demonstration based on many-body quantum interference of indistinguishable bosons, in the presence of optical loss. Finding the level of noise where this approximation becomes efficient lets us map out the maximum level of imperfections at which it is still possible to demonstrate a quantum advantage. We show that current photonic technology falls short of this benchmark. These results call into question the suitability of boson sampling as a quantum advantage demonstration.

arXiv:1809.01953•Sep 6, 2018•76 citations
Linear-optical platforms provide a promising route to demonstrate quantum computational advantage, particularly through the boson sampling problem. While a boson sampling system should be large enough to show the quantum advantage, the size of the boson sampling problem is often restricted by experimental constraints. In particular, as a boson sampling system is scaled up, experimental constraints can limit its effective problem size to permit efficient classical simulation. In this paper, we investigate the theoretical scalability bounds for boson sampling systems under practical experimental conditions, including photon loss, mode mismatch, and input state error. We employ non-negativity conditions for phase-space quasiprobability distribution functions to analyze these effects. In addition, we introduce two device-level metrics, the boson sampling score which measures the usable capacity of a given device and the boson sampling volume which provides a common hardware-level benchmark for comparing different platforms and assessing their access to an advantage-relevant problem size regime. Our results provide fundamental insights into the performance of boson sampling systems under realistic experimental conditions and offer practical guidelines for scaling up boson sampling systems.
The paper asks how loss, mode mismatch, input-state properties, and detector noise constrain boson-sampling scalability, and how these constraints can inform device benchmarks. It uses a phase-space representation in which nonnegative, efficiently sampleable input, channel, and measurement quasiprobability functions provide a sufficient condition for efficient classical sampling.
Assuming uniform transmission and detector properties, an equal-overlap model, and approximately uniform mixing of distinguishable photons, the condition becomes 2μηL(1−pind)ν+2Dc/ηD+ηLpind(tˉ−1)≥02\mu\eta_L(1-p_{ind})\nu+2D_c/\eta_D+\eta_Lp_{ind}(\bar t-1)\geq02μηL​(1−pind​)ν+2Dc​/ηD​+ηL​pind​(tˉ−1)≥0. Here ν=N/M\nu=N/Mν=N/M, μ\muμ is input brightness, and tˉ\bar ttˉ is the input-state nonnegativity threshold. For decreasing transmission ηL(M)\eta_L(M)ηL​(M) and fixed filling fraction, this yields a mode-count boundary MB=⌈ηL−1(ηth)⌉M_B=\lceil\eta_L^{-1}(\eta_{th})\rceilMB​=⌈ηL−1​(ηth​)⌉ beyond which the model certifies classical simulability.
Two proposed metrics are a score SBSS_{BS}SBS​ estimating usable detected indistinguishable-photon capacity, set to zero beyond MBM_BMB​, and a volume VBS(ML)=max⁡M≤MLmin⁡[SBS(M),M]V_{BS}(M_L)=\max_{M\leq M_L}\min[S_{BS}(M),\sqrt M]VBS​(ML​)=maxM≤ML​​min[SBS​(M),M​], imposing a low-collision size constraint. Transmission models with linear, logarithmic, and square-root interferometer depths translate target volumes into component-transmission requirements. Applied to selected Jiuzhang datasets, the volumes are 10 for 100 modes, 12 for 144 modes, and 90.42 for 8,176 modes; all are mode-limited under this definition, rather than limited by the PQD criterion.
The criterion is sufficient, not necessary, and the volume does not certify quantum advantage. Outside the certified-simulable and low-collision regimes, optimized classical benchmarking remains necessary. For the hybrid 8,176-mode architecture, MBM_BMB​ is undetermined because transmission scaling is unspecified.
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples, with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible. This introduces a challenge: how does one design or understand such photonic networks? One must be able to calculate observables using general methods capable of treating arbitrary inputs, dissipation, and noise. We develop complex phase-space software for simulating these photonic networks, and apply this to boson sampling experiments. Our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples. We show that these techniques remove systematic errors in previous algorithms for estimating correlations, with large improvements in errors in some cases. In addition, we obtain a scalable channel-combination strategy for assessment of boson sampling devices.
Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.
Understanding the energetic efficiency of quantum computers is essential for assessing their scalability and for determining whether quantum technologies can outperform classical computation beyond runtime alone. In this work, we analyze the energy required to solve the Boson Sampling problem, a paradigmatic task for quantum advantage, using a realistic photonic quantum computing architecture. Using the Metric-Noise-Resource methodology, we establish a quantitative connection between experimental control parameters, dominant noise processes, and energetic resources through a performance metric tailored to Boson Sampling. We estimate the energy cost per sample and identify operating regimes that optimize energetic efficiency. By comparing the energy consumption of quantum and state-of-the-art classical implementations, we demonstrate the existence of a quantum energetic advantage -- defined as a lower energy cost per sample compared to the best-known classical implementation -- that emerges before the onset of computational advantage, even in regimes where classical algorithms remain faster. Finally, we propose an experimentally feasible Boson Sampling architecture, including a complete noise and loss budget, that enables a near-term observation of quantum energetic advantage.
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process.We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling.In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors.Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable.We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process. We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling. In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors. Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable. We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.
Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For such a demonstration to be meaningful, experimental noise must not affect the computational power of the device; this occurs when a classical algorithm can use the noise to simulate the quantum system. In this work, we demonstrate an algorithm which simulates boson sampling, a quantum advantage demonstration based on many-body quantum interference of indistinguishable bosons, in the presence of optical loss. Finding the level of noise where this approximation becomes efficient lets us map out the maximum level of imperfections at which it is still possible to demonstrate a quantum advantage. We show that current photonic technology falls short of this benchmark. These results call into question the suitability of boson sampling as a quantum advantage demonstration.