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

Conference on Lasers and Electro-Optics

Frequency-Domain Boson Sampling

Chaitali Joshi, Alessandro Farsi, Alexander L. Gaeta

Published Jan 1, 2017• 4 citations
Publisher

Abstract

We present a scheme to efficiently perform boson sampling using frequency modes which yields exponential reduction in losses and significantly reduced experimental complexity compared to conventional spatial-mode implementations.
DOI
10.1364/cleo_qels.2017.ftu1f.1

Related papers

Efficient Boson Sampling Schemes using Dispersion and Pulse Shaping

Mihir Pant, Dirk Englund

We present Boson Sampling schemes in the time-frequency basis that allow for more modes, fewer sources and detectors and are more tolerant to temporal mismatch than Boson Sampling schemes using photons in many spatial modes.

•Jan 1, 2015•0 citations

Driven Boson Sampling

Sonja Barkhofen, Tim J. Bartley, Linda Sansoni +4 more

We present a scheme for Boson-sampling whereby photons are generated within the network of beam splitters. We demonstrate this approach has the required complexity, and is more scalable and less noisy than most existing implementations.

Quantum Information and Measurement (QIM)•Jan 1, 2017•0 citations

Experimental Boson Sampling with integrated photonics

Nicolò Spagnolo, Chiara Vitelli, Marco Bentivegna +8 more

We implement the boson sampling problem by studying 3-photon interference in integrated interferometers with up to 9 modes. By using the input of the problem we efficiently distinguish the output from the uniform distribution.

Research in Optical Sciences•Jan 1, 2014•0 citations

Classical boson sampling algorithms with superior performance to near-term experiments

Alex Neville, Chris Sparrow, Raphaël Clifford A +4 more

arXiv:1705.00686•Nature Physics•Oct 2, 2017•179 citations

Quantum advantage in learning single mode bosonic channels

Angela Anna Baiju, Aritra Das, Özlem Erkılıç +7 more

Quantum resources can dramatically reduce the data required to learn physical systems, with exponential improvements in sample complexity demonstrated in several quantum learning tasks. However, these advantages have typically relied on quantum resources that scale with problem complexity, most notably increasing system dimension or entanglement. This raises a fundamental question: can exponential quantum learning advantages arise within a fixed, unentangled quantum system? In this paper, we address this question by considering the learning of an unknown random-displacement distribution whose complexity is determined not by the dimensionality of the physical system, but by the Fourier resolution of its features. We show that the quantum-limited noise of vacuum probes progressively obscures high-frequency features, leading to an exponential growth in sample complexity. We establish an information-theoretic lower bound for arbitrary classical-state probes and show that squeezing overcomes this classical limit by extending the accessible Fourier bandwidth. Experimentally, we demonstrate an exponential reduction in sample complexity using squeezed vacuum probes for both binary hypothesis testing and characteristic-function reconstruction. Our results show that a single bosonic mode can exhibit exponential quantum learning advantages without entanglement or an increase in system size, identifying accessible Fourier bandwidth as a fundamentally distinct resource for quantum-enhanced learning.

quant-pharXiv:2609.30374•Sep 28, 2026•0 citations

Entanglement-Enabled Advantage for Learning a Bosonic Random Displacement Channel

Changhun Oh, Senrui Chen, Yat Wong +8 more

We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable (CV) system. The task we consider is estimating a probabilistic mixture of displacement operators acting on n bosonic modes, called a random displacement channel. We prove that if the n modes are not entangled with an ancillary quantum memory, then the channel must be sampled a number of times exponential in n in order to estimate its characteristic function to reasonable precision; this lower bound on sample complexity applies even if the channel inputs and measurements performed on channel outputs are chosen adaptively or have unrestricted energy. On the other hand, we present a simple entanglement-assisted scheme that only requires a number of samples independent of n in the large squeezing and noiseless limit. This establishes an exponential separation in sample complexity. We then analyze the effect of photon loss and show that the entanglement-assisted scheme is still significantly more efficient than any lossless entanglement-free scheme under mild experimental conditions. Our work illuminates the role of entanglement in learning CV systems and points toward experimentally feasible demonstrations of provable entanglement-enabled advantage using CV quantum platforms.

arXiv:2402.18809•Physical Review Letters•Dec 6, 2024•18 citations
Quantum resources can dramatically reduce the data required to learn physical systems, with exponential improvements in sample complexity demonstrated in several quantum learning tasks. However, these advantages have typically relied on quantum resources that scale with problem complexity, most notably increasing system dimension or entanglement. This raises a fundamental question: can exponential quantum learning advantages arise within a fixed, unentangled quantum system? In this paper, we address this question by considering the learning of an unknown random-displacement distribution whose complexity is determined not by the dimensionality of the physical system, but by the Fourier resolution of its features. We show that the quantum-limited noise of vacuum probes progressively obscures high-frequency features, leading to an exponential growth in sample complexity. We establish an information-theoretic lower bound for arbitrary classical-state probes and show that squeezing overcomes this classical limit by extending the accessible Fourier bandwidth. Experimentally, we demonstrate an exponential reduction in sample complexity using squeezed vacuum probes for both binary hypothesis testing and characteristic-function reconstruction. Our results show that a single bosonic mode can exhibit exponential quantum learning advantages without entanglement or an increase in system size, identifying accessible Fourier bandwidth as a fundamentally distinct resource for quantum-enhanced learning.
We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable (CV) system. The task we consider is estimating a probabilistic mixture of displacement operators acting on n bosonic modes, called a random displacement channel. We prove that if the n modes are not entangled with an ancillary quantum memory, then the channel must be sampled a number of times exponential in n in order to estimate its characteristic function to reasonable precision; this lower bound on sample complexity applies even if the channel inputs and measurements performed on channel outputs are chosen adaptively or have unrestricted energy. On the other hand, we present a simple entanglement-assisted scheme that only requires a number of samples independent of n in the large squeezing and noiseless limit. This establishes an exponential separation in sample complexity. We then analyze the effect of photon loss and show that the entanglement-assisted scheme is still significantly more efficient than any lossless entanglement-free scheme under mild experimental conditions. Our work illuminates the role of entanglement in learning CV systems and points toward experimentally feasible demonstrations of provable entanglement-enabled advantage using CV quantum platforms.