Embedding classical dynamics in a quantum computer

• URL: http://arxiv.org/abs/2012.06097v3
• Date: Mon, 15 Nov 2021 17:36:37 GMT
• Title: Embedding classical dynamics in a quantum computer
• Authors: Dimitrios Giannakis, Abbas Ourmazd, Philipp Pfeffer, Joerg Schumacher, Joanna Slawinska
• Abstract summary: 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. We present simulated quantum circuit experiments in Qiskit Aer, as well as actual experiments on the IBM Quantum System One.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 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 for representing classical states by density operators on a reproducing kernel Hilbert space, $\mathcal H $, and an embedding of classical observables into self-adjoint operators on $\mathcal H$. 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 an exponential quantum computational advantage, we project the state of the quantum system to a density matrix on a $2^n$-dimensional tensor product Hilbert space associated with $n$ qubits. By employing discrete Fourier-Walsh transforms, the evolution operator of the finite-dimensional quantum system is factorized into tensor product form, enabling implementation through a quantum circuit of size $O(n)$. 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 as $n\to\infty$. We present simulated quantum circuit experiments in Qiskit Aer, as well as actual experiments on the IBM Quantum System One.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Mixed Quantum-Semiclassical Simulation [0.0]
  We study the quantum simulation of mixed quantum-semiclassical (MQS) systems, of fundamental interest in many areas of physics. 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.
  arXiv  Detail & Related papers  (2023-08-30T17:02:33Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Quantum Simulation of Open Quantum Systems Using Density-Matrix Purification [0.0]
  We present a general framework for OQSs where the system's $d times d$ density matrix is recast as a $d2$ wavefunction. We demonstrate this method on a two-level system in a zero temperature amplitude damping channel and a two-site quantum Ising model.
  arXiv  Detail & Related papers  (2022-07-14T17:59:19Z)
• Non-commutative phase-space Lotka-Volterra dynamics: the quantum analogue [0.0]
  The Lotka-Volterra (LV) dynamics is investigated in the framework of the Weyl-Wigner (WW) quantum mechanics (QM) The WW framework provides the ground for identifying how classical and quantum evolution coexist at different scales. The generality of the framework developed here extends the boundaries of the understanding of quantum-like effects on competitive microscopical bio-systems.
  arXiv  Detail & Related papers  (2022-06-14T11:23:04Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Probing quantum effects with classical stochastic analogs [0.0]
  We propose a method to construct a classical analog of an open quantum system. The classical analog is made out of a collection of identical wells where classical particles of mass $m$ are trapped.
  arXiv  Detail & Related papers  (2020-12-13T18:02:27Z)

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.