The complexity of Gottesman-Kitaev-Preskill states
arXiv:2410.19610 · doi:10.1103/4ww5-4yww
Abstract
We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations, single- and two-qubit operations, as well as qubit-controlled phase-space displacements. We define the (approximate) complexity of a bosonic state by the minimum size of a circuit that prepares an -norm approximation to the state. We propose a new circuit which prepares an approximate Gottesman-Kitaev-Preskill (GKP) state . Here is the variance of the envelope and is the variance of the individual peaks. We show that the circuit accepts with constant probability and -- conditioned on acceptance -- the output state is polynomially close in to the state . The size of our circuit is linear in . To our knowledge, this is the first protocol for GKP-state preparation with fidelity guarantees for the prepared state. We also show converse bounds, establishing that the linear circuit-size dependence of our construction is optimal. This fully characterizes the complexity of GKP states.
85 pages, 12 figures
References in corpus (9)
- Dispersive regime of circuit QED: photon-dependent qubit dephasing and relaxation rates
- Fast Universal Control of an Oscillator with Weak Dispersive Coupling to a Qubit
- Distributed quantum sensing enhanced by continuous-variable error correction
- Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications
- Gottesman-Kitaev-Preskill state preparation using periodic driving
- Bosonic Quantum Error Correction with Neutral Atoms in Optical Dipole Traps
- Classical simulation of non-Gaussian bosonic circuits
- Dissipative protection of a GKP qubit in a high-impedance superconducting circuit driven by a microwave frequency comb
- Enhancing distributed sensing with imperfect error correction