• Corpus ID: 238857008

A Theory of Quantum Subspace Diagonalization

@article{Epperly2021ATO,
  title={A Theory of Quantum Subspace Diagonalization},
  author={E.N. Epperly and Lin Lin and Yuji Nakatsukasa},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.07492}
}
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized eigenvalue problem, with a matrix pencil corrupted by a non-negligible amount of noise that is far above the machine precision. Despite pessimistic predictions from classical perturbation theories, these methods can perform reliably well if the generalized… 

Figures and Tables from this paper

Quantum subspace expansion algorithm for Green's functions
TLDR
An algorithm to compute Green’s functions on quantum computers for interacting electron systems, which is a challenging task on conventional computers is presented, and a two-level multigrid Trotter time evolution is proposed for an efficient preparation of the basis states in a quantum circuit, which takes advantage of the robustness of the subspace expansion against TroTter errors.
Say NO to Optimization: A Non-Orthogonal Quantum Eigensolver
TLDR
A quantum algorithm utilizing the action of correlating cluster operators to provide high-quality wavefunction ans¨atze employing a non-orthogonal multireference basis that captures a significant portion of the exact wavefunction in a highly compact manner, and that allows computation of the resulting energies and wavefunctions at polynomial cost with a quantum computer.

References

SHOWING 1-10 OF 39 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 quantum
Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
TLDR
This work provides evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channel model of variational state preparation and develops a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources.
Quantum Krylov subspace algorithms for ground- and excited-state energy estimation
TLDR
It is shown that a wide class of Hamiltonians relevant to condensed matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test, and a multi-fidelity estimation protocol can be used to compute such quantities.
The Rotation of Eigenvectors by a Perturbation. III
When a Hermitian linear operator is slightly perturbed, by how much can its invariant subspaces change? Given some approximations to a cluster of neighboring eigenvalues and to the corresponding
The Definite Generalized Eigenvalue Problem : A New Perturbation Theory
Let (A, B) be a definite pair of n × n Hermitian matrices. That is, |x∗Ax| + |x∗Bx| 6= 0 for all non-zero vectors x ∈ C. It is possible to find an n × n non-singular matrix X with unit columns such
GROUP ALGEBRA, CONVOLUTION ALGEBRA, AND APPLICATIONS TO QUANTUM MECHANICS.
The symmetry group of the Hamiltonian plays a fundamental role in quantum theory in the classification of stationary states and in studying transition probabilities and selection rules. It is here
Wilkinson’s Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems
TLDR
A new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theories fail to predict the observed accuracy of computed solutions, which is a more powerful predictor of the accuracy of computations than existing tools.
A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons.
TLDR
Preliminary benchmarks on linear H6, H8, and BeH2 indicate that MRSQK can predict the energy of these systems accurately using very compact Krylov bases.
Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm
TLDR
An extended protocol based on a quantum subspace expansion (QSE) is used to apply the QSE approach to the H2 molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization and can mitigate the effects of incoherent errors.
...
1
2
3
4
...