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.

arXiv comment31 pages, 8 figures - published version

References in corpus (39)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum information with continuous variables
• Encoding a qubit in an oscillator
• Improved Simulation of Stabilizer Circuits
• Quantum Computational Supremacy
• The Resource Theory of Stabilizer Computation
• Positive Wigner functions render classical simulation of quantum computation efficient
• Quantum error correction of a qubit encoded in grid states of an oscillator
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• The Real Symplectic Groups in Quantum Mechanics and Optics
• Encoding a qubit in a trapped-ion mechanical oscillator
• Negative Quasi-Probability as a Resource for Quantum Computation
• Quantum Computing with Continuous-Variable Clusters
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit
• Resource theory of quantum non-Gaussianity and Wigner negativity
• Convex resource theory of non-Gaussianity
• Gaussian states in continuous variable quantum information
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Quantum computing with rotation-symmetric bosonic codes
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Quantum information processing with bosonic qubits in circuit QED
• Quantum Error Correction with the Toric-GKP Code
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• A fault-tolerant continuous-variable measurement-based quantum computation architecture
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Standard Form of Qudit Stabilizer Groups
• Equivalence of approximate Gottesman-Kitaev-Preskill codes
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Fast simulation of bosonic qubits via Gaussian functions in phase space
• A linearized stabilizer formalism for systems of finite dimension
• Efficient simulatability of continuous-variable circuits with large Wigner negativity
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements
• Subsystem analysis of continuous-variable resource states
• From the Bloch sphere to phase space representations with the Gottesman-Kitaev-Preskill encoding
• 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