Corpus ID: 237503498

Quantum Krylov subspace algorithms for ground and excited state energy estimation

@inproceedings{Cortes2021QuantumKS,
  title={Quantum Krylov subspace algorithms for ground and excited state energy estimation},
  author={Cristian L. Cortes and Stephen K. Gray},
  year={2021}
}
  • C. Cortes, Stephen K. Gray
  • Published 14 September 2021
  • Physics
Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form, 〈φi|e |φj〉, the associated quantum circuits require an ancilla qubit with controlled multi-qubit gates that can be quite costly for near-term… Expand

Figures and Tables from this paper

A Theory of Quantum Subspace Diagonalization
TLDR
A theoretical analysis of this surprising phenomenon is provided, proving that under certain natural conditions, a quantum subspace diagonalization algorithm can accurately compute the smallest eigenvalue of a large Hermitian matrix. Expand
Accessing ground state and excited states energies in many-body system after symmetry restoration using quantum computers
We explore the possibility to perform symmetry restoration with the variation after projection technique on a quantum computer followed by additional post-processing. The final goal is to developExpand

References

SHOWING 1-10 OF 60 REFERENCES
Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantumExpand
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
The accurate computation of Hamiltonian ground, excited and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation toExpand
Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
Quantum phase estimation is the workhorse behind any quantum algorithm and a promising method for determining ground state energies of strongly correlated quantum systems. Low-cost quantum phaseExpand
Witnessing eigenstates for quantum simulation of Hamiltonian spectra
TLDR
The concept of an eigenstate witness is introduced and used to find energies of quantum systems with quantum computers and provides a new quantum approach that combines variational methods and phase estimation to approximate eigenvalues for both ground and excited states. Expand
Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of thisExpand
Iterative quantum-assisted eigensolver
The task of estimating ground state and ground state energy of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorialExpand
Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
Author(s): McClean, JR; Kimchi-Schwartz, ME; Carter, J; De Jong, WA | Abstract: © 2017 American Physical Society. Using quantum devices supported by classical computational resources is a promisingExpand
Quantum Algorithm for Spectral Measurement with a Lower Gate Count.
TLDR
Two techniques are presented that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations, and a unitary operator is proposed which can be implemented exactly, circumventing any Taylor or Trotter approximation errors. Expand
Barren plateaus in quantum neural network training landscapes
TLDR
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits. Expand
Variational Quantum Algorithms
TLDR
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed. Expand
...
1
2
3
4
5
...