An application of continuous-variable gate synthesis to quantum simulation of classical dynamics
- URL: http://arxiv.org/abs/2407.08006v2
- Date: Wed, 24 Jul 2024 16:55:25 GMT
- Title: An application of continuous-variable gate synthesis to quantum simulation of classical dynamics
- Authors: Sam Cochran, James Stokes, Paramsothy Jayakumar, Shravan Veerapaneni,
- Abstract summary: We present a continuous-variable quantum computing algorithm for KvN simulation of classical nonlinear dynamics.
In particular, we present explicit gate synthesis for product-formula Hamiltonian simulation of anharmonic vibrational dynamics.
- Score: 1.4546782734788561
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Although quantum computing holds promise to accelerate a wide range of computational tasks, the quantum simulation of quantum dynamics as originally envisaged by Feynman remains the most promising candidate for achieving quantum advantage. A less explored possibility with comparably far-reaching technological applicability is the quantum simulation of classical nonlinear dynamics. Attempts to develop digital quantum algorithms based on the Koopman von Neumann formalism have met with challenges because of the necessary projection step from an infinite-dimensional Hilbert space to the finite-dimensional subspace described by a collection of qubits. This finitization produces numerical artifacts that limit solutions to very short time horizons. In this paper we review continuous-variable quantum computing (CVQC), which naturally avoids such obstacles, and a CVQC algorithm for KvN simulation of classical nonlinear dynamics is advocated. In particular, we present explicit gate synthesis for product-formula Hamiltonian simulation of anharmonic vibrational dynamics.
Related papers
- Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation.
We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
arXiv Detail & Related papers (2024-04-10T14:27:07Z) - Quantum-classical simulation of quantum field theory by quantum circuit
learning [0.0]
We employ quantum circuit learning to simulate quantum field theories (QFTs)
We find that our predictions closely align with the results of rigorous classical calculations.
This hybrid quantum-classical approach illustrates the feasibility of efficiently simulating large-scale QFTs on cutting-edge quantum devices.
arXiv Detail & Related papers (2023-11-27T20:18:39Z) - Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution.
We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap.
Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
arXiv Detail & Related papers (2022-12-28T18:59:59Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Variational Quantum Simulation of Chemical Dynamics with Quantum
Computers [23.13347792805101]
We present variational simulations of real-space quantum dynamics suitable for implementation in Noisy Intermediate-Scale Quantum (NISQ) devices.
Motivated by the insights that most chemical dynamics occur in the low energy subspace, we propose a subspace expansion method.
arXiv Detail & Related papers (2021-10-12T16:28:52Z) - 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) - Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy
Quantum Computers [0.0]
We show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes.
This work provides a new direction for quantum advantage in the NISQ era.
arXiv Detail & Related papers (2021-06-24T10:37:37Z) - 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) - 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) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z)
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.