pith. sign in

arxiv: 2209.10571 · v1 · pith:YSUKMCYZnew · submitted 2022-09-21 · 🪐 quant-ph · cond-mat.other· cond-mat.str-el

Subspace Diagonalization on Quantum Computers using Eigenvector Continuation

classification 🪐 quant-ph cond-mat.othercond-mat.str-el
keywords subspacebasisgroundquantumchoicecomputerscontinuationdiagonalization
0
0 comments X
read the original abstract

Quantum subspace diagonalization (QSD) methods are quantum-classical hybrid methods, commonly used to find ground and excited state energies by projecting the Hamiltonian to a smaller subspace. In applying these, the choice of subspace basis is critical from the perspectives of basis completeness and efficiency of implementation on quantum computers. In this work, we present Eigenvector Continuation (EC) as a QSD method, where low-energy states of the Hamiltonian at different points in parameter space are chosen as the subspace basis. This unique choice enables rapid evaluation of low-energy spectra, including ground and nearby excited states, with minimal hardware effort. As a particular advantage, EC is able to capture the spectrum across ground state crossovers corresponding to different symmetry sectors of the problem. We demonstrate this method for interacting spin models and molecules.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering

    quant-ph 2026-05 unverdicted novelty 6.0

    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...