Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
arXiv:2412.13136 · doi:10.1103/xmtw-g54f
Abstract
Classically simulating circuits with bosonic codes is challenging due to the prohibitive cost of simulating quantum systems with many, possibly infinite, energy levels. We propose an algorithm to simulate circuits with encoded Gottesman-Kitaev-Preskill (GKP) states, specifically for odd-dimensional encoded qudits. Our approach is tailored to be especially effective in the most challenging but practically relevant regime, where the codeword states exhibit high (but finite) squeezing. Our algorithm leverages the Zak-Gross Wigner function introduced by J. Davis et al. [arXiv:2407.18394], which represents infinitely squeezed encoded stabilizer states positively. The runtime of the algorithm scales with the negativity of the Wigner function, allowing for efficient simulation of certain large-scale circuits - namely, input stabilizer GKP states undergoing generalized GKP-encoded Clifford operations followed by modular measurements - with a high degree of squeezing. For stabilizer GKP states exhibiting 12 dB of squeezing, our algorithm can simulate circuits with up to 1,000 modes with less than double the number of samples required for a single input mode, in stark contrast to existing simulators. Therefore, this approach holds significant potential for benchmarking early implementations of quantum computing architectures utilizing bosonic codes.
22 pages, 2 figures
References in corpus (38)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Strong quantum computational advantage using a superconducting quantum processor
- Qudits and high-dimensional quantum computing
- Experimental realization of multipartite entanglement of 60 modes of a quantum optical frequency comb
- Positive Wigner functions render classical simulation of quantum computation efficient
- Deterministic generation of a two-dimensional cluster state
- Real-time quantum error correction beyond break-even
- Negative Quasi-Probability as a Resource for Quantum Computation
- Hudson's Theorem for finite-dimensional quantum systems
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Generation of one-million-mode continuous-variable cluster state by unlimited time-domain multiplexing
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Beating the break-even point with a discrete-variable-encoded logical qubit
- All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
- Propagating Gottesman-Kitaev-Preskill states encoded in an optical oscillator
- Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
- Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
- Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Phase transition in Random Circuit Sampling
- Qutrit Magic State Distillation
- Low overhead fault-tolerant quantum error correction with the surface-GKP code
- Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
- Quantum control of a cat-qubit with bit-flip times exceeding ten seconds
- Fault-tolerant quantum computation with static linear optics
- Resources for bosonic quantum computational advantage
- Sequential modular position and momentum measurements of a trapped ion mechanical oscillator
- Classical algorithm for simulating experimental Gaussian boson sampling
- Classical simulation of Gaussian quantum circuits with non-Gaussian input states
- Efficient simulatability of continuous-variable circuits with large Wigner negativity
- Simulating lossy Gaussian boson sampling with matrix product operators
- Stabilizer subsystem decompositions for single- and multi-mode Gottesman-Kitaev-Preskill codes
- Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
- 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