Hermitian Matrix Definiteness from Quantum Phase Estimation
arXiv:2009.04117 · doi:10.1007/s11128-022-03542-5
Abstract
An algorithm to classify a general Hermitian matrix according to its signature (positive semi-definite, negative or indefinite) is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a Hermitian matrix in one ancillary qubit. The signature of the matrix is extracted from the mean value of a spin operator in this single ancillary qubit. The algorithm is probabilistic, but it shows good performance, achieving 97% of correct classifications with few qubits. The computational cost scales comparably to the classical one in the case of a generic matrix, but improves significantly for restricted classes of matrices like -local or sparse hamiltonians.
arXiv comment19 pages, 8 figures, 2 algorithms
References in corpus (10)
- Hamiltonian Simulation by Qubitization
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Simulating Hamiltonian dynamics with a truncated Taylor series
- A Grand Unification of Quantum Algorithms
- IBM Q Experience as a versatile experimental testbed for simulating open quantum systems
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- A quantum linear system algorithm for dense matrices
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits
- Bayesian Quantum Multiphase Estimation Algorithm