Pith. sign in

REVIEW 6 cited by

Eigenvector continuation with subspace learning

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

arxiv 1711.07090 v2 pith:E54LCXKH submitted 2017-11-19 nucl-th cond-mat.str-elcs.NAhep-lathep-phmath.NA

Eigenvector continuation with subspace learning

classification nucl-th cond-mat.str-elcs.NAhep-lathep-phmath.NA
keywords eigenvectorhamiltonianmatrixcontinuationeigenvectorsextremallinearmethods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous efficient methods developed for this task, but they generally fail when some control parameter in the Hamiltonian matrix exceeds some threshold value. In this work we present a new technique called eigenvector continuation that can extend the reach of these methods. The key insight is that while an eigenvector resides in a linear space with enormous dimensions, the eigenvector trajectory generated by smooth changes of the Hamiltonian matrix is well approximated by a very low-dimensional manifold. We prove this statement using analytic function theory and propose an algorithm to solve for the extremal eigenvectors. We benchmark the method using several examples from quantum many-body theory.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. High-Dimensional Bayesian Calibration of Expensive Nuclear Models with Differentiable Emulation

    nucl-th 2026-05 unverdicted novelty 7.0

    DREAM enables exact-gradient Bayesian calibration of nuclear models via offline SVD emulation of parameter-dependent operators, demonstrated by rapid HMC convergence on an 18-parameter CDCC analysis of d+58Ni scattering.

  2. Low-rank compression of two-electron reduced density matrices

    physics.chem-ph 2026-05 unverdicted novelty 6.0

    A structure-preserving low-rank factorization of 2RDMs achieves linear effective rank scaling with ~99% compression for octane while retaining chemical accuracy and enabling quadratic-memory interpolation in ab initio...

  3. Low-rank compression of two-electron reduced density matrices

    physics.chem-ph 2026-05 unverdicted novelty 6.0

    A structure-preserving low-rank factorization of 2RDMs achieves linear rank scaling with system size and ~99% compression while retaining chemical accuracy for correlated states.

  4. Perturbative calculations of light nuclei up to N$^3$LO in chiral effective field theory

    nucl-th 2026-04 unverdicted novelty 5.0

    Perturbative N3LO calculations in chiral EFT with RG-guided power counting yield robust predictions for light nuclei energies when calibrated on the tritium binding energy.

  5. Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE

    quant-ph 2026-06 unverdicted novelty 4.0

    TETRIS-ADAPT-VQE achieves fidelities above 99.3% for SYK (N=20) and 99.9998% for SK (L=18) but requires large resources for SYK models.

  6. Recent applications of the subtracted second RPA method

    nucl-th 2026-06 unverdicted novelty 2.0

    The review describes how SSRPA fixes SRPA pathologies in EDF theory, presents applications to charge-conserving and charge-exchange excitations with experimental comparisons, and discusses impacts on the nuclear equat...