REVIEW 7 cited by
Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
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
read the original abstract
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 circuit resources and conceptual simplicity. QFD uses a set of of time-propagated guess states as a variational basis for approximate diagonalization of a sparse Pauli Hamiltonian. The variational coefficients of the basis functions are determined by the Rayleigh-Ritz procedure by classically solving a generalized eigenvalue problem in the space of time-propagated guess states. The matrix elements of the subspace Hamiltonian and subspace metric matrix are each determined in quantum circuits by a one-ancilla extended swap test, i.e., statistical convergence of a one-ancilla PEA circuit. These matrix elements can be determined by many parallel quantum circuit evaluations, and the final Ritz estimates for the eigenvectors can conceptually be prepared as a linear combination over separate quantum state preparation circuits. The QFD method naturally provides for the computation of ground-state, excited-state, and transition expectation values. We numerically demonstrate the potential of the method by classical simulations of the QFD algorithm for an N=8 octamer of BChl-a chromophores represented by an 8-qubit ab initio exciton model (AIEM) Hamiltonian. Using only a handful of time-displacement points and a coarse, variational Trotter expansion of the time propagation operators, the QFD method recovers an accurate prediction of the absorption spectrum.
Forward citations
Cited by 7 Pith papers
-
Orthogonal Quantum Krylov Diagonalisation
OQKD realizes classical Lanczos orthogonality and tridiagonal structure on a quantum computer via Hamiltonian polynomials and GQSP, removing overlap regularization while matching Chebyshev-QKD query complexity.
-
Filtered Quantum Phase Estimation
FQPE filters the input state through a Gaussian (or Krylov) function of the Hamiltonian, replacing the overlap penalty |γ0|^{-2} in QPE's cost with a ΔE0^{-1} term in the high-precision regime.
-
Quantum Advantage in Computational Chemistry?
Factoring in hardware overheads and error correction, the authors predict classical chemistry algorithms stay dominant for most calculations through the 2040s, while quantum phase estimation overtakes full configurati...
-
Ground and excited-state energies with analytic errors and short time evolution on a quantum computer
The paper proposes quantum prolate diagonalization for simultaneous ground and excited state energy estimation, claiming chemical accuracy at the Heisenberg limit, but the scaling evidence is not self-contained.
-
Quantum Simulation of Nuclear Shell Model Using GCM-Based Methods on NISQ Devices
QuGCM and ADAPT-GCIM reproduce low-lying nuclear spectra for small shell-model systems and the Gray-code encoding is presented as cheaper and more noise-resilient than Jordan-Wigner.
-
Performance and Stability of Quantum Krylov Diagonalization for the Hubbard Model
QKD ground-state errors for the 1D Hubbard model are set by spectral gaps and Trotter/SVT stability; IBM runs with light mitigation reproduce the ideal convergence trends.
-
Hybrid VQE-CVQE algorithm using diabatic state preparation
A hybrid VQE-CVQE scheme using a few-step 'diabatic' evolution to build a guiding state, followed by classical diagonalization in the sampled subspace, yields chemically accurate ground-state energies in toy-model and...
Discussion (0). Continue with ORCID to comment.