Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes

Abstract

We introduce a framework for simulating, on an $(n+1)$-qubit quantum computer, the action of a Gaussian Bosonic (GB) circuit on a state over $2^n$ modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators (and their covariance matrix) as an input qubit-state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real (imaginary) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a BQP-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on $\sim 8$ billion modes, illustrating the power of our framework.

5+14 pages, 3 figures, 1 table

References in corpus (7)

• Quantum algorithm for solving linear systems of equations
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Exponential quantum speedup in simulating coupled classical oscillators
• Universal extensions of restricted classes of quantum operations
• Quantum simulation with just-in-time compilation
• Error Bounds for Variational Quantum Time Evolution
• Fragmented imaginary-time evolution for early-stage quantum signal processors

Cited by in corpus (3)

• Lie-algebraic classical simulations for quantum computing
• Solving Free Fermion Problems on a Quantum Computer
• Architectures and random properties of symplectic quantum circuits