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:2012.06097 · Physical Review A

Embedding classical dynamics in a quantum computer

Dimitrios Giannakis, A. Ourmazd, Philipp Pfeffer, Jörg Schumacher, Joanna Sławińska

Published May 3, 2022• 41 citations
arXivHTMLPDF

Abstract

We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides an operator-theoretic representation of classical dynamics by combining ergodic theory with quantum information science. The resulting quantum embedding of classical dynamics (QECD) enables efficient simulation of spaces of classical observables with exponentially large dimension using a quadratic number of quantum gates. The QECD framework is based on a quantum feature map that we introduce for representing classical states by density operators on a reproducing kernel Hilbert space, $\mathcal{H}$. Furthermore, an embedding of classical observables into self-adjoint operators on $\mathcal{H}$ is established, such that quantum mechanical expectation values are consistent with pointwise function evaluation. In this scheme, quantum states and observables evolve unitarily under the lifted action of Koopman evolution operators of the classical system. Moreover, by virtue of the reproducing property of $\mathcal{H}$, the quantum system is pointwise-consistent with the underlying classical dynamics. To achieve a quantum computational advantage, we project the state of the quantum system onto a finite-rank density operator on a ${2}^{n}$-dimensional tensor product Hilbert space associated with $n$ qubits. By employing discrete Fourier-Walsh transforms of spectral functions, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through an $n$-channel quantum circuit of size $O(n)$ and no interchannel communication. Furthermore, the circuit features a state preparation stage, also of size $O(n)$, and a quantum Fourier transform stage of size $O({n}^{2})$, which makes predictions of observables possible by measurement in the standard computational basis. We prove theoretical convergence results for these predictions in the large-qubit limit, $n\ensuremath{\rightarrow}\ensuremath{\infty}$. In light of these properties, QECD provides a consistent simulator of the evolution of classical observables, realized through projective quantum measurement, which is able to simulate spaces of classical observables of dimension ${2}^{n}$ using circuits of size $O({n}^{2})$. We demonstrate the consistency of the scheme in prototypical dynamical systems involving periodic and quasiperiodic oscillators on tori. These examples include simulated quantum circuit experiments in Qiskit Aer, as well as actual experiments on the IBM Quantum System One.

DOI
10.1103/physreva.105.052404

Related papers

Quantum compiler for classical dynamics

Dimitrios Giannakis, A. Ourmazd, Joanna Sławińska +1 more

We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum information science. The resulting \emph{quantum compiler} enables efficient simulation of spaces of classical observables with exponentially large dimension using a quadratic number of quantum gates. The compiler is based on a quantum feature map that we introduce for representing classical states by density operators on a reproducing kernel Hilbert space, $\mathcal H$. Furthermore, an embedding of classical observables into self-adjoint operators on $\mathcal H$ is established, such that quantum mechanical expectation values are consistent with pointwise function evaluation. In this scheme, quantum states and observables evolve unitarily under the lifted action of the Koopman evolution operators of the classical system. Moreover, by virtue of the reproducing property of $\mathcal H$, the quantum system is pointwise-consistent with the underlying classical dynamics. To achieve an exponential quantum computational advantage, we project the state of the quantum system onto a finite-rank density operator on a $2^n$-dimensional tensor product Hilbert space associated with $n$ qubits. By employing discrete Fourier-Walsh transforms of spectral functions, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through an $n$-channel quantum circuit with an $O(n)$ gates and no interchannel communication. Furthermore, the circuit features a quantum Fourier transform stage with $O(n^2)$ gates, which generates predictions by measurement in the standard computational basis. We implement the framework in Qiskit, and demonstrate its consistency for prototypical periodic and quasiperiodic systems.

Bulletin of the American Physical Society•Dec 11, 2020•1 citation

Koopman and transfer operator techniques from the perspective of quantum theory

Dimitrios Giannakis, Michael Montgomery

