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:2010.14363 · Physical Review Research

Classical simulation of Gaussian quantum circuits with non-Gaussian input states

Ulysse Chabaud, Giulia Ferrini, Frédéric Grosshans, Damian Markham

Published Jul 6, 2021• 47 citations
arXivHTMLPDF

Abstract

We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.

DOI
10.1103/physrevresearch.3.033018

Related papers

Assessing non-Gaussian quantum state conversion with the stellar rank

Oliver Hahn, Maxime Garnier, Giulia Ferrini +2 more

State conversion is a fundamental task in quantum information processing. Quantum resource theories allow for analyzing and bounding conversions that use restricted sets of operations. In the context of continuous-variable systems, state conversions restricted to Gaussian operations are crucial for both fundamental and practical reasons, particularly in state preparation and quantum computing with bosonic codes. However, previous analysis did not consider the relevant case of approximate state conversion. In this work, we introduce a framework for assessing approximate Gaussian state conversion by extending the stellar rank to the approximate stellar rank, which serves as an operational measure of non-Gaussianity. We derive bounds for Gaussian state conversion and distillation under approximate and probabilistic conditions, yielding new no-go results for non-Gaussian state preparation and enabling a reliable assessment of the performance of Gaussian conversion protocols. We also provide an open-source Python library to compute stellar-rank-related quantities and to assess Gaussian conversion.

arXiv:2410.23721•Quantum•May 5, 2026•12 citations

Optimal and improved gate decompositions for accelerated classical simulation of near-Gaussian fermionic circuits

Beatriz Dias, Jan Lukas Bosse, James R. Seddon

Fermionic Gaussian circuits can be simulated efficiently on a classical computer, but become universal when supplemented with non-Gaussian operations. Similar to stabilizer circuits augmented with non-stabilizer resources, these non-Gaussian circuits can be simulated classically using rank- or extent-based methods. These methods decompose non-Gaussian states or operations into Gaussian ones, with runtimes that scale polynomially with measures of non-Gaussianity such as the rank and the extent -- quantities that typically grow exponentially with the number of non-Gaussian resources. Current fermionic rank- and extent-based simulators have mostly been limited to Gaussian circuits with magic-state injection. Extending them to mixed states and non-unitary channels has been hindered by the lack of known extent-optimized decompositions for physically relevant gates and noisy channels. In this work, we address this gap. First, we derive analytic decompositions for key non-Gaussian gates and channels, including decompositions for arbitrary two-qubit fermionic gates which are provably optimal for diagonal gates or those acting on Jordan-Wigner-adjacent qubit pairs. Second, we show that stochastic Pauli noise can reduce the effective extent of non-Gaussian rotation gates, but that fermionic magic is substantially more robust to such noise than stabilizer magic. Finally, we demonstrate how these decompositions can accelerate classical sampling from the output distribution of a quantum circuit. This involves a generalization of existing sparsification methods, previously limited to convex-unitary channels, to circuits involving intermediate measurements and feed-forward. Our decompositions also yield speedups for emulating noisy Pauli rotations with quasiprobability simulators in the large-angle/arbitrary-strength-noise and small-angle/low-noise parameter regimes.

quant-pharXiv:2603.18869•Mar 20, 2026•7 citations

Functional matrix product state simulation of continuous variable quantum circuits

Andreas Bock Michelsen, Frederik K. Marqversen, Michael J. Kastoryano

We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form. By addressing scaling bottlenecks, FMPS enables more efficient simulation of shallow, multi-mode CV quantum circuits with non-Gaussian input states. The method is validated by simulating random shallow and cascaded circuits with highly non-Gaussian input states, showing superior performance compared to existing techniques, also in the presence of loss.

arXiv:2504.05860•Apr 8, 2025•5 citations

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

Efficient Simulation of Hybrid Continuous- and Discrete-Variable Quantum Circuits via Gaussian Decompositions

Kazufumi Tanji, Dot Belin Pio, Shohei Kiryu +2 more

Hybrid quantum systems combining discrete-variable (DV) and continuous-variable (CV) subsystems arise across a broad range of physical platforms and enable quantum information processing beyond purely qubit-based designs. Their classical simulation, however, is challenging since computational costs of both CV and DV systems exponentially increase. In this paper, we introduce a simulation framework for CV--DV hybrid systems based on linear combination of Gaussian (LCoG) decomposition. We decompose the hybrid density matrix into blocks in a DV basis and represent each block as an LCoG expansion. Within the representation, Gaussian operations on the bosonic subsystem independently act on each Gaussian function. We derive analytic formulas describing how complex Gaussian functions transform under controlled Gaussian operations. We further extend the framework to controlled Gaussian channels with state-dependent Gaussian noise. The method avoids a Fock-space truncation for the CV subsystem, and the cost of updating each Gaussian term scales polynomially with the number of modes. The framework provides a general computational tool for analyzing hybrid quantum algorithms, quantum simulation protocols, and non-Gaussian state generation schemes. As an example, we simulate Gottesman--Kitaev--Preskill (GKP) state generation based on a cavity-QED system.

