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:2512.23776 · Journal of Physics Photonics

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, Sven Groppe

quant-phSubmitted Dec 29, 2025• Announced Dec 30, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/2515-7647/ae7864

Related papers

Which quantum algorithms suit photonic continuous-variable hardware? A comparative resource and noise-robustness study

Hikaru Wakaura, Taiki Tanimae

Summary. A comparative, model-level study of four quantum algorithms ported to a common photonic continuous-variable (CV) model: control-free quantum phase estimation (QPE), randomized product formulas (qDRIFT), quantum Kolmogorov-Arnold networks (QKAN), and Regev's factoring algorithm. Algorithms are compared under a shared noise channel combining exact Fock-space photon loss and Gaussian displacement, with Gottesman-Kitaev-Preskill (GKP) error correction. Main findings. Control-free QPE is the most noise-robust because it needs no controlled unitaries and, for quadratic Hamiltonians, no non-Gaussian gates; the advantage survives for non-Gaussian Hamiltonians. GKP correction helps only once the physical noise exceeds the finite-squeezing floor (proved), and whether an algorithm benefits is set by a noise- versus systematic-limited dichotomy. The core GKP correction model is validated against an explicit Glancy-Knill error-correction Monte Carlo (agreement ≤0.1%). A discrete-variable surface-code baseline shows the CV advantage is structural (Gaussian operations are free), not threshold-based. Scope. This is a model-level numerical comparison, not an experiment; the GKP correction is a validated surrogate rather than a full Fock-space error-correction circuit, and instances are modest in size. Results, sensitivity analyses, and a two-dimensional noise phase diagram are included. Reproducibility. Standalone scripts and released JSON results reproduce every figure and table.

•May 22, 2026•0 citations

Extrapolative Quantum Error Mitigation in Continuous-Variable Systems beyond the Training Horizon

Jingpeng Zhang, Shengyong Li, Jie Han +3 more

Continuous-variable (CV) quantum systems provide a versatile platform for quantum information processing, in which quantum states can be represented in the quadrature phase space. In realistic implementations, environmental noise, primarily photon loss and dephasing, progressively degrades these states. Machine-learning-based quantum error mitigation (QEM) has recently emerged as a promising approach to suppress such noise; however, existing methods are typically limited to the training horizon and require training data that cover the entire evolution, which is experimentally demanding. Here we introduce a framework for extrapolative quantum error mitigation based on a time-conditioned Swin Transformer. By explicitly embedding the evolution time via adaptive layer normalization, the model learns a correction map that accounts for the continuous accumulation of noise while capturing nonlocal phase-space correlations. Numerical simulations under both Markovian and non-Markovian noise demonstrate accurate state recovery in the long-time regime, where existing approaches deteriorate. Our results establish extrapolative QEM as a practical route to mitigating noise in CV quantum systems without exhaustive training data.

quant-pharXiv:2603.08548•Mar 10, 2026•0 citations

Environment-Assisted Decoherence Suppression of Optical Non-Gaussian States

Akihiro Machinaga, Naoki Aritomi, Ryoga Sakurada +10 more

Optical loss is a common bottleneck in photonic quantum information processing, undermining the quantum advantage over classical approaches. Although several countermeasures, such as quantum distillation and error correction, have been proposed, they typically require experimentally demanding non-Gaussian operations. Here, we demonstrate a Gaussian-only scheme that suppresses loss-induced decoherence for general, unknown optical quantum states. By injecting a squeezed vacuum state into an environment of the loss channel and performing feedforward based on environmental monitoring, the scheme effectively suppresses loss-induced noise. Our programmable loop-based optical circuit allows us to implement the scheme for several types of loss-sensitive non-Gaussian states under various loss conditions for up to five steps, and directly compare the results with the unsuppressed case. Our results show that the scheme consistently mitigates state degradation, preserving higher fidelity and Wigner negativity than without suppression. This approach can be applied to mitigating a broad class of errors in optical systems and extending quantum memory lifetimes. Moreover, it is compatible with other loss-suppression techniques and extendable to physical platforms beyond optics, offering a promising route toward reducing the overhead required for fault-tolerant quantum information processing.

