Efficient simulatability of continuous-variable circuits with large Wigner negativity

Abstract

Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, establishing such a boundary is akin to pinpointing the resources for quantum advantage; from the technological point of view, it is essential for the design of non-trivial quantum computing architectures. Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures, including those based on continuous variables (CVs). However, it is not a sufficient resource, and it is an open question under which conditions CV circuits displaying Wigner negativity offer the potential for quantum advantage. In this work we identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable, although they are not recognized as such by previously available theorems. These families of circuits employ bosonic codes based on either translational or rotational symmetries (e.g., Gottesman-Kitaev-Preskill or cat codes), and can include both Gaussian and non-Gaussian gates and measurements. Crucially, within these encodings, the computational basis states are described by intrinsically negative Wigner functions, even though they are stabilizer states if considered as codewords belonging to a finite-dimensional Hilbert space. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.

arXiv comment(v1) 21 pages, 8 figures, 3 tables. (v2) 22 pages, 9 figures, 3 tables

References in corpus (82)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum information with continuous variables
• Gaussian Quantum Information
• Efficient classical simulation of slightly entangled quantum computations
• Quantum Teleportation is a Universal Computational Primitive
• Hybrid quantum circuits: Superconducting circuits interacting with other quantum systems
• Encoding a qubit in an oscillator
• Improved Simulation of Stabilizer Circuits
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Continuous variable quantum information: Gaussian states and beyond
• On the role of entanglement in quantum computational speed-up
• Dynamically protected cat-qubits: a new paradigm for universal quantum computation
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• The Resource Theory of Stabilizer Computation
• Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform
• Positive Wigner functions render classical simulation of quantum computation efficient
• Symmetries and conserved quantities in Lindblad master equations
• Quantum error correction of a qubit encoded in grid states of an oscillator
• Deterministic generation of a two-dimensional cluster state
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• New class of quantum error-correcting codes for a bosonic mode
• Encoding a qubit in a trapped-ion mechanical oscillator
• Programmable quantum gate arrays
• Negative Quasi-Probability as a Resource for Quantum Computation
• Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
• Quantum Computing with Continuous-Variable Clusters
• Stabilizer Formalism for Operator Quantum Error Correction
• Hudson's Theorem for finite-dimensional quantum systems
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Performance and structure of single-mode bosonic codes
• Trading classical and quantum computational resources
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Resource theory of quantum non-Gaussianity and Wigner negativity
• Perspective: Toward large-scale fault-tolerant universal photonic quantum computing
• Generation of one-million-mode continuous-variable cluster state by unlimited time-domain multiplexing
• Bosonic Quantum Codes for Amplitude Damping
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Convex resource theory of non-Gaussianity
• Three-dimensional superconducting resonators at $T<20$ mK with the photon lifetime up to $\tau =2$ seconds
• Universal Control of an Oscillator with Dispersive Coupling to a Qubit
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Quantum computing with rotation-symmetric bosonic codes
• Non-Gaussian quantum states of a multimode light field
• Robust encoding of a qubit in a molecule
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Entangling Bosonic Modes via an Engineered Exchange Interaction
• Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
• Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
• Continuous-variable quantum computing in the quantum optical frequency comb
• Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
• Holonomic quantum control with continuous variable systems
• Cat codes with optimal decoherence suppression for a lossy bosonic channel
• Non-Gaussian and Gottesman-Kitaev-Preskill state preparation by photon catalysis
• A scheme for quantum teleportation between discrete and continuous encodings of an optical qubit
• Pair-cat codes: autonomous error-correction with low-order nonlinearity
• Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
• Quantum error correction against photon loss using NOON states
• Universal Gate Set for Continuous-Variable Quantum Computation with Microwave Circuits
• Generation and characterization of resource state for nonlinear cubic phase gate
• Quantum error correction against photon loss using multi-component cat states
• Standard Form of Qudit Stabilizer Groups
• Sequential modular position and momentum measurements of a trapped ion mechanical oscillator
• Production of photonic universal quantum gates enhanced by machine learning
• General implementation of arbitrary nonlinear quadrature phase gates
• Tailoring Non-Gaussian Continuous-Variable Graph States
• Unbiased Simulation of Near-Clifford Quantum Circuits
• ON states as resource units for universal quantum computation with photonic architectures
• Efficient classical simulation of Clifford circuits with nonstabilizer input states
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• Continuous-Variable Sampling from Photon-Added or Photon-Subtracted Squeezed States
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Unconditional preparation of nonclassical states via linear-and-quadratic optomechanics
• Noise Thresholds for Higher Dimensional Systems using the Discrete Wigner Function
• Nonlinearity as a resource for nonclassicality in anharmonic systems
• Efficient measurement-based quantum computing with continuous-variable systems
• An Ideal Characterization of the Clifford Operators
• Spectra of phase point operators in odd prime dimensions and the extended Clifford group
• Encoding many qubits in a rotor
• Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
• The quantum query complexity of certification
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation

Cited by in corpus (24)

• Non-Gaussian Quantum States and Where to Find Them
• Resources for bosonic quantum computational advantage
• Witnessing Wigner Negativity
• Fast simulation of bosonic qubits via Gaussian functions in phase space
• Classical simulation of Gaussian quantum circuits with non-Gaussian input states
• Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications
• Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Sufficient condition for universal quantum computation using bosonic circuits
• Hierarchical Verification of Non-Gaussian Coherence in Bosonic Quantum States
• Heralded preparation of polarization entanglement via quantum scissors
• Non-gaussian Entanglement Swapping between Three-Mode Spontaneous Parametric Down Conversion and Three Qubits
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation
• Classical simulation and quantum resource theory of non-Gaussian optics
• Clifford operations and homological codes for rotors and oscillators
• Explicit error-correction scheme and code distance for bosonic codes with rotational symmetry
• Approximating outcome probabilities of linear optical circuits
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• The Interplay between Quantum Contextuality and Wigner Negativity
• Resourcefulness of non-classical continuous-variable quantum gates
• Probing information theoretic measures of nonlinear ultracold quantum gases using phase-space distributions
• Multimode rotationally symmetric bosonic codes from group-theoretic construction
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources