Depth analysis of variational quantum algorithms for heat equation

Variational quantum algorithms are a promising tool for solving partial differential equations. The standard approach for its numerical solution are finite difference schemes, which can be reduced to the linear algebra problem. We consider three approaches to solve the heat equation on a quantum com...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-05
Main Authors: Guseynov, N M, Zhukov, A A, Pogosov, W V, Lebedev, A V
Format: Article
Language:English
Subjects:
Algorithms
Circuits
Computer simulation
Finite difference method
Linear algebra
Mathematical analysis
Partial differential equations
Polynomials
Quantum computers
Qubits (quantum computing)
Thermodynamics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Variational quantum algorithms are a promising tool for solving partial differential equations. The standard approach for its numerical solution are finite difference schemes, which can be reduced to the linear algebra problem. We consider three approaches to solve the heat equation on a quantum computer. Using the direct variational method we minimize the expectation value of a Hamiltonian with its ground state being the solution of the problem under study. Typically, an exponential number of Pauli products in the Hamiltonian decomposition does not allow for the quantum speed up to be achieved. The Hadamard test based approach solves this problem, however, the performed simulations do not evidently prove that the ansatz circuit has a polynomial depth with respect to the number of qubits. The ansatz tree approach exploits an explicit form of the matrix what makes it possible to achieve an advantage over classical algorithms. In our numerical simulations with up to \(n=11\) qubits, this method reveals the exponential speed up.
ISSN:2331-8422
DOI:10.48550/arxiv.2212.12375