Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2308.16147

Mixed Quantum-Semiclassical Simulation

Javier Gonzalez-Conde, Andrew T. Sornborger

Published Aug 30, 2023• 9 citations
arXivHTMLPDF

Abstract

We study the quantum simulation of mixed quantum-semiclassical (MQS) systems, of fundamental interest in many areas of physics, such as molecular scattering and gravitational backreaction. A basic question for these systems is whether quantum algorithms of MQS systems would be valuable at all, when one could instead study the full quantum-quantum system. We study MQS simulations in the context where a semiclassical system is encoded in a Koopman-von Neumann (KvN) Hamiltonian and a standard quantum Hamiltonian describes the quantum system. In this case, because KvN and quantum Hamiltonians are constructed with the same operators on a Hilbert space, standard theorems guaranteeing simulation efficiency apply. We show that, in this context, $\textit{many-body}$ MQS particle simulations give only nominal improvements in qubit resources over quantum-quantum simulations due to logarithmic scaling in the ratio, $S_q/S_c$, of actions between quantum and semiclassical systems. However, $\textit{field}$ simulations can give improvements proportional to the ratio of quantum to semiclassical actions, $S_q/S_c$. Of particular note, due to the ratio $S_q/S_c \sim 10^{-18}$ of particle and gravitational fields, this approach could be important for semiclassical gravity. We demonstrate our approach in a model of gravitational interaction, where a harmonic oscillator mediates the interaction between two spins. In particular, we demonstrate a lack of distillable entanglement generation between spins due to classical mediators, a distinct difference in dynamics relative to the fully quantum case.

DOI
10.48550/arxiv.2308.16147

Related papers

Hybrid quantum-classical simulations of semiclassical gravity

Carlos Fulgado-Claudio, Daniel González-Cuadra, Jose Beltrán Jiménez +1 more

We propose a hybrid quantum-classical algorithm for the simulation of real-time dynamics in interacting quantum field theories coupled to classical fields, focusing on the self-consistent estimation of semiclassical backreaction. By discretizing space and time, we construct an iterative protocol that simulates the Trotterized dynamics of the quantum fields subject to the dynamical classical fields. By estimating certain quantum expectation values through a set of projective measurements, we source the equations of motion of the classical fields, and solve them numerically to feed them forward to the quantum simulation in an iterative self-consistent loop. Semiclassical backreaction is relevant in various fields of physics, particularly in cosmology, where quantum matter fluctuations affect the gravitational field dynamics, and a controlled renormalization must be carefully considered to get a sensible continuum limit. We benchmark our algorithm in this context, focusing on scalar-tensor theories of modified gravity exhibiting a chameleon mechanism, such that a light classical scalar field driving cosmic acceleration becomes massive in high-density regions, effectively screening any possible yet unobserved fifth force. By focusing on numerically tractable regimes, we explicitly show the convergence and robustness of our algorithm when considering the continuum limit and the effect of quantum shot noise. Our work paves the way for future experiments exploring other non-tractable regimes, including non-perturbative interactions of the quantum fields and how these can change backreaction and the gravitational dynamics.

gr-qcCross-listedarXiv:2603.06511•Mar 9, 2026•1 citation

Improved Quantum Algorithms for Simulating Many-Body Systems

Sophia Simon

Quantum computers are expected to significantly outperform classical computers for certain computational tasks. One of the most promising applications is the simulation of many-body systems such as complex molecules or materials. In this thesis, we present several quantum algorithms for simulating many-body systems that can provide considerably better scaling than prior approaches. First, we describe a fully coherent quantum algorithm for simulating molecular dynamics within the Born-Oppenheimer approximation that leads to super-polynomially better scaling with respect to the error tolerance than previous work. Our algorithm utilizes the Koopman-von Neumann formulation of classical mechanics. This allows us to express the classical equations of motion as unitary dynamics which can be efficiently simulated on a quantum computer. We demonstrate that these simulations can be performed either at constant energy or at constant temperature. The latter allows us to estimate thermodynamic properties such as the Helmholtz free energy of the system. Next, we present two closely related quantum algorithms for solving continuous optimization problems such as finding the equilibrium configurations of molecules. These algorithms do not require any explicit gradient estimations. Instead, we encode the optimization problem into the dynamics of a quantum or classical system with friction. The dynamics are governed by a carefully chosen time-dependent Hamiltonian and thus can be simulated using efficient Hamiltonian simulation algorithms. We provide evidence that our fully coherent quantum algorithms can, in certain cases, provide exponentially better asymptotic scaling than approaches based on gradient descent. Lastly, we present a quantum algorithm for preparing the ground state of a set of interacting systems that can circumvent the exponential scaling suggested by the Van Vleck catastrophe. Our algorithm utilizes a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems. We provide rigorous bounds for this approach and show that, under certain assumptions, our algorithm scales only quasi-polynomially with the number of systems.

