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:2207.11781 · Physical Review Letters

Resources for Bosonic Quantum Computational Advantage

Ulysse Chabaud, Mattia Walschaers

Published Mar 2, 2023• 82 citations
arXivHTMLPDF

Abstract

Quantum computers promise to dramatically outperform their classical counterparts. However, the nonclassical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this Letter, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity, and entanglement.

DOI
10.1103/physrevlett.130.090602

Related papers

Interplay of resources for universal continuous-variable quantum computing

Varun Upreti, Ulysse Chabaud

Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of continuous-variable quantum computing, and their interplay enabling computational universality. Specifically, we uncover a new property in continuous-variable circuits, analogous to coherence in discrete-variable systems, termed , defined as the ability of Gaussian gates to mix position and momentum operators. Using quadrature propagation across multiple computational paths, we develop an efficient classical simulation algorithm for continuous-variable computations with symplectic coherence constant in the size of the circuit. This establishes symplectic coherence as a necessary resource for universality in continuous-variable quantum computing, alongside non-Gaussianity and entanglement. Via the Gottesman-Kitaev-Preskill encoding, we show that the interplay of these three continuous-variable quantum resources mirrors the discrete-variable relationship between coherence, magic, and entanglement.

arXiv:2502.07670•Physical Review Research•Jun 26, 2026•13 citations

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits

Varun Upreti, Ulysse Chabaud, Zoë Holmes +1 more

Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits are more challenging to simulate and analyze. Here, we address this gap by introducing the $\textit{displacement propagation}$ algorithm, a continuous-variable analogue of Pauli propagation for simulating noisy bosonic circuits. By exploring the interplay of noise and quantum resources, we identify several computational phase transitions, revealing regimes where even modest noise levels render bosonic circuits efficiently classically simulable. In particular, our analysis reveals a surprising phenomenon: computational resources usually associated with bosonic quantum advantage, namely non-Gaussianity and symplectic coherence, can make the system easier to classically simulate in presence of noise.

arXiv:2510.07264•Oct 8, 2025•7 citations

Beyond boson sampling: higher spin sampling as a practical path to quantum supremacy

Chon‐Fai Kam, En-Jui Kuo

Abstract Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor’s algorithm, while renowned, has not been realized at a scale to outperform classical methods. In contrast, Fock-state boson sampling has been theoretically established, under standard complexity-theoretic assumptions, as a promising route toward quantum computational advantage. However, most existing experimental realizations of boson sampling to date have been based on Gaussian boson sampling, in which the input states consist of squeezed states of light. In this work, we introduce a higher-spin ( S ) sampling framework and show that it provides a practical path toward quantum computational advantage. We derive a quasi-linear scaling relation between the number of sites m and the number of spins n , namely m ~ n 1+ ϵ , where ϵ = 3/(2 S ) decreases with increasing spin quantum number. This suggests that, within a spin system, Fock-state boson sampling can be implemented in a quasi-linear mode regime ( m = Ω ( n 1+ ϵ )), significantly reducing experimental resource requirements.

arXiv:2505.07312•npj Quantum Information•Apr 17, 2026•2 citations

Variational tensor network simulation of Gaussian boson sampling and beyond

Jonas Vinther, Michael J. Kastoryano

The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical simulations, it has been suggested that the addition of non-linear elements to the experiment will help retain the quantum advantage. We propose a classical simulation tool for general continuous variable sampling problems, including Gaussian Boson Sampling and beyond. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. This allows us to employ powerful variational methods based on tensor networks and to read off the simulation error directly from the expectation value of the Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art. We also consider a non-Gaussian sampling problem, for which we develop novel local basis optimization techniques based on a non-linear parameterization of the implicit basis, resulting in high effective cutoffs with diminished computational overhead.

arXiv:2410.18740•Physical Review A•Jul 7, 2025•2 citations

Quantum information processing: quantum advantage and information recovery

Gabriele Bressanini

Quantum computing holds the promise of enabling algorithms that are beyond the reach of classical computation, hence demonstrating quantum computational advantage. However, current quantum devices face significant limitations, primarily due to the lack of error correction. In this context, the following question arises: can quantum computational advantage be demonstrated with today's noisy hardware? Recently, Gaussian boson sampling (GBS) has emerged as a leading candidate to achieve this milestone, due to its relative experimental feasibility. The first part of this thesis focuses on two central challenges associated with GBS. The first one is the impact of noise on the computational complexity of the task. Using a phase-space approach, we establish a necessary non-classicality condition that any experimental proof of quantum advantage must satisfy, and demonstrate that there exists a threshold temperature at which quantum sampling experiments become classically simulable. We then investigate the possibility of introducing higher-order non-linearities as a mean to enhance the protocol’s robustness against noise. Then, we turn our attention to the problem of validating a GBS experiment, and propose the use binned-detector probability distributions as a suitable quantity to perform efficient statistical validation. In the second part of the thesis, we present a novel approach to protect a quantum observable from a given noise model.We start by introducing the concept of quantum observables over time, an operator that jointly describes two observables at two distinct time points, and use the latter to establish a notion of time-reversal for non-unitary quantum channels with respect to a reference observable, enabling the systematic construction of recovery maps that preserve the latter. These recovery maps, although generally non-physical, can still be used in noiseless expectation value estimation tasks and can achieve optimal performance in terms of sampling overhead, outperforming known error mitigation protocols.

