Quantum Heaviside Eigen Solver

Abstract

Solving Hamiltonian matrix is a central task in quantum many-body physics and quantum chemistry. Here we propose a novel quantum algorithm named as a quantum Heaviside eigen solver to calculate both the eigen values and eigen states of the general Hamiltonian for quantum computers. A quantum judge is suggested to determine whether all the eigen values of a given Hamiltonian is larger than a certain threshold, and the lowest eigen value with an error smaller than $\epsilon$ can be obtained by dichotomy in $O\left(\log \frac{1}{\epsilon }\right)$ iterations of shifting Hamiltonian and performing quantum judge. A quantum selector is proposed to calculate the corresponding eigen states. Both quantum judge and quantum selector achieve quadratic speedup from amplitude amplification over classical diagonalization methods. The present algorithm is a universal quantum eigen solver for Hamiltonian in quantum many-body systems and quantum chemistry. We test this algorithm on the quantum simulator for a physical model to show its good feasibility.

References in corpus (25)

• Quantum Computing in the NISQ era and beyond
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Strengths and Weaknesses of Quantum Computing
• Quantum principal component analysis
• Quantum Algorithms Revisited
• Quantum algorithms: an overview
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum Networks for Elementary Arithmetic Operations
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• On Many-Body Localization for Quantum Spin Chains
• Quantum computers can search rapidly by using almost any transformation
• Variational Quantum Computation of Excited States
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
• Accelerated Variational Quantum Eigensolver
• Fixed-point quantum search with an optimal number of queries
• Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
• Preparing ground states of quantum many-body systems on a quantum computer
• Controlling quantum random walk with a step-dependent coin
• Paradeisos: a perfect hashing algorithm for many-body eigenvalue problems