•Jun 1, 2026•0 citations

Classical simulation of quantum many-body systems

Yichen Huang

Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).

•Jan 1, 2015•19 citations

Implementing the Koopman-von Neumann approach on continuous-variable photonic quantum computers

Xinfeng Gao, Olivier Pfister, Stefan Bekiranov

The Koopman-von Neumann (KvN) formalism recasts classical mechanics in a Hilbert space framework using complex wavefunctions and linear operators, akin to quantum mechanics. Instead of evolving probability densities in phase space (as in Liouville's equation), KvN uses a Schrödinger-like equation for a classical wavefunction, with commuting position and momentum operators. Mapped to quantum computing, KvN offers a promising route to simulate classical dynamical systems using quantum algorithms by leveraging unitary evolution and quantum linear algebra tools, potentially enabling efficient classical-to-quantum mappings without invoking full quantum uncertainty. In this work, we specifically explore the implementation of the KvN approach on continuous-variable photonic quantum computing architectures, with the goals of leveraging quantum simulation for both sampling and computing intractable nonlinear dynamics. We will demonstrate its implementation and feasibility with two problems: the harmonic oscillator and a 1D partial differential equation governing nonlinear dynamics.

quant-pharXiv:2512.13887•AIAA SciTech Forum•Dec 17, 2025•0 citations

Semiclassical Theory of Few- and Many-body Quantum Systems with Short-range Interactions

Quirin Hummel

The thesis addresses the fundamental interplay between indistinguishability and interactions in few- and many-body quantum systems, treated in two separate approaches, both analytic in nature, using semiclassical methods. The few-body sector, considering a strictly fixed number of particles, is addressed within the framework of first quantization. By sticking to descriptions as (micro-)canonical ensembles the approach overcomes the inappropriate use of virial expansions. It is based on cluster expansions where quantum statistics are treated exactly and interparticle forces are described non-perturbatively. After a full formal development the cluster expansions are supplemented with short-time dynamical information that is equated with the description of smooth spectral properties or equivalently temperatures above strong quantum degeneracy, which, in the single-particle context, is the essential ingredient to what is known as semiclassical Weyl expansions. This reduction allows for the fully analytical description of universal features of large classes of systems by either truncating to a specific class of allowed collision processes, i.e., two-body collisions, or by extracting higher-order interaction kernels from related integrable models. The consistent combination with scaling considerations, minimal ground-state information and strong-coupling expansions leads to a toolbox providing most of the thermodynamic and spectral properties of one-dimensional systems with short-range interactions, all in terms of the lowest-order interaction kernels. The analytical results are in excellent qualitative and quantitative agreement with extensive numerical simulations for both integrable and non-integrable models of experimental relevance in cold atom physics. The many-body sector is in contrast treated in the second quantized formulation of quantum mechanics making use of the well-known collection of semiclassical methods that are subsumed under the name periodic orbit theory. As these methods apply in a highly system specific manner, the attractive Bose gas on a ring is chosen as exemplary model to show a case where the semiclassical quantization of mean-field dynamics, here considered as the classical analogue, can be used to obtain analytical non-trivial information on correlation-related many-body effects, especially related to quantum critical behavior in this model. After a simplification by truncating to the lowest single-particle momentum modes the consistent application of Einstein-Brillouin-Keller quantization yields a description valid for large numbers of bosons. Besides analytically reproducing numerical spectra to high accuracy, the approach enables one to extract asymptotic scaling laws for level spacings around quantum criticality, representing properties. These (finite) energy differences are intrinsically tied to inter-particle correlations and therefore elude a more conventional description by means of a mean-field theory extended with Bogoliubov quasi particles. An application to the scrambling time of the system, related to a pseudo quantum butterfly effect that stems from a local instability, underlines the importance of the method in the otherwise inaccessible regime of extreme particle numbers.

•Jan 1, 2018•6 citations

Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems

I. Novikau, Ilon Joseph

We propose an explicit algorithm based on the Linear Combination of Hamiltonian Simulations technique to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman–von Neumann formulation of nonlinear dynamics . By including dissipation into the model, through an upwind discretization of the advection operator, we avoid spurious parasitic oscillations which usually accompany standard finite difference discretizations of the advection equation. In contrast to prior works on quantum simulation of nonlinear problems , we explain in detail how different components of the algorithm can be implemented by using the Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) methods. In addition, we discuss the general method for implementing the block-encoding (BE) required for QSP and QSVT circuits and provide explicit implementations of the BE oracles tailored to our specific test cases. We simulate the resulting circuit on a digital emulator of quantum fault-tolerant computers and investigate its complexity and success probability. The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations including the KvN and Carleman embeddings of nonlinear systems , the semiclassical Koopman-van Hove (KvH) equation, as well as the advection and Liouville equations.