The study of mathematical connections between operator-theoretic formulations of classical dynamics and quantum mechanics began at least as early as the 1930s in work of Koopman and von Neumann and was developed in later decades by many authors, often independently, into a framework now broadly known as Koopman-von Neumann representation of classical dynamics. This article surveys aspects of this framework for measure-preserving ergodic dynamical systems and connects it with recent approximation techniques for Koopman and transfer operators that are amenable to data-driven numerical implementation. In broad terms, these methods are based on representations of (i) classical observables as elements of an algebra of operators acting on a Hilbert space; and (ii) classical probability measures as elements of the state space of that algebra, with lifted versions of the Koopman and transfer operators inducing dynamical evolution of observables and states, respectively. A common theme underlying the techniques surveyed here is the use of reproducing kernel Hilbert spaces with coalgebra structure (so-called "reproducing kernel Hilbert algebras'') that aids the quantum representation of classical objects, as well as the use of Fock spaces to build approximation schemes with high expressivity and structure preservation properties (notably, preservation of positivity and multiplicativity of composition operators). Applications to quantum algorithms for approximating the Koopman evolution of observables in systems with pure point spectra are also discussed.

math.DSCross-listedarXiv:2603.20102•Operator Theory•Mar 23, 2026•1 citation

Symplectic perspective to quantum computing for Hamiltonian systems

Efstratios Koukoutsis, Kyriakos Hizanidis, Lucas I Inigo Gamiz +4 more

This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a two-fold way. The first part is devoted in establishing an exact correspondence between quantum evolution and classical Hamiltonian flow on a Kahler manifold. This correspondence enables a geometric quantization scheme that identifies a family of classical Hamiltonian systems admitting exponentially compressed quantum representations-appropriate for quantum simulation. In the second part we demonstrate that Liouville-integrable Hamiltonian dynamics induce finite-dimensional unitary evolution through action-angle variables and Koopman-von Neumann encoding. This allows efficient quantum representation and parallel evolution of large phase-space ensembles, where entangled encodings provide exponential compression in ensemble size and enable quantum speed-ups in observable estimation via amplitude estimation techniques. For non-integrable systems, Lie canonical perturbation theory is incorporated to construct near-symplectic transformations that map dynamics to approximately integrable forms, preserving unitary evolution up to a controlled error. We derive the resulting quantum computational complexity of the proposed quantum-symplectic scheme, revealing both an exponential compression in memory requirements and a potential polynomial speed-up with respect to the system size. Finally, the transport evolution equation governing the quantum phase-space observables is obtained.

quant-pharXiv:2604.10794•Apr 14, 2026•1 citation

Quantum simulation of real-world nonlinear dynamics via Koopman method

Baoyang Zhang, Dong An, Zhaoyuan Meng +4 more

Nonlinear dynamics is ubiquitous in nature, ranging from chemical pattern formation to ocean circulation, yet its simulation on quantum computers is fundamentally limited by the unitary nature of quantum evolution. We propose the quantum Koopman method, a data-driven framework that embeds nonlinear dynamics into a learned linear representation and implements the resulting evolution using shallow quantum circuits. This method learns Koopman observables from trajectory data, projects the lifted dynamics onto a finite-dimensional subspace, and decomposes the corresponding non-unitary propagator into parallel spectral channels. We utilize the Koopman method on a superconducting processor to simulate three distinct nonlinear systems, comprising reaction-diffusion dynamics, fluid motion on a sphere, and satellite-derived observations of Gulf Stream currents, employing up to 32 parallel circuits of 10 qubits. These quantum simulations capture the dominant multiscale patterns and statistical signatures of the underlying dynamics, and reveal a transition from performance limited by hardware noise in weakly nonlinear systems to performance limited by finite-dimensional Koopman representations as nonlinear scale interactions increase. This transition identifies a practical boundary for quantum-amenable nonlinear dynamics, establishing a hardware-validated route for simulating moderately nonlinear dynamics on near-term quantum hardware.

quant-pharXiv:2607.07338•Jul 9, 2026•2 citations

Simulation of quantum algorithms using classical probabilistic bits and circuits

Deniz D. Yavuz, Anirudh Yadav

We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a classical random variable with eight probabilistic outcomes). The key idea in this mapping is to store both the amplitude and phase information of the complex coefficients that describe the qubit state in the probabilities. Due to the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces, $n$ qubits are then mapped to a tensor product of $n$ 8-dimensional probabilistic vectors (i.e., the Hilbert space of dimension $2^n$ is mapped to a probability space of dimension $8^n$). After this initial mapping, we show how to implement the analogs of single-qubit and two-qubit gates in the probability space using correlation-inducing operations on these classical random variables. The key defining feature of both the mapping to the probability space and the transformations in this space (i.e., operations on the random variables) is that they are not linear, but instead affine. Using this architecture, the evolution of the $2^n$ complex coefficients of the quantum system can be tracked in the joint fully-correlated probabilities of the polynomial number of random variables. We then give specific procedures for implementing (1) the Deutsch-Jozsa algorithm, and (2) the Quantum Fourier Transform in the probability space. Identical to the Quantum case, simulating the Quantum Fourier Transform in the probability space requires $O(n)$ probabilistic bits and $O(n^2)$ (i.e., quadratic in the number of quantum bits) operations.

arXiv:2307.14452•Jul 26, 2023•1 citation

Embedding quantum simulators

Roberto Di Candia

Quantum simulations consist in the reproduction of the dynamics of a quantum systemon a controllable platform, with the goal of capturing an interesting feature of the considered model. It is broadly believed that the advent of quantum simulators will represent a technological revolution, as they promise to solve several problems whichare considered intractable in a classical computer. Although there are strong theoretical bases confirming this claim, several aspects of quantum simulators have still to bestudied, in order to faith fully prove their feasibility. More over, the general question on which features of the considered models are simulatable is an attractive research topic,whose study would help to define the limits of a quantum simulator.In this Thesis, we develop several algorithms, which are able to catch relevant properties of the simulated quantum model. The proposed protocols follow a new concept named embedding quantum simulator, in which the simulated Schrodinger equation is mapped onto an enlarged Hilbert space in a nontrivial way. Via this embedding, weare able to retrieve, by measuring few observables, quantities that generally require full tomography in order to be evaluated. Moreover, we pay a special attention to the experimental feasibility, defining mappings which are space efficient, and do not require the implementation of challenging Hamiltonians. The presented algorithms are general,and they may be implemented in several quantum platforms, e.g. photonics, trappedions, circuit QED, among others.First, we propose a protocol which simulate the dynamics of an embedded Hamiltonian,allowing for the efficient extraction of a class of entanglement monotones. This is done using an embedding that is able to implement unphysical operations, as is the case of complex conjugation. The analysis is accompanied with a study of feasibility in a trapped-ion setup, which can be generalised to other platforms following similar computational models. Second, we propose an algorithm to measure n-time correlation functions of spinorial, fermionic, and bosonic operators, by considerably improving previous versions of the same result. We apply this protocol to the computation of magnetic susceptibilities, as well as to the simulation of Markovian and non-Markovian dissipative processes in a novel way, without the necessity of engineering any bath. All the proposed protocols are designed with a single ancillary qubit, minimising the needed experimental resources.We believe that embedding quantum simulators have a potential to become a powerful tool in the quantum simulation theory, since they pave the way for improving the flexibility of a quantum simulator in diferent experimental contexts.

