Pith. sign in

REVIEW

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.15027 v2 pith:G5XFNCNM submitted 2020-10-28 quant-ph cs.NAmath.NA

classification quant-phcs.NAmath.NA
keywords eigenvalueproblemsquantumalgorithmgeneralizedhermitiansymmetriccase
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Many eigenvalue problems arising in practice are often of the generalized form $A\x=\lambda B\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: $B$ is invertible, $B^{-1}A$ is diagonalizable and all the eigenvalues are real.

Discussion (0). Sign in to comment.

Pith tools