Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians

Abstract

Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising algorithms to solve the discretized Poisson equation, they generally require that $A$ be decomposed into a sum of $O[\text{poly}({\text{log}}_{2}n)]$ simple operators in order to evaluate efficiently the loss function. A tensor product decomposition of $A$ with $2{\text{log}}_{2}n+1$ terms has been explored in previous works. In this paper, based on the decomposition of sparse Hamiltonians we greatly reduce the number of terms. We first write the loss function in terms of the operator ${\sigma }_x\otimes A$ with ${\sigma }_x$ denoting the standard Pauli operator. Then for the one-dimensional Poisson equations with different boundary conditions and for the $d$-dimensional Poisson equations with Dirichlet boundary conditions, we decompose ${\sigma }_x\otimes A$ into a sum of at most 7 and $(4d+1)$ Hermitian, one-sparse, and self-inverse operators, respectively. We design explicitly the quantum circuits to evaluate efficiently the loss function. The decomposition method and the design of quantum circuits can also be easily extended to linear systems with Hermitian and sparse coefficient matrices satisfying $a_{i,i+c}=a_c$ for $c=0,1,\cdots ,n-1$ and $i=0,\cdots ,n-1-c$.

References in corpus (12)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• Variational quantum algorithms for nonlinear problems
• Exponential improvement in precision for simulating sparse Hamiltonians
• Quantum algorithm and circuit design solving the Poisson equation
• Variational algorithms for linear algebra
• MAXCUT QAOA performance guarantees for p >1
• Near-term quantum algorithms for linear systems of equations
• Variational quantum eigensolvers for sparse Hamiltonians

Cited by in corpus (8)

• Nonlinear dynamics as a ground-state solution on quantum computers
• A hybrid quantum-classical framework for computational fluid dynamics
• Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach
• Quantum Dynamics Simulation of the Advection-Diffusion Equation
• A variational quantum algorithm for tackling multi-dimensional Poisson equations with inhomogeneous boundary conditions
• Quantum circuits for partial differential equations in Fourier space
• Hybrid Quantum Neural Networks for Enhanced Breast Cancer Thermographic Classification: A Novel Quantum-Classical Integration Approach
• Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation