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:2609.30374

Quantum advantage in learning single mode bosonic channels

Angela Anna Baiju, Aritra Das, Özlem Erkılıç, Jiayi Qin, Li Gong, Syed M Assad, Ping Koy Lam, Biveen Shajilal, Lorcán O Conlon, Jie Zhao

quant-phSubmitted Sep 24, 2026• Announced Sep 28, 2026• 2 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether exponential sample-complexity advantages can arise without entanglement or increasing the number of bosonic modes. It studies a single-mode, single-quadrature random-displacement channel, distinguishing a Gaussian displacement distribution from the same Gaussian modulated by $1+4\epsilon_0\sin(2\beta_0x)$. Increasing $\beta_0$ introduces finer structure without changing the second moment. For Gaussian probes followed by homodyne detection, quantum noise convolves the displacement distribution. An unbiased characteristic-function estimator has variance bounded by $N^{-1}e^{4a\beta^2}$, where $a=1$ for vacuum and $a=e^{-2r}$ for ideal squeezed vacuum. A log-likelihood test achieves discrimination complexity proportional to $\epsilon_0^{-2}\exp[4a\beta_0^2/(1+4a\sigma_\beta^2)]$. A sandwiched-Rényi-divergence calculation establishes an arbitrary-collective-measurement lower bound for parallel positive-$P$ classical probes: $N=\Omega(\exp[\beta_0^2\sigma_\beta^{-2}(1-(1+4\sigma_\beta^2)^{-1/2})])$. Sufficient fixed squeezing beats this bound exponentially; ideal squeezing growing as $r=\ln(2\beta_0)$ gives constant-sample discrimination. An optical implementation uses 4.95–8.54 dB squeezing and homodyne detection. At $\beta_0=4.5$, discrimination requires approximately $10^4$ squeezed-probe samples versus $10^7$ vacuum-probe samples. The reported advantage over the arbitrary-measurement classical lower bound is approximately tenfold. Reconstruction comparisons reach eight orders of magnitude, with large vacuum requirements inferred beyond available data. The setting is restricted to structured one-quadrature distributions. Experimental reconstruction tests 25 frequencies rather than continuous uniform accuracy; the displayed Hoeffding derivation controls an endpoint component. Loss imposes a noise floor, and noise-calibration errors are exponentially amplified at high frequencies. Constant-sample scaling assumes increasing ideal squeezing, not fixed energy.

Some signs of AI-generated textOverclaimsPossible error

Error found: The paper does not establish its continuum-uniform reconstruction upper bound or the corresponding constant-sample corollary, because its concentration calculation controls only one component at one frequency. The claim that the classical lower bound covers arbitrary adaptive channel-use strategies is broader than the supplied proof, which covers parallel classical inputs and collective output measurements. The reported eight-order reconstruction advantage compares squeezed-probe measurements with an unmeasured vacuum baseline at the quoted bandwidth, despite being described as directly demonstrated experimentally.

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

Comments
9 pages, comments and suggestions very welcome

Related papers

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•31 citations

On the fundamental resource for exponential advantage in quantum channel learning

Minsoo Kim, Changhun Oh

Quantum resources enable us to achieve an exponential advantage in learning the properties of unknown physical systems by employing quantum memory. While entanglement with quantum memory is recognized as a necessary qualitative resource, its quantitative role remains less understood. In this work, we distinguish between two fundamental resources provided by quantum memory—entanglement and ancilla qubits—and analyze their separate contributions to the sampling complexity of quantum learning. Focusing on the task of Pauli channel learning, a prototypical example of quantum channel learning, remarkably, we prove that vanishingly small entanglement in the input state already suffices to accomplish the learning task with only a polynomial number of channel queries in the number of qubits. In contrast, we show that without a sufficient number of ancilla qubits, even learning partial information about the channel demands an exponentially large sample complexity. Thus, our findings reveal that while a large amount of entanglement is not necessary, the dimension of the quantum memory is a crucial resource. Hence, by identifying how the two resources contribute differently, our work offers deeper insight into the nature of the quantum learning advantage. While it is known that entanglement plays a role in learning the properties of unknown physical systems, the detailed quantitative dependence is unclear. Here, the authors investigate the fundamental resources behind quantum advantage in channel learning, revealing that while extensive entanglement is unnecessary, the number of ancilla qubits is crucial.

arXiv:2507.11089•Nature Communications•Jan 20, 2026•3 citations