quant-pharXiv:2609.34793•Sep 29, 2026•0 citations

Classical simulation and quantum resource theory of non-Gaussian optics

Oliver Hahn, Ryuji Takagi, Giulia Ferrini +1 more

We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation algorithm, which costs quadratically with the number of Gaussian states required to represent the initial state, and an approximate simulation algorithm, which costs linearly with the l 1 norm of the coefficients associated with the superposition. We define measures of non-Gaussianity quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decompositions for states relevant to continuous-variable quantum computing.

arXiv:2404.07115•Quantum•Oct 13, 2025•23 citations
We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.
State conversion is a fundamental task in quantum information processing. Quantum resource theories allow for analyzing and bounding conversions that use restricted sets of operations. In the context of continuous-variable systems, state conversions restricted to Gaussian operations are crucial for both fundamental and practical reasons, particularly in state preparation and quantum computing with bosonic codes. However, previous analysis did not consider the relevant case of approximate state conversion. In this work, we introduce a framework for assessing approximate Gaussian state conversion by extending the stellar rank to the approximate stellar rank, which serves as an operational measure of non-Gaussianity. We derive bounds for Gaussian state conversion and distillation under approximate and probabilistic conditions, yielding new no-go results for non-Gaussian state preparation and enabling a reliable assessment of the performance of Gaussian conversion protocols. We also provide an open-source Python library to compute stellar-rank-related quantities and to assess Gaussian conversion.
Fermionic Gaussian circuits can be simulated efficiently on a classical computer, but become universal when supplemented with non-Gaussian operations. Similar to stabilizer circuits augmented with non-stabilizer resources, these non-Gaussian circuits can be simulated classically using rank- or extent-based methods. These methods decompose non-Gaussian states or operations into Gaussian ones, with runtimes that scale polynomially with measures of non-Gaussianity such as the rank and the extent -- quantities that typically grow exponentially with the number of non-Gaussian resources. Current fermionic rank- and extent-based simulators have mostly been limited to Gaussian circuits with magic-state injection. Extending them to mixed states and non-unitary channels has been hindered by the lack of known extent-optimized decompositions for physically relevant gates and noisy channels. In this work, we address this gap. First, we derive analytic decompositions for key non-Gaussian gates and channels, including decompositions for arbitrary two-qubit fermionic gates which are provably optimal for diagonal gates or those acting on Jordan-Wigner-adjacent qubit pairs. Second, we show that stochastic Pauli noise can reduce the effective extent of non-Gaussian rotation gates, but that fermionic magic is substantially more robust to such noise than stabilizer magic. Finally, we demonstrate how these decompositions can accelerate classical sampling from the output distribution of a quantum circuit. This involves a generalization of existing sparsification methods, previously limited to convex-unitary channels, to circuits involving intermediate measurements and feed-forward. Our decompositions also yield speedups for emulating noisy Pauli rotations with quasiprobability simulators in the large-angle/arbitrary-strength-noise and small-angle/low-noise parameter regimes.
We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form. By addressing scaling bottlenecks, FMPS enables more efficient simulation of shallow, multi-mode CV quantum circuits with non-Gaussian input states. The method is validated by simulating random shallow and cascaded circuits with highly non-Gaussian input states, showing superior performance compared to existing techniques, also in the presence of loss.
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.
Hybrid quantum systems combining discrete-variable (DV) and continuous-variable (CV) subsystems arise across a broad range of physical platforms and enable quantum information processing beyond purely qubit-based designs. Their classical simulation, however, is challenging since computational costs of both CV and DV systems exponentially increase. In this paper, we introduce a simulation framework for CV--DV hybrid systems based on linear combination of Gaussian (LCoG) decomposition. We decompose the hybrid density matrix into blocks in a DV basis and represent each block as an LCoG expansion. Within the representation, Gaussian operations on the bosonic subsystem independently act on each Gaussian function. We derive analytic formulas describing how complex Gaussian functions transform under controlled Gaussian operations. We further extend the framework to controlled Gaussian channels with state-dependent Gaussian noise. The method avoids a Fock-space truncation for the CV subsystem, and the cost of updating each Gaussian term scales polynomially with the number of modes. The framework provides a general computational tool for analyzing hybrid quantum algorithms, quantum simulation protocols, and non-Gaussian state generation schemes. As an example, we simulate Gottesman--Kitaev--Preskill (GKP) state generation based on a cavity-QED system.
We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation algorithm, which costs quadratically with the number of Gaussian states required to represent the initial state, and an approximate simulation algorithm, which costs linearly with the l 1 norm of the coefficients associated with the superposition. We define measures of non-Gaussianity quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decompositions for states relevant to continuous-variable quantum computing.