Bulletin of the American Physical Society•Mar 6, 2014•0 citations
We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides an operator-theoretic representation of classical dynamics by combining ergodic theory with quantum information science. The resulting quantum embedding of classical dynamics (QECD) enables efficient simulation of spaces of classical observables with exponentially large dimension using a quadratic number of quantum gates. The QECD framework is based on a quantum feature map that we introduce for representing classical states by density operators on a reproducing kernel Hilbert space, H\mathcal{H}H. Furthermore, an embedding of classical observables into self-adjoint operators on H\mathcal{H}H is established, such that quantum mechanical expectation values are consistent with pointwise function evaluation. In this scheme, quantum states and observables evolve unitarily under the lifted action of Koopman evolution operators of the classical system. Moreover, by virtue of the reproducing property of H\mathcal{H}H, the quantum system is pointwise-consistent with the underlying classical dynamics. To achieve a quantum computational advantage, we project the state of the quantum system onto a finite-rank density operator on a 2n{2}^{n}2n-dimensional tensor product Hilbert space associated with nnn qubits. By employing discrete Fourier-Walsh transforms of spectral functions, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through an nnn-channel quantum circuit of size O(n)O(n)O(n) and no interchannel communication. Furthermore, the circuit features a state preparation stage, also of size O(n)O(n)O(n), and a quantum Fourier transform stage of size O(n2)O({n}^{2})O(n2), which makes predictions of observables possible by measurement in the standard computational basis. We prove theoretical convergence results for these predictions in the large-qubit limit, n\ensuremath→\ensuremath∞n\ensuremath{\rightarrow}\ensuremath{\infty}n\ensuremath→\ensuremath∞. In light of these properties, QECD provides a consistent simulator of the evolution of classical observables, realized through projective quantum measurement, which is able to simulate spaces of classical observables of dimension 2n{2}^{n}2n using circuits of size O(n2)O({n}^{2})O(n2). We demonstrate the consistency of the scheme in prototypical dynamical systems involving periodic and quasiperiodic oscillators on tori. These examples include simulated quantum circuit experiments in Qiskit Aer, as well as actual experiments on the IBM Quantum System One.
We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum information science. The resulting \emph{quantum compiler} enables efficient simulation of spaces of classical observables with exponentially large dimension using a quadratic number of quantum gates. The compiler is based on a quantum feature map that we introduce for representing classical states by density operators on a reproducing kernel Hilbert space, H\mathcal HH. Furthermore, an embedding of classical observables into self-adjoint operators on H\mathcal HH is established, such that quantum mechanical expectation values are consistent with pointwise function evaluation. In this scheme, quantum states and observables evolve unitarily under the lifted action of the Koopman evolution operators of the classical system. Moreover, by virtue of the reproducing property of H\mathcal HH, the quantum system is pointwise-consistent with the underlying classical dynamics. To achieve an exponential quantum computational advantage, we project the state of the quantum system onto a finite-rank density operator on a 2n2^n2n-dimensional tensor product Hilbert space associated with nnn qubits. By employing discrete Fourier-Walsh transforms of spectral functions, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through an nnn-channel quantum circuit with an O(n)O(n)O(n) gates and no interchannel communication. Furthermore, the circuit features a quantum Fourier transform stage with O(n2)O(n^2)O(n2) gates, which generates predictions by measurement in the standard computational basis. We implement the framework in Qiskit, and demonstrate its consistency for prototypical periodic and quasiperiodic systems.
The study of mathematical connections between operator-theoretic formulations of classical dynamics and quantum mechanics began at least as early as the 1930s in work of Koopman and von Neumann and was developed in later decades by many authors, often independently, into a framework now broadly known as Koopman-von Neumann representation of classical dynamics. This article surveys aspects of this framework for measure-preserving ergodic dynamical systems and connects it with recent approximation techniques for Koopman and transfer operators that are amenable to data-driven numerical implementation. In broad terms, these methods are based on representations of (i) classical observables as elements of an algebra of operators acting on a Hilbert space; and (ii) classical probability measures as elements of the state space of that algebra, with lifted versions of the Koopman and transfer operators inducing dynamical evolution of observables and states, respectively. A common theme underlying the techniques surveyed here is the use of reproducing kernel Hilbert spaces with coalgebra structure (so-called "reproducing kernel Hilbert algebras'') that aids the quantum representation of classical objects, as well as the use of Fock spaces to build approximation schemes with high expressivity and structure preservation properties (notably, preservation of positivity and multiplicativity of composition operators). Applications to quantum algorithms for approximating the Koopman evolution of observables in systems with pure point spectra are also discussed.
This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a two-fold way. The first part is devoted in establishing an exact correspondence between quantum evolution and classical Hamiltonian flow on a Kahler manifold. This correspondence enables a geometric quantization scheme that identifies a family of classical Hamiltonian systems admitting exponentially compressed quantum representations-appropriate for quantum simulation. In the second part we demonstrate that Liouville-integrable Hamiltonian dynamics induce finite-dimensional unitary evolution through action-angle variables and Koopman-von Neumann encoding. This allows efficient quantum representation and parallel evolution of large phase-space ensembles, where entangled encodings provide exponential compression in ensemble size and enable quantum speed-ups in observable estimation via amplitude estimation techniques. For non-integrable systems, Lie canonical perturbation theory is incorporated to construct near-symplectic transformations that map dynamics to approximately integrable forms, preserving unitary evolution up to a controlled error. We derive the resulting quantum computational complexity of the proposed quantum-symplectic scheme, revealing both an exponential compression in memory requirements and a potential polynomial speed-up with respect to the system size. Finally, the transport evolution equation governing the quantum phase-space observables is obtained.
Nonlinear dynamics is ubiquitous in nature, ranging from chemical pattern formation to ocean circulation, yet its simulation on quantum computers is fundamentally limited by the unitary nature of quantum evolution. We propose the quantum Koopman method, a data-driven framework that embeds nonlinear dynamics into a learned linear representation and implements the resulting evolution using shallow quantum circuits. This method learns Koopman observables from trajectory data, projects the lifted dynamics onto a finite-dimensional subspace, and decomposes the corresponding non-unitary propagator into parallel spectral channels. We utilize the Koopman method on a superconducting processor to simulate three distinct nonlinear systems, comprising reaction-diffusion dynamics, fluid motion on a sphere, and satellite-derived observations of Gulf Stream currents, employing up to 32 parallel circuits of 10 qubits. These quantum simulations capture the dominant multiscale patterns and statistical signatures of the underlying dynamics, and reveal a transition from performance limited by hardware noise in weakly nonlinear systems to performance limited by finite-dimensional Koopman representations as nonlinear scale interactions increase. This transition identifies a practical boundary for quantum-amenable nonlinear dynamics, establishing a hardware-validated route for simulating moderately nonlinear dynamics on near-term quantum hardware.
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a classical random variable with eight probabilistic outcomes). The key idea in this mapping is to store both the amplitude and phase information of the complex coefficients that describe the qubit state in the probabilities. Due to the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces, nnn qubits are then mapped to a tensor product of nnn 8-dimensional probabilistic vectors (i.e., the Hilbert space of dimension 2n2^n2n is mapped to a probability space of dimension 8n8^n8n). After this initial mapping, we show how to implement the analogs of single-qubit and two-qubit gates in the probability space using correlation-inducing operations on these classical random variables. The key defining feature of both the mapping to the probability space and the transformations in this space (i.e., operations on the random variables) is that they are not linear, but instead affine. Using this architecture, the evolution of the 2n2^n2n complex coefficients of the quantum system can be tracked in the joint fully-correlated probabilities of the polynomial number of random variables. We then give specific procedures for implementing (1) the Deutsch-Jozsa algorithm, and (2) the Quantum Fourier Transform in the probability space. Identical to the Quantum case, simulating the Quantum Fourier Transform in the probability space requires O(n)O(n)O(n) probabilistic bits and O(n2)O(n^2)O(n2) (i.e., quadratic in the number of quantum bits) operations.
Quantum simulations consist in the reproduction of the dynamics of a quantum systemon a controllable platform, with the goal of capturing an interesting feature of the considered model. It is broadly believed that the advent of quantum simulators will represent a technological revolution, as they promise to solve several problems whichare considered intractable in a classical computer. Although there are strong theoretical bases confirming this claim, several aspects of quantum simulators have still to bestudied, in order to faith fully prove their feasibility. More over, the general question on which features of the considered models are simulatable is an attractive research topic,whose study would help to define the limits of a quantum simulator.In this Thesis, we develop several algorithms, which are able to catch relevant properties of the simulated quantum model. The proposed protocols follow a new concept named embedding quantum simulator, in which the simulated Schrodinger equation is mapped onto an enlarged Hilbert space in a nontrivial way. Via this embedding, weare able to retrieve, by measuring few observables, quantities that generally require full tomography in order to be evaluated. Moreover, we pay a special attention to the experimental feasibility, defining mappings which are space efficient, and do not require the implementation of challenging Hamiltonians. The presented algorithms are general,and they may be implemented in several quantum platforms, e.g. photonics, trappedions, circuit QED, among others.First, we propose a protocol which simulate the dynamics of an embedded Hamiltonian,allowing for the efficient extraction of a class of entanglement monotones. This is done using an embedding that is able to implement unphysical operations, as is the case of complex conjugation. The analysis is accompanied with a study of feasibility in a trapped-ion setup, which can be generalised to other platforms following similar computational models. Second, we propose an algorithm to measure n-time correlation functions of spinorial, fermionic, and bosonic operators, by considerably improving previous versions of the same result. We apply this protocol to the computation of magnetic susceptibilities, as well as to the simulation of Markovian and non-Markovian dissipative processes in a novel way, without the necessity of engineering any bath. All the proposed protocols are designed with a single ancillary qubit, minimising the needed experimental resources.We believe that embedding quantum simulators have a potential to become a powerful tool in the quantum simulation theory, since they pave the way for improving the flexibility of a quantum simulator in diferent experimental contexts.