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:2412.17742 · Advanced Photonics

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, Nicolás Quesada

Published Feb 18, 2026• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1117/1.ap.8.1.016010

Related papers

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

A simulation methodology for quantum photonic integrated circuits in the presence of fabrication imperfections, loss, and partially distinguishable photons

Sebastian Gitt, Božidar Novaković, Dylan McGuire +1 more

Discrete variable quantum photonic circuits rely on the interference between indistinguishable photons to produce non-classical results. However, indistinguishability between photons is often spoiled due to timing delays, different spectral profiles, or the presence of unwanted spectral correlations. Additionally, variability in circuit components can introduce further errors. Here we present a method for simulating the frequency domain response of quantum photonic integrated circuits (PICs), allowing the fidelity and probability of success of realistic quantum circuits to be characterized. As an example, we first model the biphoton wavefunction produced by spontaneous four-wave mixing in a silicon nitride microring resonator, then use our methodology to simulate the interference between heralded signal photons from two such sources in the presence of spectral correlations and circuit component variability due to manufacturing imperfections.

Photonics for Quantum (PfQ)•Jul 19, 2023•1 citation

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.

arXiv:2502.05245•EPJ Quantum Technology•Aug 14, 2026•3 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

Simulating imperfect quantum optical circuits using unsymmetrized bases

John Steinmetz, Maike Ostmann, Alex Neville +2 more

Fault-tolerant photonic quantum computing requires the generation of large entangled resource states. The required size of these states makes it challenging to simulate the effects of errors such as loss and partial distinguishability. For an interferometer with $N$ partially distinguishable input photons and $M$ spatial modes, the Fock basis can have up to ${N+NM-1\choose N}$ elements. We show that it is possible to use a much smaller unsymmetrized basis with size $M^N$ without discarding any information. This enables simulations of the joint effect of loss and partial distinguishability on larger states than is otherwise possible. We demonstrate the technique by providing the first-ever simulations of the generation of imperfect qubits encoded using quantum parity codes, including an example where the Hilbert space is over $60$ orders of magnitude smaller than the $N$-photon Fock space. As part of the analysis, we derive the loss mechanism for partially distinguishable photons.

arXiv:2412.13330•Dec 17, 2024•5 citations

Loss and distinguishability effects in heralded entangled state generation with Gaussian resources

Yun-Long Cao, Xiao-Ye Xu, Wiwittawin Sukmas +2 more

The effects of optical loss and photon distinguishability on the heralded generation of entangled states based on Gaussian resources are quantitatively investigated. By incorporating mode-dependent loss and the statistical characteristics of partially distinguishable photons into a phase-space representation, an efficient numerical framework is established to optimize target-state fidelity and success probability, with a specific focus on the enhancement triggered by non-Gaussian operations such as photon addition and subtraction. The numerical optimization results indicate that a non-vacuum post-selection strategy within a dual-rail encoding framework, combined with the simultaneous tuning of squeezing parameters and the interferometer network, effectively suppresses vacuum noise, enabling the generation of high-fidelity Bell, GHZ, and W states under realistic experimental constraints. The results show that introducing non-Gaussian operations can successfully enhance the state generation performance under realistic imperfections analogous to the enhancements observed under ideal conditions. This study demonstrates that experimental imperfections primarily scale down the success probability rather than fundamentally compromising the state fidelity, providing practical design guidelines for scalable state engineering on integrated photonic platforms.

quant-pharXiv:2607.23048•Jul 28, 2026•0 citations
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.
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.
Discrete variable quantum photonic circuits rely on the interference between indistinguishable photons to produce non-classical results. However, indistinguishability between photons is often spoiled due to timing delays, different spectral profiles, or the presence of unwanted spectral correlations. Additionally, variability in circuit components can introduce further errors. Here we present a method for simulating the frequency domain response of quantum photonic integrated circuits (PICs), allowing the fidelity and probability of success of realistic quantum circuits to be characterized. As an example, we first model the biphoton wavefunction produced by spontaneous four-wave mixing in a silicon nitride microring resonator, then use our methodology to simulate the interference between heralded signal photons from two such sources in the presence of spectral correlations and circuit component variability due to manufacturing imperfections.
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.
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.
Fault-tolerant photonic quantum computing requires the generation of large entangled resource states. The required size of these states makes it challenging to simulate the effects of errors such as loss and partial distinguishability. For an interferometer with NNN partially distinguishable input photons and MMM spatial modes, the Fock basis can have up to (N+NM−1N){N+NM-1\choose N}(NN+NM−1​) elements. We show that it is possible to use a much smaller unsymmetrized basis with size MNM^NMN without discarding any information. This enables simulations of the joint effect of loss and partial distinguishability on larger states than is otherwise possible. We demonstrate the technique by providing the first-ever simulations of the generation of imperfect qubits encoded using quantum parity codes, including an example where the Hilbert space is over 606060 orders of magnitude smaller than the NNN-photon Fock space. As part of the analysis, we derive the loss mechanism for partially distinguishable photons.
The effects of optical loss and photon distinguishability on the heralded generation of entangled states based on Gaussian resources are quantitatively investigated. By incorporating mode-dependent loss and the statistical characteristics of partially distinguishable photons into a phase-space representation, an efficient numerical framework is established to optimize target-state fidelity and success probability, with a specific focus on the enhancement triggered by non-Gaussian operations such as photon addition and subtraction. The numerical optimization results indicate that a non-vacuum post-selection strategy within a dual-rail encoding framework, combined with the simultaneous tuning of squeezing parameters and the interferometer network, effectively suppresses vacuum noise, enabling the generation of high-fidelity Bell, GHZ, and W states under realistic experimental constraints. The results show that introducing non-Gaussian operations can successfully enhance the state generation performance under realistic imperfections analogous to the enhancements observed under ideal conditions. This study demonstrates that experimental imperfections primarily scale down the success probability rather than fundamentally compromising the state fidelity, providing practical design guidelines for scalable state engineering on integrated photonic platforms.