Generalising quantum imaginary time evolution to solve linear partial differential equations
- URL: http://arxiv.org/abs/2405.01313v1
- Date: Thu, 2 May 2024 14:20:25 GMT
- Title: Generalising quantum imaginary time evolution to solve linear partial differential equations
- Authors: Swagat Kumar, Colin Michael Wilmott,
- Abstract summary: We demonstrate a practical application of QITE as a quantum numerical solver for linear partial differential equations.
Our algorithm takes inspiration from QITE in that the quantum state follows the same normalised trajectory in both algorithms.
It is our QITE methodology's ability to track the scale of the state vector over time that allows our algorithm to solve differential equations.
- Score: 3.162950515140159
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The quantum imaginary time evolution (QITE) methodology was developed to overcome a critical issue as regards non-unitarity in the implementation of imaginary time evolution on a quantum computer. QITE has since been used to approximate ground states of various physical systems. In this paper, we demonstrate a practical application of QITE as a quantum numerical solver for linear partial differential equations. Our algorithm takes inspiration from QITE in that the quantum state follows the same normalised trajectory in both algorithms. However, it is our QITE methodology's ability to track the scale of the state vector over time that allows our algorithm to solve differential equations. We demonstrate our methodology with numerical simulations and use it to solve the heat equation in one and two dimensions using six and ten qubits, respectively.
Related papers
- Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers.
The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
arXiv Detail & Related papers (2024-03-25T14:06:18Z) - Quantum Dynamical Emulation [0.0]
We introduce the concept of textitQuantum Dynamical Emulation, a constructive method for mapping the solutions of non-unitary dynamics to a weighted set of unitary operations.
This allows us to derive a new correspondence between real and imaginary time, which we term Imaginary Time Quantum Dynamical Emulation (ITQDE)
We show that a single trajectory evolved using ITQDE can be used not only to infer ground and thermal states, but also to resolve information about the complete Hamiltonian spectrum.
arXiv Detail & Related papers (2024-03-05T22:24:30Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Improved algorithms of quantum imaginary time evolution for ground and
excited states of molecular systems [0.0]
Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system.
We analyze the derivation of the underlying QITE equation order-by-order, and suggest a modification that is theoretically well founded.
We also discuss how to accurately estimate the norm of an imaginary-time-evolved state, and applied it to excited state calculations.
arXiv Detail & Related papers (2022-05-04T10:32:16Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - 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) - Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard.
We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware.
The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z) - Evaluating low-depth quantum algorithms for time evolution on
fermion-boson systems [0.0]
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing.
We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers.
arXiv Detail & Related papers (2021-06-07T22:03:17Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Quantum Algorithms for Solving Ordinary Differential Equations via
Classical Integration Methods [1.802439717192088]
We explore utilizing quantum computers for the purpose of solving differential equations.
We devise and simulate corresponding digital quantum circuits, and implement and run a 6$mathrmth$ order Gauss-Legendre collocation method.
As promising future scenario, the digital arithmetic method could be employed as an "oracle" within quantum search algorithms for inverse problems.
arXiv Detail & Related papers (2020-12-17T09:49:35Z)
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.