Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits

Abstract

We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems such as the Gottesman-Knill theorem can be employed to assess the simulatability. We first develop a method to evaluate the probability density function corresponding to measuring a single GKP state in the position basis following arbitrary squeezing and a large set of rotations. This method involves evaluating a transformed Jacobi theta function using techniques from analytic number theory. We then use this result to identify two large classes of multimode circuits which are classically efficiently simulatable and are not contained by the GKP encoded Clifford group. Our results extend the set of circuits previously known to be classically efficiently simulatable.

31 pages, 8 figures - published version

References in corpus (6)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Gaussian states in continuous variable quantum information
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences
• Normalizer Circuits and Quantum Computation

Cited by in corpus (16)

• Resources for bosonic quantum computational advantage
• Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications
• Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Classical simulation of non-Gaussian bosonic circuits
• The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code
• Sufficient condition for universal quantum computation using bosonic circuits
• Efficient Learning of Continuous-Variable Quantum States
• Clifford operations and homological codes for rotors and oscillators
• Classical simulation and quantum resource theory of non-Gaussian optics
• Gottesman-Kitaev-Preskill encoding in continuous modal variables of single photons
• Superselection rules and bosonic quantum computational resources
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• Non-Gaussianity from superselection rules
• Sequential information theoretic protocols in continuous variable systems
• Resourcefulness of non-classical continuous-variable quantum gates