Analog classical simulation of closed quantum systems

• URL: http://arxiv.org/abs/2502.06311v1
• Date: Mon, 10 Feb 2025 10:01:36 GMT
• Title: Analog classical simulation of closed quantum systems
• Authors: Ka-Wa Yip,
• Abstract summary: We develop an analog classical simulation algorithm of noiseless quantum dynamics. We illustrate how to simulate the Schr"odinger equation in such a paradigm. This may pave the way to emulate quantum algorithms with physical computing devices.
• Score: 0.0
• License:
• Abstract: We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schr\"{o}dinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a complex state vector can be encoded in the continuous physical variables of an analog computer. Our algorithm reveals the full dynamics of complex probability amplitudes. Such real-time simulation is impossible in quantum simulation approaches without collapsing the state vector, and it is relatively computationally expensive for digital classical computers. For a real symmetric time-independent Hamiltonian, the ODEs may be solved by a simple analog mechanical device such as a one-dimensional spring-mass system. Since the underlying dynamics of quantum computers is governed by the Schr\"{o}dinger equation, our findings imply that analog computers can also perform quantum algorithms. We illustrate how to simulate the Schr\"{o}dinger equation in such a paradigm, with an application to quantum approximate optimization algorithm. This may pave the way to emulate quantum algorithms with physical computing devices, including analog, continuous-time circuits.

Related papers

• 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)
• Digital quantum simulator for the time-dependent Dirac equation using discrete-time quantum walks [0.7036032466145112]
  We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Our findings indicate that relativistic dynamics is achievable with quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T05:36:57Z)
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor [0.0]
  We present a quantum algorithm to perform digital quantum simulations of the BCS model on a quantum register with a star shaped connectivity map. We show how to effectively translate the problem onto the quantum hardware and implement the algorithm using only the native interactions between the qubits.
  arXiv  Detail & Related papers  (2022-09-19T17:48:45Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation [3.3917542048743865]
  We develop fully-coherent simulation algorithms based on quantum signal processing (QSP) We numerically analyze these algorithms by applying them to the simulation of spin dynamics of the Heisenberg model.
  arXiv  Detail & Related papers  (2021-10-21T17:56:33Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Computing Free Energies with Fluctuation Relations on Quantum Computers [0.0]
  We present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We successfully demonstrate a proof-of-concept of our algorithm using the transverse field Ising model on a real quantum processor.
  arXiv  Detail & Related papers  (2021-03-17T18:14:19Z)
• Computational power of one- and two-dimensional dual-unitary quantum circuits [0.6946929968559495]
  Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. We make use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics.
  arXiv  Detail & Related papers  (2021-03-16T17:37:11Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.