Exponential Quantum Advantage in Stationary Signal Sensing

Sojeong Park, Changhun Oh

Sensing time-varying signals is essential for precision measurement and for characterizing fluctuations in physical systems. In this work, we show that quantum entanglement provides an exponential advantage in the acquisition time required to learn the temporal statistics of a stationary classical signal. The task is to estimate the characteristic function of joint displacements on selected bosonic modes within a fixed-duration window, using continuous measurements of one signal realization. We present an entanglement-assisted scheme based on two-mode squeezed probes and local Bell measurements with protected idlers, and bound its acquisition time accounting for readout noise and correlations between signal windows. For a strictly stationary pulse family, it achieves polynomial acquisition time at inverse-polynomial accuracy with logarithmic squeezing and polynomial photon number. On the other hand, we prove that any local idler-free protocols require acquisition time exponential in the number of selected temporal modes per window. This lower bound holds for both sequentially prepared and arbitrarily temporally entangled probes, allowing non-Gaussian inputs and measurements and causal classical feedback, as long as each output is measured destructively within its time bin. These results establish an exponential quantum learning advantage for a single continuously monitored stationary signal, with the sensing cost measured by total acquisition time.

quant-pharXiv:2610.14424•Oct 13, 2026•0 citations

Exponential quantum advantage for learning signals with a single qubit

Ishaan Kannan, Sridhar Prabhu, Saeed A. Khan +7 more

Quantum technology has the potential to transform scientific discovery, but quantum advantages often require processing capabilities well beyond the reach of experimental platforms. We show that coupling a single controllable qubit to an otherwise conventional sensor can exponentially reduce the number of measurements required to learn classical signals. These rigorous quantum advantages apply to fundamental sensing tasks, including learning Fourier coefficients, extracting temporal correlations from time-varying signals, and estimating transformations of physical observables. Using a superconducting cavity--qubit architecture, we experimentally demonstrate $10^7$-fold reductions in the number of measurements required for Fourier-amplitude and time-varying signal learning. Our $\textit{quantum feature sensing}$ algorithms further enable orders-of-magnitude improvements in simulations of weak-signal dark matter detection and wireless communication applications. These quantum advantages are derived from Quantum Phase-Space Inference (Q$Ψ$), a unifying theory of quantum-enhanced experiments that simultaneously converts a set of experimental objectives and constraints into tight lower bounds and optimal quantum-enhanced learning algorithms while producing a certificate of quantum advantage. Q$Ψ$ extends beyond the regimes captured by quantum Fisher information and provides a framework for systematically identifying rigorous quantum advantages in practical experimental tasks. Together, our results establish that near-term quantum technology can exponentially enhance our ability to learn from classical signals.

quant-pharXiv:2608.13521•Aug 14, 2026•7 citations

Exponential advantage in continuous-variable quantum state learning

Eugen Coroi, Changhun Oh

We study how entangled measurements, reflected states, and input-state classicality determine the sample complexity of learning bosonic continuous-variable quantum states through their characteristic function. We first analyze a simple entanglement-free protocol and show that its sample complexity is exponential in the number of modes n for general inputs. We then prove that this exponential scaling is intrinsic through three complementary lower bounds: one excluding entangled measurements, one for reflection-symmetric inputs, and one excluding reflected states even when entangled measurements on finitely many copies are allowed. Next, we show that the classicality parameter s max quantitatively determines when this barrier can be softened: positive classicality can reduce the entanglement-free sample cost, and for fully classical states heterodyne learning matches the ϵ -scaling of a Bell-measurement (BM) scheme. Finally, combining reflected states with a two-copy entangled measurement yields sample complexity independent of n . These results identify when entanglement-free strategies already suffice and when, within the resource models analyzed here, efficient continuous-variable state learning requires the full BM resource combination of entangled measurements and reflected-state access.

arXiv:2501.17633•npj Quantum Information•Oct 12, 2026•11 citations

Bound Entanglement Is Insufficient for an Exponential Quantum Learning Advantage

Hyeongu Kang, Sangwoo Jeon, Changhun Oh

