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

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

Varun Upreti, Ulysse Chabaud, Zoë Holmes, Armando Angrisani

Published Oct 8, 2025• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2510.07264

Related papers

Resources for Bosonic Quantum Computational Advantage

Ulysse Chabaud, Mattia Walschaers

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.

arXiv:2207.11781•Physical Review Letters•Mar 2, 2023•82 citations

Simulation of noisy quantum circuits using frame representations

Janek Denzler, Jose Carrasco, Jens Eisert +1 more

One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we introduce a unified framework for the classical simulation of quantum circuits based on frame theory, encompassing and generalizing a broad class of existing simulation strategies. Within this framework, the computational cost of a simulation algorithm is determined by the one-norm of an associated quasi-probability distribution, providing a common quantitative measure across different simulation approaches. This enables a comprehensive perspective on common methods for the simulation of noisy circuits based on different quantum resources, such as entanglement or non-stabilizerness. It further provides a clear scheme for generating novel classical simulation algorithms. Indeed, by exploring different choices of frames within this formalism and resorting to tools of convex optimization, we are able not only to obtain new insights and improved bounds for existing methods -- such as stabilizer state simulation or Pauli back-propagation -- but also to discover a new approach with an improved performance based on a generalization of the Pauli frame. We, thereby, show that classical simulation techniques can directly benefit from a perspective -- that of frames -- that goes beyond the traditional classification of quantum resources.

quant-pharXiv:2601.05131•Jan 9, 2026•6 citations

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

Complex Quantum Dynamics Versus Classical Simulability of Noisy Random Circuits

Anjali Waghmare, Sergii Strelchuk, Sathyawageeswar Subramanian

Claims of quantum advantage rest on the classical hardness of simulating quantum circuits. Magic, operator scrambling, anticoncentration, and non-Gaussianity for fermionic circuits are standard diagnostics of complex quantum dynamics. For pure states, some of these have been rigorously connected to classical simulability. Whether these diagnostics reliably track the limits of efficient classical simulation under noise remains unclear. Here, we show that in noisy Clifford+$T$ and nearest-neighbour matchgate+SWAP circuits, dynamical diagnostics and classical simulability can separate in both directions. In particular, the diagnostics can remain nontrivial after classical simulation becomes efficient, or become trivial before known efficient classical algorithms apply. We trace this mismatch to the different statistical properties they probe: magic and scrambling depend on fourth-order statistics of the Pauli spectrum, whereas the simulation algorithms depend primarily on second-order moments, which local noise suppresses at different rates. Thus, dynamical diagnostics measured on a noisy quantum device do not by themselves constitute evidence for classical hardness.

quant-pharXiv:2609.39734•Oct 1, 2026•0 citations

Non-zero noise extrapolation: accurately simulating noisy quantum circuits with tensor networks

Anthony P. Thompson, Soeteman, Arie, Chris Cade +1 more

Understanding the effects of noise on quantum computations is fundamental to the development of quantum hardware and quantum algorithms. Simulation tools are essential for quantitatively modelling these effects, yet unless artificial restrictions are placed on the circuit or noise model, accurately modelling noisy quantum computations is an extremely challenging task due to unfavourable scaling of required computational resources. Tensor network methods offer a viable solution for simulating computations that generate limited entanglement or that have noise models which yield low gate fidelities. However, in the most interesting regime of entangling circuits (with high gate fidelities) relevant for error correction and mitigation tensor network simulations often achieve poor accuracy. In this work we develop and numerically test a method for significantly improving the accuracy of tensor network simulations of noisy quantum circuits in the low-noise (i.e. high gate-fidelity) regime. Our method comes with the advantages that it (i) allows for the simulation of quantum circuits under generic types of noise model, (ii) is especially tailored to the low-noise regime, and (iii) retains the benefits of tensor network scaling, enabling efficient simulations of large numbers of qubits. We build upon the observations that adding extra noise to a quantum circuit makes it easier to simulate with tensor networks, and that the results can later be reliably extrapolated back to the low-noise regime of interest. These observations form the basis for a novel emulation technique that we call non-zero noise extrapolation, in analogy to the quantum error mitigation technique of zero-noise extrapolation.

arXiv:2501.13237•Jan 22, 2025•12 citations

Continuous Noise Model for Quantum Circuits

Yunos El Kaderi, Andreas Honecker, Iryna Andriyanova

Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and irreversible relaxation. This work studies a continuous coherent noise model for quantum circuits and compares it with a discrete Pauli model. The focus is on small, coherent gate errors that accumulate across circuit depth. These errors are modeled as random rotations on the Bloch sphere using a von Mises-Fisher distribution. In the small-angle limit, the model reduces to an isotropic Gaussian distribution. We test the model on quantum error-correction circuits based on the [[5,1,3]] and [[7,1,3]] codes. A variant of Grover's search circuit with different qubit counts is also examined. To enable fair comparison, we introduce a model-independent matching scheme. Pauli and continuous noise channels are aligned using the binary entropy at readout. This isolates the effect of noise structure at fixed uncertainty. An approximate analytical method for the propagation of coherent errors is also developed. The method tracks error distributions both on Clifford and non-Clifford circuits without full Monte Carlo sampling. It reduces simulation cost while preserving accuracy for circuit-level error estimates. The approximation is validated against brute-force simulations, identifying its regime of validity with Clifford and non-Clifford circuits under error correction. Our results show that continuous coherent noise and Pauli noise lead to comparable logical-error trends in the stabilizer-code circuits studied here. This behavior is consistent with syndrome extraction projecting a general single-qubit error onto Pauli-error subspaces before recovery. They also show where simplified propagation models work well and where their accuracy is reduced.

