Quantum algorithms for the polynomial eigenvalue problems

by   Changpeng Shao, et al.

Polynomial eigenvalue problems (PEPs) arise in a variety of science and engineering applications, and many breakthroughs in the development of classical algorithms to solve PEPs have been made in the past decades. Here we attempt to solve PEPs in a quantum computer. Firstly, for generalized eigenvalue problems (GEPs) A = λ B with A,B symmetric, and B positive definite, we give a quantum algorithm based on block-encoding and quantum phase estimation. In a more general case when B is invertible, B^-1A is diagonalizable and all the eigenvalues are real, we propose a quantum algorithm based on the Fourier spectral method to solve ordinary differential equations (ODEs). The inputs of our algorithms can be any desired states, and the outputs are superpositions of the eigenpairs. The complexities are polylog in the matrix size and linear in the precision. The dependence on precision is optimal. Secondly, we show that when B is singular, any quantum algorithm uses at least Ω(√(n)) queries to compute the eigenvalues, where n is the matrix size. Thirdly, based on the linearization method and the connection between PEPs and higher-order ODEs, we provide two quantum algorithms to solve PEPs by extending the quantum algorithm for GEPs. We also give detailed complexity analysis of the algorithm for two special types of quadratic eigenvalue problems that are important in practice. Finally, under an extra assumption, we propose a quantum algorithm to solve PEPs when the eigenvalues are complex.



There are no comments yet.


page 1

page 2

page 3

page 4


Computing eigenvalues of matrices in a quantum computer

Eigenproblem arises in a large number of disciplines of sciences and eng...

Unsupervised Neural Networks for Quantum Eigenvalue Problems

Eigenvalue problems are critical to several fields of science and engine...

A Quantum Implementation Model for Artificial Neural Networks

The learning process for multi layered neural networks with many nodes m...

A Theory of Quantum Subspace Diagonalization

Quantum subspace diagonalization methods are an exciting new class of al...

Solving the k-sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algori...

Lecture Notes on Quantum Algorithms for Scientific Computation

This is a set of lecture notes used in a graduate topic class in applied...

Eigenvalues of non-hermitian matrices: a dynamical and an iterative approach. Application to a truncated Swanson model

We propose two different strategies to find eigenvalues and eigenvectors...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.