A Quadratic Speedup in the Optimization of Noisy Quantum Optical Circuits

Abstract

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(M^2{\prod }_{i\in U}{C}_i^2{\prod }_{i\in D}{C}_i)$, rather than $O(M^2{\prod }_{i\in D\cup U}{C}_i^2)$, where $C_i$ 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.

References in corpus (26)

• Encoding a qubit in an oscillator
• Evaluating analytic gradients on quantum hardware
• Gaussian Boson Sampling
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• A detailed study of Gaussian Boson Sampling
• Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
• Molecular Docking with Gaussian Boson Sampling
• Using Gaussian Boson Sampling to Find Dense Subgraphs
• Conversion of Gaussian states to non-Gaussian states using photon-number-resolving detectors
• Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
• Generation of optical Schrödinger's cat states by generalized photon subtraction
• Gaussian Boson Sampling for perfect matchings of arbitrary graphs
• A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Simulating realistic non-Gaussian state preparation
• Vibronic Boson Sampling: Generalized Gaussian Boson Sampling for Molecular Vibronic Spectra at Finite Temperature
• Production of photonic universal quantum gates enhanced by machine learning
• Quantum approximate optimization with Gaussian boson sampling
• Graph isomorphism and Gaussian boson sampling
• Point Processes with Gaussian Boson Sampling
• Franck-Condon factors by counting perfect matchings of graphs with loops
• Training Gaussian Boson Sampling Distributions
• Efficient backcasting search for optical quantum state synthesis
• Fast optimization of parametrized quantum optical circuits
• Generation of photonic non-Gaussian states by measuring multimode Gaussian states
• Gaussian breeding for encoding a qubit in propagating light

Cited by in corpus (3)

• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Ground state nature and nonlinear squeezing of Gottesman-Kitaev-Preskill states
• The stellar decomposition of Gaussian quantum states