quant-pharXiv:2604.26008•Apr 30, 2026•0 citations
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.
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.
One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we introduce a unified framework for the classical simulation of quantum circuits based on frame theory, encompassing and generalizing a broad class of existing simulation strategies. Within this framework, the computational cost of a simulation algorithm is determined by the one-norm of an associated quasi-probability distribution, providing a common quantitative measure across different simulation approaches. This enables a comprehensive perspective on common methods for the simulation of noisy circuits based on different quantum resources, such as entanglement or non-stabilizerness. It further provides a clear scheme for generating novel classical simulation algorithms. Indeed, by exploring different choices of frames within this formalism and resorting to tools of convex optimization, we are able not only to obtain new insights and improved bounds for existing methods -- such as stabilizer state simulation or Pauli back-propagation -- but also to discover a new approach with an improved performance based on a generalization of the Pauli frame. We, thereby, show that classical simulation techniques can directly benefit from a perspective -- that of frames -- that goes beyond the traditional classification of quantum resources.
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.
Claims of quantum advantage rest on the classical hardness of simulating quantum circuits. Magic, operator scrambling, anticoncentration, and non-Gaussianity for fermionic circuits are standard diagnostics of complex quantum dynamics. For pure states, some of these have been rigorously connected to classical simulability. Whether these diagnostics reliably track the limits of efficient classical simulation under noise remains unclear. Here, we show that in noisy Clifford+TTT and nearest-neighbour matchgate+SWAP circuits, dynamical diagnostics and classical simulability can separate in both directions. In particular, the diagnostics can remain nontrivial after classical simulation becomes efficient, or become trivial before known efficient classical algorithms apply. We trace this mismatch to the different statistical properties they probe: magic and scrambling depend on fourth-order statistics of the Pauli spectrum, whereas the simulation algorithms depend primarily on second-order moments, which local noise suppresses at different rates. Thus, dynamical diagnostics measured on a noisy quantum device do not by themselves constitute evidence for classical hardness.
Understanding the effects of noise on quantum computations is fundamental to the development of quantum hardware and quantum algorithms. Simulation tools are essential for quantitatively modelling these effects, yet unless artificial restrictions are placed on the circuit or noise model, accurately modelling noisy quantum computations is an extremely challenging task due to unfavourable scaling of required computational resources. Tensor network methods offer a viable solution for simulating computations that generate limited entanglement or that have noise models which yield low gate fidelities. However, in the most interesting regime of entangling circuits (with high gate fidelities) relevant for error correction and mitigation tensor network simulations often achieve poor accuracy. In this work we develop and numerically test a method for significantly improving the accuracy of tensor network simulations of noisy quantum circuits in the low-noise (i.e. high gate-fidelity) regime. Our method comes with the advantages that it (i) allows for the simulation of quantum circuits under generic types of noise model, (ii) is especially tailored to the low-noise regime, and (iii) retains the benefits of tensor network scaling, enabling efficient simulations of large numbers of qubits. We build upon the observations that adding extra noise to a quantum circuit makes it easier to simulate with tensor networks, and that the results can later be reliably extrapolated back to the low-noise regime of interest. These observations form the basis for a novel emulation technique that we call non-zero noise extrapolation, in analogy to the quantum error mitigation technique of zero-noise extrapolation.
Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and irreversible relaxation. This work studies a continuous coherent noise model for quantum circuits and compares it with a discrete Pauli model. The focus is on small, coherent gate errors that accumulate across circuit depth. These errors are modeled as random rotations on the Bloch sphere using a von Mises-Fisher distribution. In the small-angle limit, the model reduces to an isotropic Gaussian distribution. We test the model on quantum error-correction circuits based on the [[5,1,3]] and [[7,1,3]] codes. A variant of Grover's search circuit with different qubit counts is also examined. To enable fair comparison, we introduce a model-independent matching scheme. Pauli and continuous noise channels are aligned using the binary entropy at readout. This isolates the effect of noise structure at fixed uncertainty. An approximate analytical method for the propagation of coherent errors is also developed. The method tracks error distributions both on Clifford and non-Clifford circuits without full Monte Carlo sampling. It reduces simulation cost while preserving accuracy for circuit-level error estimates. The approximation is validated against brute-force simulations, identifying its regime of validity with Clifford and non-Clifford circuits under error correction. Our results show that continuous coherent noise and Pauli noise lead to comparable logical-error trends in the stabilizer-code circuits studied here. This behavior is consistent with syndrome extraction projecting a general single-qubit error onto Pauli-error subspaces before recovery. They also show where simplified propagation models work well and where their accuracy is reduced.