Classical simulation of non-Gaussian bosonic circuits

Abstract

We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of relative phases between individual terms in a linear combination. This yields an exact simulation algorithm whose runtime is polynomial in the number of modes and the size of the circuit, and quadratic in the number of terms in the superposition. We also present a faster approximate randomized algorithm whose runtime is linear in this number. Our main building blocks are a formula for the triple overlap of three Gaussian states and a fast algorithm for estimating the norm of a superposition of Gaussian states up to a multiplicative error. Our construction borrows from earlier work on simulating quantum circuits in finite-dimensional settings, including, in particular, fermionic linear optics with non-Gaussian initial states and Clifford computations with non-stabilizer initial states. It provides algorithmic access to a practically relevant family of non-Gaussian bosonic circuits.

47 pages and 7 figures, typos fixed with respect to the published version

References in corpus (29)

• Improved Simulation of Stabilizer Circuits
• Positive Wigner functions render classical simulation of quantum computation efficient
• Quantum information with Gaussian states
• Negative Quasi-Probability as a Resource for Quantum Computation
• A No-Go Theorem for Gaussian Quantum Error Correction
• Classical simulation of noninteracting-fermion quantum circuits
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Performance and structure of single-mode bosonic codes
• Hardware-efficient autonomous quantum error correction
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Quantum fidelity for arbitrary Gaussian states
• Matchgates and classical simulation of quantum circuits
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Quantum Error Correction with the Toric-GKP Code
• Cat codes with optimal decoherence suppression for a lossy bosonic channel
• Encoding an oscillator into many oscillators
• Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
• Complexity of quantum impurity problems
• Quantum error correction against photon loss using multi-component cat states
• Resources for bosonic quantum computational advantage
• From estimation of quantum probabilities to simulation of quantum circuits
• Classical simulation of Gaussian quantum circuits with non-Gaussian input states
• Fast estimation of outcome probabilities for quantum circuits
• Classical simulation of non-Gaussian fermionic circuits
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Simulation of quantum optics by coherent state decomposition
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Sufficient condition for universal quantum computation using bosonic circuits

Cited by in corpus (8)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Classical simulation and quantum resource theory of non-Gaussian optics
• What's my phase again? Computing the vacuum-to-vacuum amplitude of quadratic bosonic evolution
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• The complexity of Gottesman-Kitaev-Preskill states
• Classical algorithms for measurement-adaptive Gaussian circuits
• The symplectic rank of non-Gaussian quantum states
• Non-Gaussianity from superselection rules