quant-pharXiv:2604.06679•Apr 9, 2026•0 citations

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

Dennis Delali Kwesi Wayo, Rodrigo Alves Dias, Masoud Darvish Ganji +2 more

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.

EPJ Quantum Technology•Aug 14, 2026•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•0 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
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.
Summary. A comparative, model-level study of four quantum algorithms ported to a common photonic continuous-variable (CV) model: control-free quantum phase estimation (QPE), randomized product formulas (qDRIFT), quantum Kolmogorov-Arnold networks (QKAN), and Regev's factoring algorithm. Algorithms are compared under a shared noise channel combining exact Fock-space photon loss and Gaussian displacement, with Gottesman-Kitaev-Preskill (GKP) error correction. Main findings. Control-free QPE is the most noise-robust because it needs no controlled unitaries and, for quadratic Hamiltonians, no non-Gaussian gates; the advantage survives for non-Gaussian Hamiltonians. GKP correction helps only once the physical noise exceeds the finite-squeezing floor (proved), and whether an algorithm benefits is set by a noise- versus systematic-limited dichotomy. The core GKP correction model is validated against an explicit Glancy-Knill error-correction Monte Carlo (agreement ≤0.1%). A discrete-variable surface-code baseline shows the CV advantage is structural (Gaussian operations are free), not threshold-based. Scope. This is a model-level numerical comparison, not an experiment; the GKP correction is a validated surrogate rather than a full Fock-space error-correction circuit, and instances are modest in size. Results, sensitivity analyses, and a two-dimensional noise phase diagram are included. Reproducibility. Standalone scripts and released JSON results reproduce every figure and table.
Continuous-variable (CV) quantum systems provide a versatile platform for quantum information processing, in which quantum states can be represented in the quadrature phase space. In realistic implementations, environmental noise, primarily photon loss and dephasing, progressively degrades these states. Machine-learning-based quantum error mitigation (QEM) has recently emerged as a promising approach to suppress such noise; however, existing methods are typically limited to the training horizon and require training data that cover the entire evolution, which is experimentally demanding. Here we introduce a framework for extrapolative quantum error mitigation based on a time-conditioned Swin Transformer. By explicitly embedding the evolution time via adaptive layer normalization, the model learns a correction map that accounts for the continuous accumulation of noise while capturing nonlocal phase-space correlations. Numerical simulations under both Markovian and non-Markovian noise demonstrate accurate state recovery in the long-time regime, where existing approaches deteriorate. Our results establish extrapolative QEM as a practical route to mitigating noise in CV quantum systems without exhaustive training data.
Optical loss is a common bottleneck in photonic quantum information processing, undermining the quantum advantage over classical approaches. Although several countermeasures, such as quantum distillation and error correction, have been proposed, they typically require experimentally demanding non-Gaussian operations. Here, we demonstrate a Gaussian-only scheme that suppresses loss-induced decoherence for general, unknown optical quantum states. By injecting a squeezed vacuum state into an environment of the loss channel and performing feedforward based on environmental monitoring, the scheme effectively suppresses loss-induced noise. Our programmable loop-based optical circuit allows us to implement the scheme for several types of loss-sensitive non-Gaussian states under various loss conditions for up to five steps, and directly compare the results with the unsuppressed case. Our results show that the scheme consistently mitigates state degradation, preserving higher fidelity and Wigner negativity than without suppression. This approach can be applied to mitigating a broad class of errors in optical systems and extending quantum memory lifetimes. Moreover, it is compatible with other loss-suppression techniques and extendable to physical platforms beyond optics, offering a promising route toward reducing the overhead required for fault-tolerant quantum information processing.
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.
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.
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.