Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics

• URL: http://arxiv.org/abs/2003.09980v4
• Date: Fri, 18 Sep 2020 17:24:11 GMT
• Title: Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics
• Authors: Ilon Joseph
• Abstract summary: Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space. Koopman-von Neumann formulation implies that the conservation of the probability distribution function on phase space can be recast as an equivalent Schr"odinger equation on Hilbert space. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman-von Neumann formulation of classical mechanics. The Koopman-von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schr\"odinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schr\"odinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman-von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

Related papers

• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• Quantum simulation of the Fokker-Planck equation via Schrodingerization [33.76659022113328]
  This paper studies a quantum simulation technique for solving the Fokker-Planck equation. We employ the Schrodingerization method-it converts any linear partial and ordinary differential equation with non-Hermitian dynamics into systems of Schrodinger-type equations.
  arXiv  Detail & Related papers  (2024-04-21T08:53:27Z)
• How to Map Linear Differential Equations to Schr\"{o}dinger Equations via Carleman and Koopman-von Neumann Embeddings for Quantum Algorithms [1.6003521378074745]
  We investigate the conditions for linear differential equations to be mapped to the Schr"odinger equation and solved on a quantum computer. We compute the computational complexity associated with estimating the expected values of an observable. These results are important in the construction of quantum algorithms for solving differential equations of large-degree-of-freedom.
  arXiv  Detail & Related papers  (2023-11-27T08:48:56Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via Schrodingerisation [32.104513049339936]
  We introduce the quantum Jacobi and quantum power methods for solving the quantum linear systems of equations. The proposed quantum simulation can be performed on either discrete-variable quantum systems or on hybrid continuous-variable and discrete-variable quantum systems.
  arXiv  Detail & Related papers  (2023-04-06T04:55:15Z)
• Quantum simulation of partial differential equations via Schrodingerisation [31.986350313948435]
  We present a simple new way to simulate general linear partial differential equations via quantum simulation. Using a simple new transform, referred to as the warped phase transformation, any linear partial differential equation can be recast into a system of Schrodinger's equations. This can be seen directly on the level of the dynamical equations without more sophisticated methods.
  arXiv  Detail & Related papers  (2022-12-28T17:32:38Z)
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations [31.986350313948435]
  We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations. We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations.
  arXiv  Detail & Related papers  (2022-09-18T05:50:23Z)
• Emergent Quantum Mechanics at the Boundary of a Local Classical Lattice Model [0.0]
  We formulate a conceptually new model in which quantum mechanics emerges from classical mechanics. We analytically estimate how much the model deviates from quantum mechanics.
  arXiv  Detail & Related papers  (2022-07-19T18:00:00Z)
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation [0.0]
  We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits. The classical computational algorithm exploits a specific restriction in classical phase space which directly captures the quantum uncertainty relation.
  arXiv  Detail & Related papers  (2021-06-21T06:43:34Z)
• Objective trajectories in hybrid classical-quantum dynamics [0.0]
  We introduce several toy models in which to study hybrid classical-quantum evolution. We present an unravelling approach to calculate the dynamics, and provide code to numerically simulate it.
  arXiv  Detail & Related papers  (2020-11-11T19:00:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.