While entanglement is known to enable exponential improvements in the sample complexity of quantum learning, it remains unclear which properties of entangled resources are responsible for such improvements. We address this question through the reduction criterion, a condition obeyed by all bound-entangled states. In $n$-qubit Pauli-channel learning, we show that restricting either the input states or the measurement effects to satisfy this criterion rules out an exponential advantage for incoherent adaptive protocols. An exponential lower bound persists for the one-sided coherent adaptive protocols considered here, even when the unrestricted side retains quantum correlations across channel uses. Using conditional min-entropy, we further quantify how the sample-complexity lower bounds weaken as larger violations of the reduction criterion are allowed. Finally, we show that the same obstruction appears in conjugate-state learning: restricted joint measurements cannot reproduce the logarithmic-sample advantage of unrestricted joint measurements on $ρ\otimesρ^*$. These results identify violation of the reduction criterion as a necessary condition for an exponential advantage in the learning tasks considered here.

quant-pharXiv:2607.19017•Jul 22, 2026•1 citation
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.
The paper asks whether exponential sample-complexity advantages can arise without entanglement or increasing the number of bosonic modes. It studies a single-mode, single-quadrature random-displacement channel, distinguishing a Gaussian displacement distribution from the same Gaussian modulated by 1+4ϵ0sin⁡(2β0x)1+4\epsilon_0\sin(2\beta_0x)1+4ϵ0​sin(2β0​x). Increasing β0\beta_0β0​ introduces finer structure without changing the second moment.
For Gaussian probes followed by homodyne detection, quantum noise convolves the displacement distribution. An unbiased characteristic-function estimator has variance bounded by N−1e4aβ2N^{-1}e^{4a\beta^2}N−1e4aβ2, where a=1a=1a=1 for vacuum and a=e−2ra=e^{-2r}a=e−2r for ideal squeezed vacuum. A log-likelihood test achieves discrimination complexity proportional to ϵ0−2exp⁡[4aβ02/(1+4aσβ2)]\epsilon_0^{-2}\exp[4a\beta_0^2/(1+4a\sigma_\beta^2)]ϵ0−2​exp[4aβ02​/(1+4aσβ2​)]. A sandwiched-Rényi-divergence calculation establishes an arbitrary-collective-measurement lower bound for parallel positive-PPP classical probes: N=Ω(exp⁡[β02σβ−2(1−(1+4σβ2)−1/2)])N=\Omega(\exp[\beta_0^2\sigma_\beta^{-2}(1-(1+4\sigma_\beta^2)^{-1/2})])N=Ω(exp[β02​σβ−2​(1−(1+4σβ2​)−1/2)]). Sufficient fixed squeezing beats this bound exponentially; ideal squeezing growing as r=ln⁡(2β0)r=\ln(2\beta_0)r=ln(2β0​) gives constant-sample discrimination.
An optical implementation uses 4.95–8.54 dB squeezing and homodyne detection. At β0=4.5\beta_0=4.5β0​=4.5, discrimination requires approximately 10410^4104 squeezed-probe samples versus 10710^7107 vacuum-probe samples. The reported advantage over the arbitrary-measurement classical lower bound is approximately tenfold. Reconstruction comparisons reach eight orders of magnitude, with large vacuum requirements inferred beyond available data.
The setting is restricted to structured one-quadrature distributions. Experimental reconstruction tests 25 frequencies rather than continuous uniform accuracy; the displayed Hoeffding derivation controls an endpoint component. Loss imposes a noise floor, and noise-calibration errors are exponentially amplified at high frequencies. Constant-sample scaling assumes increasing ideal squeezing, not fixed energy.
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.
Quantum resources enable us to achieve an exponential advantage in learning the properties of unknown physical systems by employing quantum memory. While entanglement with quantum memory is recognized as a necessary qualitative resource, its quantitative role remains less understood. In this work, we distinguish between two fundamental resources provided by quantum memory—entanglement and ancilla qubits—and analyze their separate contributions to the sampling complexity of quantum learning. Focusing on the task of Pauli channel learning, a prototypical example of quantum channel learning, remarkably, we prove that vanishingly small entanglement in the input state already suffices to accomplish the learning task with only a polynomial number of channel queries in the number of qubits. In contrast, we show that without a sufficient number of ancilla qubits, even learning partial information about the channel demands an exponentially large sample complexity. Thus, our findings reveal that while a large amount of entanglement is not necessary, the dimension of the quantum memory is a crucial resource. Hence, by identifying how the two resources contribute differently, our work offers deeper insight into the nature of the quantum learning advantage. While it is known that entanglement plays a role in learning the properties of unknown physical systems, the detailed quantitative dependence is unclear. Here, the authors investigate the fundamental resources behind quantum advantage in channel learning, revealing that while extensive entanglement is unnecessary, the number of ancilla qubits is crucial.
Sensing time-varying signals is essential for precision measurement and for characterizing fluctuations in physical systems. In this work, we show that quantum entanglement provides an exponential advantage in the acquisition time required to learn the temporal statistics of a stationary classical signal. The task is to estimate the characteristic function of joint displacements on selected bosonic modes within a fixed-duration window, using continuous measurements of one signal realization. We present an entanglement-assisted scheme based on two-mode squeezed probes and local Bell measurements with protected idlers, and bound its acquisition time accounting for readout noise and correlations between signal windows. For a strictly stationary pulse family, it achieves polynomial acquisition time at inverse-polynomial accuracy with logarithmic squeezing and polynomial photon number. On the other hand, we prove that any local idler-free protocols require acquisition time exponential in the number of selected temporal modes per window. This lower bound holds for both sequentially prepared and arbitrarily temporally entangled probes, allowing non-Gaussian inputs and measurements and causal classical feedback, as long as each output is measured destructively within its time bin. These results establish an exponential quantum learning advantage for a single continuously monitored stationary signal, with the sensing cost measured by total acquisition time.
Quantum technology has the potential to transform scientific discovery, but quantum advantages often require processing capabilities well beyond the reach of experimental platforms. We show that coupling a single controllable qubit to an otherwise conventional sensor can exponentially reduce the number of measurements required to learn classical signals. These rigorous quantum advantages apply to fundamental sensing tasks, including learning Fourier coefficients, extracting temporal correlations from time-varying signals, and estimating transformations of physical observables. Using a superconducting cavity--qubit architecture, we experimentally demonstrate 10710^7107-fold reductions in the number of measurements required for Fourier-amplitude and time-varying signal learning. Our quantum feature sensing\textit{quantum feature sensing}quantum feature sensing algorithms further enable orders-of-magnitude improvements in simulations of weak-signal dark matter detection and wireless communication applications. These quantum advantages are derived from Quantum Phase-Space Inference (QΨΨΨ), a unifying theory of quantum-enhanced experiments that simultaneously converts a set of experimental objectives and constraints into tight lower bounds and optimal quantum-enhanced learning algorithms while producing a certificate of quantum advantage. QΨΨΨ extends beyond the regimes captured by quantum Fisher information and provides a framework for systematically identifying rigorous quantum advantages in practical experimental tasks. Together, our results establish that near-term quantum technology can exponentially enhance our ability to learn from classical signals.
We study how entangled measurements, reflected states, and input-state classicality determine the sample complexity of learning bosonic continuous-variable quantum states through their characteristic function. We first analyze a simple entanglement-free protocol and show that its sample complexity is exponential in the number of modes n for general inputs. We then prove that this exponential scaling is intrinsic through three complementary lower bounds: one excluding entangled measurements, one for reflection-symmetric inputs, and one excluding reflected states even when entangled measurements on finitely many copies are allowed. Next, we show that the classicality parameter s max quantitatively determines when this barrier can be softened: positive classicality can reduce the entanglement-free sample cost, and for fully classical states heterodyne learning matches the ϵ -scaling of a Bell-measurement (BM) scheme. Finally, combining reflected states with a two-copy entangled measurement yields sample complexity independent of n . These results identify when entanglement-free strategies already suffice and when, within the resource models analyzed here, efficient continuous-variable state learning requires the full BM resource combination of entangled measurements and reflected-state access.
While entanglement is known to enable exponential improvements in the sample complexity of quantum learning, it remains unclear which properties of entangled resources are responsible for such improvements. We address this question through the reduction criterion, a condition obeyed by all bound-entangled states. In nnn-qubit Pauli-channel learning, we show that restricting either the input states or the measurement effects to satisfy this criterion rules out an exponential advantage for incoherent adaptive protocols. An exponential lower bound persists for the one-sided coherent adaptive protocols considered here, even when the unrestricted side retains quantum correlations across channel uses. Using conditional min-entropy, we further quantify how the sample-complexity lower bounds weaken as larger violations of the reduction criterion are allowed. Finally, we show that the same obstruction appears in conjugate-state learning: restricted joint measurements cannot reproduce the logarithmic-sample advantage of unrestricted joint measurements on ρ⊗ρ∗ρ\otimesρ^*ρ⊗ρ∗. These results identify violation of the reduction criterion as a necessary condition for an exponential advantage in the learning tasks considered here.