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

Fast simulations of continuous-variable circuits using the coherent state decomposition

Olga Solodovnikova, Ulrik L. Andersen, Jonas Schou Neergaard-Nielsen

Published Aug 8, 2025• 4 citations
arXivHTMLPDF

Abstract

We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states, forming a bridge between the Gaussian and Fock basis representations. By tracking the Wigner function, we can simulate the action of Gaussian channels and measurements on multi-mode systems in a fast and accurate numerical framework. The calculation of the quality measures of quantum states is convenient in this formalism, and we derive expressions for the analytical gradients of these measures with respect to parameterized circuit elements. We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer, with a Gaussian Boson sampling circuit containing inefficient components.

DOI
10.48550/arxiv.2508.06175

Related papers

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

A Quadratic Speedup in the Optimization of Noisy Quantum Optical Circuits

Robbe De Prins, Yuan Yao, Anuj Apte +1 more

Linear optical quantum circuits with photon number resolving (PNR) detectors are used for both Gaussian Boson Sampling (GBS) and for the preparation of non-Gaussian states such as Gottesman-Kitaev-Preskill (GKP), cat and NOON states. They are crucial in many schemes of quantum computing and quantum metrology. Classically optimizing circuits with PNR detectors is challenging due to their exponentially large Hilbert space, and quadratically more challenging in the presence of decoherence as state vectors are replaced by density matrices. To tackle this problem, we introduce a family of algorithms that calculate detection probabilities, conditional states (as well as their gradients with respect to circuit parametrizations) with a complexity that is comparable to the noiseless case. As a consequence we can simulate and optimize circuits with twice the number of modes as we could before, using the same resources. More precisely, for an M -mode noisy circuit with detected modes D and undetected modes U , the complexity of our algorithm is O(M2∏i∈UCi2∏i∈DCi) , rather than O(M2∏i∈D∪UCi2) , where Ci is the Fock cutoff of mode i . As a particular case, our approach offers a full quadratic speedup for calculating detection probabilities, as in that case all modes are detected. Finally, these algorithms are implemented and ready to use in the open-source photonic optimization library MrMustard.

arXiv:2303.08879•Quantum•Aug 29, 2023•7 citations

Fast Simulation of Bosonic Qubits via Gaussian Functions in Phase Space

J. Eli Bourassa, Nicolás Quesada, Ilan Tzitrin +6 more

Bosonic qubits are a promising route to building fault-tolerant quantum computers on a variety of physical platforms.Studying the performance of bosonic qubits under realistic gates and measurements is challenging with existing analytical and numerical tools.We present a novel formalism for simulating classes of states that can be represented as linear combinations of Gaussian functions in phase space.This formalism allows us to analyze and simulate a wide class of non-Gaussian states, transformations, and measurements.We demonstrate how useful classes of bosonic qubits-Gottesman-Kitaev-Preskill (GKP), cat, and Fock states-can be simulated using this formalism, opening the door to investigating the behavior of bosonic qubits under Gaussian channels and measurements, non-Gaussian transformations such as those achieved via gate teleportation, and important non-Gaussian measurements such as threshold and photon-number detection.Our formalism enables simulating these situations with levels of accuracy that are not feasible with existing methods.Finally, we use a method informed by our formalism to simulate circuits critical to the study of fault-tolerant quantum computing with bosonic qubits but beyond the reach of existing techniques.Specifically, we examine how finite-energy GKP states transform under realistic qubit phase gates; interface with a continuous-variable cluster state; and transform under non-Clifford T gate teleportation using magic states.We implement our simulation method as a part of the open-source Strawberry Fields PYTHON library.

arXiv:2103.05530•PRX Quantum•Oct 22, 2021•47 citations

Simulating lossy and partially distinguishable quantum optical circuits: theory, algorithms, and applications to experiment validation and state preparation

Jacob F. F. Bulmer, Javier Martínez-Cifuentes, Bryn A. Bell +1 more

To understand quantum optics experiments, we must perform calculations that consider the principal sources of noise, such as losses, spectral impurity, and partial distinguishability. In both discrete and continuous variable systems, these can be modeled as mixed Gaussian states over multiple modes. The modes are not all resolved by photon-number measurements and so require calculations on coarse-grained photon-number distributions. Existing methods can lead to a combinatorial explosion in the time complexity, making this task unfeasible for even moderately sized experiments of interest. We prove that the computation of this type of distribution can be done in exponential time, providing a combinatorial speed-up. We develop numerical techniques that allow us to determine coarse-grained photon number distributions of Gaussian states, as well as density matrix elements of heralded non-Gaussian states prepared in the presence of spectral impurity and partial distinguishability. These results offer significant speed-up and accuracy improvements to validation tests of both Fock and Gaussian boson samplers that rely on binned probability distributions. Moreover, they pave the way to a more efficient simulation of realistic photonic circuits, unlocking the ability to perform exact calculations at scales that were previously out of reach. In addition, our results, including loop Hafnian master theorems, may be of interest to the fields of combinatorics and graph theory.