arXiv:2410.03985•Computer Physics Communications•Jan 8, 2025•26 citations
We study the quantum simulation of mixed quantum-semiclassical (MQS) systems, of fundamental interest in many areas of physics, such as molecular scattering and gravitational backreaction. A basic question for these systems is whether quantum algorithms of MQS systems would be valuable at all, when one could instead study the full quantum-quantum system. We study MQS simulations in the context where a semiclassical system is encoded in a Koopman-von Neumann (KvN) Hamiltonian and a standard quantum Hamiltonian describes the quantum system. In this case, because KvN and quantum Hamiltonians are constructed with the same operators on a Hilbert space, standard theorems guaranteeing simulation efficiency apply. We show that, in this context, many-body\textit{many-body}many-body MQS particle simulations give only nominal improvements in qubit resources over quantum-quantum simulations due to logarithmic scaling in the ratio, Sq/ScS_q/S_cSq​/Sc​, of actions between quantum and semiclassical systems. However, field\textit{field}field simulations can give improvements proportional to the ratio of quantum to semiclassical actions, Sq/ScS_q/S_cSq​/Sc​. Of particular note, due to the ratio Sq/Sc∼10−18S_q/S_c \sim 10^{-18}Sq​/Sc​∼10−18 of particle and gravitational fields, this approach could be important for semiclassical gravity. We demonstrate our approach in a model of gravitational interaction, where a harmonic oscillator mediates the interaction between two spins. In particular, we demonstrate a lack of distillable entanglement generation between spins due to classical mediators, a distinct difference in dynamics relative to the fully quantum case.
We propose a hybrid quantum-classical algorithm for the simulation of real-time dynamics in interacting quantum field theories coupled to classical fields, focusing on the self-consistent estimation of semiclassical backreaction. By discretizing space and time, we construct an iterative protocol that simulates the Trotterized dynamics of the quantum fields subject to the dynamical classical fields. By estimating certain quantum expectation values through a set of projective measurements, we source the equations of motion of the classical fields, and solve them numerically to feed them forward to the quantum simulation in an iterative self-consistent loop. Semiclassical backreaction is relevant in various fields of physics, particularly in cosmology, where quantum matter fluctuations affect the gravitational field dynamics, and a controlled renormalization must be carefully considered to get a sensible continuum limit. We benchmark our algorithm in this context, focusing on scalar-tensor theories of modified gravity exhibiting a chameleon mechanism, such that a light classical scalar field driving cosmic acceleration becomes massive in high-density regions, effectively screening any possible yet unobserved fifth force. By focusing on numerically tractable regimes, we explicitly show the convergence and robustness of our algorithm when considering the continuum limit and the effect of quantum shot noise. Our work paves the way for future experiments exploring other non-tractable regimes, including non-perturbative interactions of the quantum fields and how these can change backreaction and the gravitational dynamics.
Quantum computers are expected to significantly outperform classical computers for certain computational tasks. One of the most promising applications is the simulation of many-body systems such as complex molecules or materials. In this thesis, we present several quantum algorithms for simulating many-body systems that can provide considerably better scaling than prior approaches. First, we describe a fully coherent quantum algorithm for simulating molecular dynamics within the Born-Oppenheimer approximation that leads to super-polynomially better scaling with respect to the error tolerance than previous work. Our algorithm utilizes the Koopman-von Neumann formulation of classical mechanics. This allows us to express the classical equations of motion as unitary dynamics which can be efficiently simulated on a quantum computer. We demonstrate that these simulations can be performed either at constant energy or at constant temperature. The latter allows us to estimate thermodynamic properties such as the Helmholtz free energy of the system. Next, we present two closely related quantum algorithms for solving continuous optimization problems such as finding the equilibrium configurations of molecules. These algorithms do not require any explicit gradient estimations. Instead, we encode the optimization problem into the dynamics of a quantum or classical system with friction. The dynamics are governed by a carefully chosen time-dependent Hamiltonian and thus can be simulated using efficient Hamiltonian simulation algorithms. We provide evidence that our fully coherent quantum algorithms can, in certain cases, provide exponentially better asymptotic scaling than approaches based on gradient descent. Lastly, we present a quantum algorithm for preparing the ground state of a set of interacting systems that can circumvent the exponential scaling suggested by the Van Vleck catastrophe. Our algorithm utilizes a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems. We provide rigorous bounds for this approach and show that, under certain assumptions, our algorithm scales only quasi-polynomially with the number of systems.
Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).
The Koopman-von Neumann (KvN) formalism recasts classical mechanics in a Hilbert space framework using complex wavefunctions and linear operators, akin to quantum mechanics. Instead of evolving probability densities in phase space (as in Liouville's equation), KvN uses a Schrödinger-like equation for a classical wavefunction, with commuting position and momentum operators. Mapped to quantum computing, KvN offers a promising route to simulate classical dynamical systems using quantum algorithms by leveraging unitary evolution and quantum linear algebra tools, potentially enabling efficient classical-to-quantum mappings without invoking full quantum uncertainty. In this work, we specifically explore the implementation of the KvN approach on continuous-variable photonic quantum computing architectures, with the goals of leveraging quantum simulation for both sampling and computing intractable nonlinear dynamics. We will demonstrate its implementation and feasibility with two problems: the harmonic oscillator and a 1D partial differential equation governing nonlinear dynamics.
The thesis addresses the fundamental interplay between indistinguishability and interactions in few- and many-body quantum systems, treated in two separate approaches, both analytic in nature, using semiclassical methods. The few-body sector, considering a strictly fixed number of particles, is addressed within the framework of first quantization. By sticking to descriptions as (micro-)canonical ensembles the approach overcomes the inappropriate use of virial expansions. It is based on cluster expansions where quantum statistics are treated exactly and interparticle forces are described non-perturbatively. After a full formal development the cluster expansions are supplemented with short-time dynamical information that is equated with the description of smooth spectral properties or equivalently temperatures above strong quantum degeneracy, which, in the single-particle context, is the essential ingredient to what is known as semiclassical Weyl expansions. This reduction allows for the fully analytical description of universal features of large classes of systems by either truncating to a specific class of allowed collision processes, i.e., two-body collisions, or by extracting higher-order interaction kernels from related integrable models. The consistent combination with scaling considerations, minimal ground-state information and strong-coupling expansions leads to a toolbox providing most of the thermodynamic and spectral properties of one-dimensional systems with short-range interactions, all in terms of the lowest-order interaction kernels. The analytical results are in excellent qualitative and quantitative agreement with extensive numerical simulations for both integrable and non-integrable models of experimental relevance in cold atom physics. The many-body sector is in contrast treated in the second quantized formulation of quantum mechanics making use of the well-known collection of semiclassical methods that are subsumed under the name periodic orbit theory. As these methods apply in a highly system specific manner, the attractive Bose gas on a ring is chosen as exemplary model to show a case where the semiclassical quantization of mean-field dynamics, here considered as the classical analogue, can be used to obtain analytical non-trivial information on correlation-related many-body effects, especially related to quantum critical behavior in this model. After a simplification by truncating to the lowest single-particle momentum modes the consistent application of Einstein-Brillouin-Keller quantization yields a description valid for large numbers of bosons. Besides analytically reproducing numerical spectra to high accuracy, the approach enables one to extract asymptotic scaling laws for level spacings around quantum criticality, representing properties. These (finite) energy differences are intrinsically tied to inter-particle correlations and therefore elude a more conventional description by means of a mean-field theory extended with Bogoliubov quasi particles. An application to the scrambling time of the system, related to a pseudo quantum butterfly effect that stems from a local instability, underlines the importance of the method in the otherwise inaccessible regime of extreme particle numbers.
We propose an explicit algorithm based on the Linear Combination of Hamiltonian Simulations technique to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman–von Neumann formulation of nonlinear dynamics . By including dissipation into the model, through an upwind discretization of the advection operator, we avoid spurious parasitic oscillations which usually accompany standard finite difference discretizations of the advection equation. In contrast to prior works on quantum simulation of nonlinear problems , we explain in detail how different components of the algorithm can be implemented by using the Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) methods. In addition, we discuss the general method for implementing the block-encoding (BE) required for QSP and QSVT circuits and provide explicit implementations of the BE oracles tailored to our specific test cases. We simulate the resulting circuit on a digital emulator of quantum fault-tolerant computers and investigate its complexity and success probability. The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations including the KvN and Carleman embeddings of nonlinear systems , the semiclassical Koopman-van Hove (KvH) equation, as well as the advection and Liouville equations.