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:2502.05245 · EPJ Quantum Technology

Traversing Gaussian and non-Gaussian regimes in photonic quantum simulators: a review

Dennis Delali Kwesi Wayo, Rodrigo Alves Dias, Masoud Darvish Ganji, Camila Martins Saporetti, Leonardo Goliatt

Published Aug 14, 2026• 3 citations
arXivHTMLPDF

Abstract

Abstract Quantum photonic simulators are pivotal for designing and analyzing quantum photonic circuits that utilize both continuous-variable (CV) and discrete-variable (DV) encodings. This review critically examines the transition from Gaussian to non-Gaussian photonic models and the computational overhead that emerges from simulating systems with more than 20 modes or photon numbers exceeding 10 per mode. Gaussian states; such as coherent and squeezed states, are modeled efficiently using first-moment vectors and covariance matrices of dimension $2n \times 2n$ 2 n × 2 n , where n is the number of modes. Non-Gaussian elements like the cubic phase gate $U = \exp (i \gamma \hat{x}^{3})$ U = exp ( i γ x ˆ 3 ) and photon-subtracted states demand full Fock space representations and scale exponentially with photon number $d^{2}$ d 2 , where d is the Hilbert space dimension. We analyze simulators including , , and , benchmarking their support for tensor networks (bond dimension D >100), GPU acceleration, thus NVIDIA A100 with 1555 GB/s bandwidth, and SoC implementations such as Edge TPU with 8 TFLOPS. Special focus is given to noise models such as photon loss with transmissivity η , thermal noise modeled with $\bar{n} = 1.5$ n ¯ = 1.5 , and dark count Poisson distributions ( $\lambda = 0.1$ λ = 0.1 ). The review underscores scalable techniques and hybrid quantum-classical workflows vital for near-term photonic quantum computing.

DOI
10.1140/epjqt/s40507-026-00496-w

Related papers

Mode-Selective Photon Subtraction via Time-to-Frequency Mapping for Multimode Entangled States

Bastien Oriot, Peter Namdar, David Fainsin +3 more

Photonics quantum networks are pivotal for quantum technologies, facilitating efficient information distribution and manipulation through quantum states of light. Continuous-variable (CV) cluster states, essential resources for Measurement-Based Quantum Computing, can be deterministically generated using squeezed states of light and mode-basis changes [1]. However, Gaussian states like squeezed states or cluster states, can be efficiently simulated with a classical computer [2]. Thus, to achieve quantum advantage, non-Gaussianity should be introduced, which can be accomplished by subtracting a photon from a squeezed state [3].

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 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

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

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

DifGa: Differentiable Error Mitigation for Multi-Mode Gaussian and Non-Gaussian Noise in Quantum Photonic Circuits

Dennis Delali Kwesi Wayo, Rodrigo Alves Dias, Leonardo Goliatt +1 more

We introduce DifGa, a fully differentiable error-mitigation framework for continuous-variable (CV) quantum photonic circuits operating under Gaussian loss and weak non-Gaussian noise. The approach is demonstrated using analytic simulations with the default.gaussian backend of PennyLane, where quantum states are represented by first and second moments and optimized end-to-end via automatic differentiation. Gaussian loss is modeled as a beam splitter interaction with an environmental vacuum mode of transmissivity $η\in [0.3,0.95]$, while non-Gaussian phase noise is incorporated through a differentiable Monte-Carlo mixture of random phase rotations with jitter amplitudes $δ\in [0,0.7]$. The core architecture employs a multi-mode Gaussian circuit consisting of a signal, ancilla, and environment mode. Input states are prepared using squeezing and displacement operations with parameters $(r_s,\varphi_s,α)=(0.60,0.30,0.80)$ and $(r_a,\varphi_a)=(0.40,0.10)$, followed by an entangling beam splitter with angles $(θ,φ)=(0.70,0.20)$. Error mitigation is achieved by appending a six-parameter trainable Gaussian recovery layer comprising local phase rotations and displacements, optimized by minimizing a quadratic loss on the signal-mode quadratures $\langle \hat{x}_0\rangle$ and $\langle \hat{p}_0\rangle$ using gradient descent with fixed learning rate $0.06$ and identical initialization across experiments. Under pure Gaussian loss, the optimized recovery suppresses reconstruction error to near machine precision ($<10^{-30}$) for moderate loss ($η\ge 0.5$). When non-Gaussian phase noise is present, noise-aware training using Monte Carlo averaging yields robust generalization, reducing error by more than an order of magnitude compared to Gaussian-trained recovery at large phase jitter. Runtime benchmarks confirm linear scaling with the number of Monte Carlo samples.

quant-pharXiv:2512.23776•Journal of Physics Photonics•Dec 30, 2025•0 citations

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