•Jan 17, 2025•0 citations

Efficient verification of Boson Sampling

Ulysse Chabaud, Frédéric Grosshans, Elham Kashefi +1 more

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping the regime of classical simulation, they still lack efficient verification protocols and rely on partial validation. Here we derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a large class of continuous-variable quantum circuits demonstrating quantum speedup, including Boson Sampling experiments, thus enabling a convincing demonstration of quantum speedup with photonic computing. Beyond the quantum speedup milestone, our results also enable the efficient and reliable certification of a large class of intractable continuous-variable multimode quantum states.

arXiv:2006.03520•Quantum•Nov 15, 2021•43 citations
Quantum computers promise to dramatically outperform their classical counterparts. However, the nonclassical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this Letter, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity, and entanglement.
Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of continuous-variable quantum computing, and their interplay enabling computational universality. Specifically, we uncover a new property in continuous-variable circuits, analogous to coherence in discrete-variable systems, termed , defined as the ability of Gaussian gates to mix position and momentum operators. Using quadrature propagation across multiple computational paths, we develop an efficient classical simulation algorithm for continuous-variable computations with symplectic coherence constant in the size of the circuit. This establishes symplectic coherence as a necessary resource for universality in continuous-variable quantum computing, alongside non-Gaussianity and entanglement. Via the Gottesman-Kitaev-Preskill encoding, we show that the interplay of these three continuous-variable quantum resources mirrors the discrete-variable relationship between coherence, magic, and entanglement.
Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits are more challenging to simulate and analyze. Here, we address this gap by introducing the displacement propagation\textit{displacement propagation}displacement propagation algorithm, a continuous-variable analogue of Pauli propagation for simulating noisy bosonic circuits. By exploring the interplay of noise and quantum resources, we identify several computational phase transitions, revealing regimes where even modest noise levels render bosonic circuits efficiently classically simulable. In particular, our analysis reveals a surprising phenomenon: computational resources usually associated with bosonic quantum advantage, namely non-Gaussianity and symplectic coherence, can make the system easier to classically simulate in presence of noise.
Abstract Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor’s algorithm, while renowned, has not been realized at a scale to outperform classical methods. In contrast, Fock-state boson sampling has been theoretically established, under standard complexity-theoretic assumptions, as a promising route toward quantum computational advantage. However, most existing experimental realizations of boson sampling to date have been based on Gaussian boson sampling, in which the input states consist of squeezed states of light. In this work, we introduce a higher-spin ( S ) sampling framework and show that it provides a practical path toward quantum computational advantage. We derive a quasi-linear scaling relation between the number of sites m and the number of spins n , namely m ~ n 1+ ϵ , where ϵ = 3/(2 S ) decreases with increasing spin quantum number. This suggests that, within a spin system, Fock-state boson sampling can be implemented in a quasi-linear mode regime ( m = Ω ( n 1+ ϵ )), significantly reducing experimental resource requirements.
The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical simulations, it has been suggested that the addition of non-linear elements to the experiment will help retain the quantum advantage. We propose a classical simulation tool for general continuous variable sampling problems, including Gaussian Boson Sampling and beyond. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. This allows us to employ powerful variational methods based on tensor networks and to read off the simulation error directly from the expectation value of the Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art. We also consider a non-Gaussian sampling problem, for which we develop novel local basis optimization techniques based on a non-linear parameterization of the implicit basis, resulting in high effective cutoffs with diminished computational overhead.
Quantum computing holds the promise of enabling algorithms that are beyond the reach of classical computation, hence demonstrating quantum computational advantage. However, current quantum devices face significant limitations, primarily due to the lack of error correction. In this context, the following question arises: can quantum computational advantage be demonstrated with today's noisy hardware? Recently, Gaussian boson sampling (GBS) has emerged as a leading candidate to achieve this milestone, due to its relative experimental feasibility. The first part of this thesis focuses on two central challenges associated with GBS. The first one is the impact of noise on the computational complexity of the task. Using a phase-space approach, we establish a necessary non-classicality condition that any experimental proof of quantum advantage must satisfy, and demonstrate that there exists a threshold temperature at which quantum sampling experiments become classically simulable. We then investigate the possibility of introducing higher-order non-linearities as a mean to enhance the protocol’s robustness against noise. Then, we turn our attention to the problem of validating a GBS experiment, and propose the use binned-detector probability distributions as a suitable quantity to perform efficient statistical validation. In the second part of the thesis, we present a novel approach to protect a quantum observable from a given noise model.We start by introducing the concept of quantum observables over time, an operator that jointly describes two observables at two distinct time points, and use the latter to establish a notion of time-reversal for non-unitary quantum channels with respect to a reference observable, enabling the systematic construction of recovery maps that preserve the latter. These recovery maps, although generally non-physical, can still be used in noiseless expectation value estimation tasks and can achieve optimal performance in terms of sampling overhead, outperforming known error mitigation protocols.
The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping the regime of classical simulation, they still lack efficient verification protocols and rely on partial validation. Here we derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a large class of continuous-variable quantum circuits demonstrating quantum speedup, including Boson Sampling experiments, thus enabling a convincing demonstration of quantum speedup with photonic computing. Beyond the quantum speedup milestone, our results also enable the efficient and reliable certification of a large class of intractable continuous-variable multimode quantum states.