Phase-space representation of classical simulability for arbitrary bosonic encodings
quant-ph
Submitted: 2025-12-05
Updated: 2026-10-10
Comments: Comments welcome!
License: http://creativecommons.org/licenses/by/4.0/
The gist: Phase-space representations can be used to reveal resources for quantum computational advantage.
Abstract
Phase-space representations can be used to reveal resources for quantum computational advantage. In odd-dimensional qudit systems, states and operations admitting non-negative quasi-probability representations are efficiently classically simulable, and analogous conclusions hold for bosonic systems, usually represented in quadrature phase space. However, when quantum information is encoded in bosonic systems, the link between physical phase-space representations and computational resources becomes nontrivial: large negativities may arise in the physical space even when the encoded model remains efficiently simulable. We establish a general framework connecting physical phase spaces of bosonic systems to the effective computational phase spaces associated with arbitrary encodings. We show that bosonic Hilbert spaces with finitely many modes can always be exactly encoded on a quantum computer, without truncation or approximations, and that for any encoding there exists an adapted physical phase-space representation in which all provably classically simulable states and protocols are non-negative. Conversely, negativity can always persist in physical representations for arbitrary encodings. Our results formalize the operational meaning of phase-space negativity in bosonic quantum information and its relation with computational resources.
Sources
- Unified framework for bosonic quantum information encoding, resources and universality from superselection rules
- Identifying quantum resources in encoded computations
- Generalized Gottesman-Kitaev-Preskill States on a Quantum Torus
- Resources for bosonic metrology: quantum-enhanced precision from a superselection rule perspective
- Wigner Functions for Arbitrary Quantum Systems
- Equivalence of continuous- and discrete-variable gate-based quantum computers with finite energy
- Energy, Bosons and Computational Complexity
- Certifying nonstabilizerness in quantum processors
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources