REVIEW 18 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
Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
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 18 Pith papers
-
Polynomial-time exact diagonalization via sparse guided eigenwalks
Introduces the eigenwalk problem and proves a linear-diameter support-localization theorem for sparse eigenvectors, yielding poly(n)-time classical exact diagonalization for O(1)-sparse extremal eigenvectors of poly(n...
-
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.
-
Orthogonal Quantum Krylov Diagonalisation
An orthogonal quantum Krylov algorithm (OQKD) implements classical Lanczos recursion via GQSP polynomial transformations, avoiding overlap-matrix regularization but inheriting an exponential GQSP normalization overhead.
-
Theory and practice of Trotter product formulas for quantum chemistry
SPRINT and GRADE cut Toffoli cost 4.5x versus prior Trotter methods for Li4Mn2O X-ray spectrum simulation while using 5.5x fewer qubits than qubitization alternatives.
-
Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering
Filter-assisted SQD uses a quantum filter to engineer sparser ground-state wavefunctions, yielding orders-of-magnitude lower energy errors and reduced sampling overhead versus standard SQD on the transverse-longitudin...
-
Molecular Excited States using Quantum Subspace Methods: Accuracy, Resource Reduction, and Error-Mitigated Hardware Implementation of q-sc-EOM
Optimized q-sc-EOM on quantum hardware yields accurate excited-state energies for challenging molecular bond-breaking cases after reducing measurement scaling to O(N^5) and applying readout and symmetry error mitigation.
-
Quantum Finite Temperature Lanczos Method
QFTLM computes thermal expectation values on quantum computers by merging quantum Krylov methods with efficient typical-state preparation for trace estimation.
-
Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra
QFAMES is a quantum algorithm that identifies clusters of closely spaced dominant eigenvalues and their multiplicities in quantum Hamiltonians under physically motivated assumptions, enabling observable estimation wit...
-
Moments-based quantum computation of the electric dipole moment of molecular systems
Quantum computed moments method on IBM hardware estimates water dipole moment to 0.03 debye of FCI, outperforming VQE by factor of two in error.
-
Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
A QSCI variant using stochastic quantum time evolution selects compact configuration subspaces for SiH4 energies, achieving over 200x reduction versus conventional SCI at large separations while matching Heatbath CI c...
-
Selecting optimal unrestricted Hartree-Fock trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo: Accuracy and limitations in modeling three iron-sulfur clusters
Chemical properties and symmetries, not variational energy, should guide UHF trial selection for ph-AFQMC on iron-sulfur clusters, yielding accurate energies despite suboptimal sampling and bias compensation.
-
ffsim: Faster simulation of fermionic quantum circuits
ffsim is a new open-source library that accelerates fermionic quantum circuit simulation by using particle number and spin symmetries to cut memory and runtime, outperforming FQE on benchmarks up to 64 qubits.
-
A Critical Assessment of the Sample-Based Quantum Diagonalization for Heisenberg and Hubbard Models
SQD needs an exponentially increasing number of computational-basis configurations to approximate ground-state energies of Heisenberg and Hubbard models within fixed accuracy, even when configurations are chosen optim...
-
Quantum Flow algorithm: quantum simulations of chemical systems using reduced quantum resources and constant depth quantum circuits
QFlow-SD matches canonical UCCSD energies for tested molecules while using substantially fewer qubits via reduced active spaces and constant-depth circuits, with a composite classical-quantum downfolding strategy demo...
-
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.
-
Interaction geometry and ground-state properties of sparse quantum lattice models
Symmetry and frustration in power-of-p and Fibonacci graphs drive distinct ground-state phase behaviors in sparse long-range quantum models, unified by an effective-geometry principle.
-
Ground-state energies of Ising models calculated using the samples from a quantum computer that simulates short-time evolution
Ground-state energies of homogeneous and random-coupling Ising models are obtained via CVQE with GSA on quantum hardware up to 63 qubits, with error-boundary, entropic, and subspace analyses indicating suitability for...
-
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)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.