Nicolás Quesada

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 distribution. Existing methods can lead to a combinatorial explosion in the time complexity, making this task unfeasible for even moderate sized experiments of interest. In this work, we prove that the computation of this type of distributions can be done in exponential time, providing a combinatorial speedup. 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.

Photonics for Quantum (PfQ)•Jul 18, 2025•1 citation
Abstract Quantum photonic simulators are pivotal for designing and analyzing quantum photonic circuits that utilize both continuous-variable (CV) and discrete-variable (DV) encodings. This review critically examines the transition from Gaussian to non-Gaussian photonic models and the computational overhead that emerges from simulating systems with more than 20 modes or photon numbers exceeding 10 per mode. Gaussian states; such as coherent and squeezed states, are modeled efficiently using first-moment vectors and covariance matrices of dimension 2n×2n2n \times 2n2n×2n 2 n × 2 n , where n is the number of modes. Non-Gaussian elements like the cubic phase gate U=exp⁡(iγx^3)U = \exp (i \gamma \hat{x}^{3})U=exp(iγx^3) U = exp ( i γ x ˆ 3 ) and photon-subtracted states demand full Fock space representations and scale exponentially with photon number d2d^{2}d2 d 2 , where d is the Hilbert space dimension. We analyze simulators including , , and , benchmarking their support for tensor networks (bond dimension D >100), GPU acceleration, thus NVIDIA A100 with 1555 GB/s bandwidth, and SoC implementations such as Edge TPU with 8 TFLOPS. Special focus is given to noise models such as photon loss with transmissivity η , thermal noise modeled with nˉ=1.5\bar{n} = 1.5nˉ=1.5 n ¯ = 1.5 , and dark count Poisson distributions ( λ=0.1\lambda = 0.1λ=0.1 λ = 0.1 ). The review underscores scalable techniques and hybrid quantum-classical workflows vital for near-term photonic quantum computing.
Photonics quantum networks are pivotal for quantum technologies, facilitating efficient information distribution and manipulation through quantum states of light. Continuous-variable (CV) cluster states, essential resources for Measurement-Based Quantum Computing, can be deterministically generated using squeezed states of light and mode-basis changes [1]. However, Gaussian states like squeezed states or cluster states, can be efficiently simulated with a classical computer [2]. Thus, to achieve quantum advantage, non-Gaussianity should be introduced, which can be accomplished by subtracting a photon from a squeezed state [3].
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.
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.
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 introduce DifGa, a fully differentiable error-mitigation framework for continuous-variable (CV) quantum photonic circuits operating under Gaussian loss and weak non-Gaussian noise. The approach is demonstrated using analytic simulations with the default.gaussian backend of PennyLane, where quantum states are represented by first and second moments and optimized end-to-end via automatic differentiation. Gaussian loss is modeled as a beam splitter interaction with an environmental vacuum mode of transmissivity η∈[0.3,0.95]η\in [0.3,0.95]η∈[0.3,0.95], while non-Gaussian phase noise is incorporated through a differentiable Monte-Carlo mixture of random phase rotations with jitter amplitudes δ∈[0,0.7]δ\in [0,0.7]δ∈[0,0.7]. The core architecture employs a multi-mode Gaussian circuit consisting of a signal, ancilla, and environment mode. Input states are prepared using squeezing and displacement operations with parameters (rs,φs,α)=(0.60,0.30,0.80)(r_s,\varphi_s,α)=(0.60,0.30,0.80)(rs​,φs​,α)=(0.60,0.30,0.80) and (ra,φa)=(0.40,0.10)(r_a,\varphi_a)=(0.40,0.10)(ra​,φa​)=(0.40,0.10), followed by an entangling beam splitter with angles (θ,φ)=(0.70,0.20)(θ,φ)=(0.70,0.20)(θ,φ)=(0.70,0.20). Error mitigation is achieved by appending a six-parameter trainable Gaussian recovery layer comprising local phase rotations and displacements, optimized by minimizing a quadratic loss on the signal-mode quadratures ⟨x^0⟩\langle \hat{x}_0\rangle⟨x^0​⟩ and ⟨p^0⟩\langle \hat{p}_0\rangle⟨p^​0​⟩ using gradient descent with fixed learning rate 0.060.060.06 and identical initialization across experiments. Under pure Gaussian loss, the optimized recovery suppresses reconstruction error to near machine precision (<10−30<10^{-30}<10−30) for moderate loss (η≥0.5η\ge 0.5η≥0.5). When non-Gaussian phase noise is present, noise-aware training using Monte Carlo averaging yields robust generalization, reducing error by more than an order of magnitude compared to Gaussian-trained recovery at large phase jitter. Runtime benchmarks confirm linear scaling with the number of Monte Carlo samples.
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 distribution. Existing methods can lead to a combinatorial explosion in the time complexity, making this task unfeasible for even moderate sized experiments of interest. In this work, we prove that the computation of this type of distributions can be done in exponential time, providing a combinatorial speedup. 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.