Sufficient condition for universal quantum computation using bosonic circuits

Abstract

Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest.

31 pages, 14 figures

References in corpus (14)

• Universal Quantum Computation with Continuous-Variable Cluster States
• Confining the state of light to a quantum manifold by engineered two-photon loss
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Magic state distillation with low overhead
• Fault-tolerant linear optical quantum computing with small-amplitude coherent states
• Improved magic states distillation for quantum universality
• Non-Gaussian states for continuous variable quantum computation via Gaussian maps
• What can quantum optics say about computational complexity theory?
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences
• Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
• Nonlinear feedforward enabling quantum computation
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• The vacuum provides quantum advantage to otherwise simulatable architectures
• The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code

Cited by in corpus (9)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Classical simulation of non-Gaussian bosonic circuits
• Superselection rules and bosonic quantum computational resources
• Tessellation codes: encoded quantum gates by geometric rotation
• Nonlinear stochastic and quantum motion from Coulomb forces
• Sequential information theoretic protocols in continuous variable systems
• Resourcefulness of non-classical continuous-variable quantum gates
• Linear-optical protocols for mitigating and suppressing noise in bosonic systems
• Classical algorithms for measurement-adaptive Gaussian circuits