Jul 2026· Quantum Science and Technology· Vol 11, pp. 045006· 0 citations· 39 references
Physics
TL;DR
It is proved that the algebra of extended Gaussian quasi-probability densities (EGQPDs) is closed under Lindblad evolution with linear jump operators, reducing the infinite-dimensional Wigner PDE to a closed system of ODEs that scales polynomially with the number of modes.
Abstract
Simulating non-Gaussian quantum dynamics in open continuous-variable systems is notoriously challenging: exact methods scale exponentially, while approximations sacrifice non-classical features such as Wigner negativity. Here we introduce an exact finite-dimensional reduction that overcomes this curse of dimensionality. We prove that the algebra of extended Gaussian quasi-probability densities (EGQPDs) is closed under Lindblad evolution with linear jump operators, reducing the infinite-dimensional Wigner PDE to a closed system of ODEs that scales polynomially with the number of modes. A necessary and sufficient condition for closure is established: the algebra remains closed iff every jump operator is at most linear; otherwise the extended algebra with polynomial prefactors is required. We further show that the minimal number of Gaussian components defines a non-Gaussian rank—a discrete complexity measure monotonically non-increasing under the dynamics. The framework yields explicit ODEs for the component parameters, admits a rigorous density theorem and error propagation bound, and provides closed-form algebraic criteria for Gaussianity, purity, and entanglement. Seven numerical experiments validate the method across Gaussian and non-Gaussian states, entanglement decay, PT-symmetric exceptional-point dynamics, and complexity scaling, demonstrating machine-precision accuracy and exponential speedups over grid and Fock methods. The EGQPD framework provides a systematic, exact, and efficient toolbox for non-Gaussian open quantum dynamics.
A quantum algorithm efficient for ranges of wave lengths, with complexity in the spatial dimension and discretization and query bounds containing {\it no} negative powers of the small wavelength, which can capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying th...
Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conven...
Adelina Bärligea, Timothy Heightman, Jakob S. Kottmann et al.· 0 citations
We develop a framework to construct large decoherence-free subspaces with a non-trivial structure. The construction is based on hybrid quantum systems in which quantum matter is coupled to a dissipative bosonic mode. Dissipation imposes a global constraint on the matter by selecting the matter null states in the long-t...
Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics?...
Gregory A. L. White, Jens Eisert, Neil Dowling· 1 citation
The eigenstate quantum-mechanical bootstrap can converge to the physical moment set while remaining nonexact at every finite order. We prove this for a one-dimensional quasi-exactly solvable sextic oscillator at explicitly known eigenvalues, including excited levels. At every finite order, the lower and upper bounds on...
Simulating nonlinear dynamics with quantum computers has gained increasing attention. In general, such simulations require additional quantum resources because unitary quantum evolution is linear. A fundamental question is how nonlinear dynamics can be embedded into fully coherent, ancilla-free unitary circuits and how...
Yuki Ito, H. Hakoshima, Keisuke Fujii· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.