arXiv:2412.17742•Advanced Photonics•Feb 18, 2026•15 citations

Conversion of Gaussian states to non-Gaussian states using photon-number-resolving detectors

Daiqin Su, Casey R. Myers, Krishna Kumar Sabapathy

Generation of high-fidelity photonic non-Gaussian states is a crucial ingredient for universal quantum computation using continuous-variable platforms, yet it remains a challenge to do this efficiently. We present a general framework for a probabilistic production of multimode non-Gaussian states by measuring a few modes of multimode Gaussian states via photon-number-resolving detectors. We use Gaussian elements consisting of squeezed displaced vacuum states and interferometers, the only non-Gaussian elements consisting of photon-number-resolving detectors. We derive analytic expressions for the output Wigner function, and the probability of generating the states in terms of the mean and the covariance matrix of the Gaussian state and the photon detection pattern. We find that the output states can be written as a Fock-basis superposition state followed by a Gaussian gate, and we derive explicit expressions for these parameters. These analytic expressions show exactly what non-Gaussian states can be generated by this probabilistic scheme. Further, it provides a method to search for the Gaussian circuit and measurement pattern that produce a target non-Gaussian state with optimal fidelity and success probability. We present specific examples such as the generation of cat states, ON states, Gottesman-Kitaev-Preskill states, NOON states, and bosonic-code states. The proposed framework has potentially far-reaching implications for the generation of bosonic error-correction codes that require non-Gaussian states and resource states for the implementation of non-Gaussian gates needed for universal quantum computation, among other applications requiring non-Gaussianity. The tools developed here could also prove useful for the quantum resource theory of non-Gaussianity.

arXiv:1902.02323•Physical Review A•Nov 1, 2019•148 citations

Hardware-inspired Continuous Variables Quantum Optical Neural Networks

Todor Krasimirov-Ivanov, Alba Cervera-Lierta, Paolo Stornati +1 more

Continuous-variables (CV) quantum optics is a natural formalism for neural networks (NNs) due to its ability to reproduce the information processing of such trainable interconnected systems. In quantum optics, Gaussian operators induce affine mappings on the quadratures of optical modes while non-Gaussian resources (the challenging piece for physical implementation) originate the nonlinear effects, unlocking quantum analogs of an artificial neuron. This work presents a novel experimentally-feasible framework for continuous-variable quantum optical neural networks (QONNs) developed with available photonic components: coherent states as input encoding, a general Gaussian transformation followed by multi-mode photon subtractions as the processing layer, and homodyne detection as outputs readout. The closed-form expressions of such architecture are derived demonstrating the family of adaptive activations and the quantum-optical neurons that emerge from the amount of photon-subtracted modes, proving that the proposed design satisfies the Universal Approximation Theorem within a single layer. To classically simulate the QONN training, the high-performance QuaNNTO library has been developed based on Wick-Isserlis expansion and Bogoliubov transformations, allowing multi-layer exact expectation values of non-Gaussian states without truncating the infinite-dimensional Hilbert space. Experiments on supervised learning and state-preparation tasks show balanced-resource efficiency with strong expressivity and generalization capabilities, illustrating the potential of the architecture for scalable photonic quantum machine learning and for quantum applications such as complex non-Gaussian gate synthesis.

quant-pharXiv:2512.05204•Dec 8, 2025•1 citation
We present \texttt{lcg_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states, forming a bridge between the Gaussian and Fock basis representations. By tracking the Wigner function, we can simulate the action of Gaussian channels and measurements on multi-mode systems in a fast and accurate numerical framework. The calculation of the quality measures of quantum states is convenient in this formalism, and we derive expressions for the analytical gradients of these measures with respect to parameterized circuit elements. We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer, with a Gaussian Boson sampling circuit containing inefficient components.
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.
Linear optical quantum circuits with photon number resolving (PNR) detectors are used for both Gaussian Boson Sampling (GBS) and for the preparation of non-Gaussian states such as Gottesman-Kitaev-Preskill (GKP), cat and NOON states. They are crucial in many schemes of quantum computing and quantum metrology. Classically optimizing circuits with PNR detectors is challenging due to their exponentially large Hilbert space, and quadratically more challenging in the presence of decoherence as state vectors are replaced by density matrices. To tackle this problem, we introduce a family of algorithms that calculate detection probabilities, conditional states (as well as their gradients with respect to circuit parametrizations) with a complexity that is comparable to the noiseless case. As a consequence we can simulate and optimize circuits with twice the number of modes as we could before, using the same resources. More precisely, for an M -mode noisy circuit with detected modes D and undetected modes U , the complexity of our algorithm is O(M2∏i∈UCi2∏i∈DCi) , rather than O(M2∏i∈D∪UCi2) , where Ci is the Fock cutoff of mode i . As a particular case, our approach offers a full quadratic speedup for calculating detection probabilities, as in that case all modes are detected. Finally, these algorithms are implemented and ready to use in the open-source photonic optimization library MrMustard.
Bosonic qubits are a promising route to building fault-tolerant quantum computers on a variety of physical platforms.Studying the performance of bosonic qubits under realistic gates and measurements is challenging with existing analytical and numerical tools.We present a novel formalism for simulating classes of states that can be represented as linear combinations of Gaussian functions in phase space.This formalism allows us to analyze and simulate a wide class of non-Gaussian states, transformations, and measurements.We demonstrate how useful classes of bosonic qubits-Gottesman-Kitaev-Preskill (GKP), cat, and Fock states-can be simulated using this formalism, opening the door to investigating the behavior of bosonic qubits under Gaussian channels and measurements, non-Gaussian transformations such as those achieved via gate teleportation, and important non-Gaussian measurements such as threshold and photon-number detection.Our formalism enables simulating these situations with levels of accuracy that are not feasible with existing methods.Finally, we use a method informed by our formalism to simulate circuits critical to the study of fault-tolerant quantum computing with bosonic qubits but beyond the reach of existing techniques.Specifically, we examine how finite-energy GKP states transform under realistic qubit phase gates; interface with a continuous-variable cluster state; and transform under non-Clifford T gate teleportation using magic states.We implement our simulation method as a part of the open-source Strawberry Fields PYTHON library.
To understand quantum optics experiments, we must perform calculations that consider the principal sources of noise, such as losses, spectral impurity, and partial distinguishability. In both discrete and continuous variable systems, these can be modeled as mixed Gaussian states over multiple modes. The modes are not all resolved by photon-number measurements and so require calculations on coarse-grained photon-number distributions. Existing methods can lead to a combinatorial explosion in the time complexity, making this task unfeasible for even moderately sized experiments of interest. We prove that the computation of this type of distribution can be done in exponential time, providing a combinatorial speed-up. We develop numerical techniques that allow us to determine coarse-grained photon number distributions of Gaussian states, as well as density matrix elements of heralded non-Gaussian states prepared in the presence of spectral impurity and partial distinguishability. These results offer significant speed-up and accuracy improvements to validation tests of both Fock and Gaussian boson samplers that rely on binned probability distributions. Moreover, they pave the way to a more efficient simulation of realistic photonic circuits, unlocking the ability to perform exact calculations at scales that were previously out of reach. In addition, our results, including loop Hafnian master theorems, may be of interest to the fields of combinatorics and graph theory.
Generation of high-fidelity photonic non-Gaussian states is a crucial ingredient for universal quantum computation using continuous-variable platforms, yet it remains a challenge to do this efficiently. We present a general framework for a probabilistic production of multimode non-Gaussian states by measuring a few modes of multimode Gaussian states via photon-number-resolving detectors. We use Gaussian elements consisting of squeezed displaced vacuum states and interferometers, the only non-Gaussian elements consisting of photon-number-resolving detectors. We derive analytic expressions for the output Wigner function, and the probability of generating the states in terms of the mean and the covariance matrix of the Gaussian state and the photon detection pattern. We find that the output states can be written as a Fock-basis superposition state followed by a Gaussian gate, and we derive explicit expressions for these parameters. These analytic expressions show exactly what non-Gaussian states can be generated by this probabilistic scheme. Further, it provides a method to search for the Gaussian circuit and measurement pattern that produce a target non-Gaussian state with optimal fidelity and success probability. We present specific examples such as the generation of cat states, ON states, Gottesman-Kitaev-Preskill states, NOON states, and bosonic-code states. The proposed framework has potentially far-reaching implications for the generation of bosonic error-correction codes that require non-Gaussian states and resource states for the implementation of non-Gaussian gates needed for universal quantum computation, among other applications requiring non-Gaussianity. The tools developed here could also prove useful for the quantum resource theory of non-Gaussianity.
Continuous-variables (CV) quantum optics is a natural formalism for neural networks (NNs) due to its ability to reproduce the information processing of such trainable interconnected systems. In quantum optics, Gaussian operators induce affine mappings on the quadratures of optical modes while non-Gaussian resources (the challenging piece for physical implementation) originate the nonlinear effects, unlocking quantum analogs of an artificial neuron. This work presents a novel experimentally-feasible framework for continuous-variable quantum optical neural networks (QONNs) developed with available photonic components: coherent states as input encoding, a general Gaussian transformation followed by multi-mode photon subtractions as the processing layer, and homodyne detection as outputs readout. The closed-form expressions of such architecture are derived demonstrating the family of adaptive activations and the quantum-optical neurons that emerge from the amount of photon-subtracted modes, proving that the proposed design satisfies the Universal Approximation Theorem within a single layer. To classically simulate the QONN training, the high-performance QuaNNTO library has been developed based on Wick-Isserlis expansion and Bogoliubov transformations, allowing multi-layer exact expectation values of non-Gaussian states without truncating the infinite-dimensional Hilbert space. Experiments on supervised learning and state-preparation tasks show balanced-resource efficiency with strong expressivity and generalization capabilities, illustrating the potential of the architecture for scalable photonic quantum machine learning and for quantum applications such as complex non-Gaussian gate synthesis.