Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1008.1208 · Computer Physics Communications

A numerical projection technique for large-scale eigenvalue problems

Ralf Gamillscheg, Gundolf Haase, Wolfgang von der Linden

Published Jun 4, 2011• 0 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2011.05.016

Related papers

An efficient projection algorithm and its application to the spurious center-of-mass motion problem

Nakada, H., Takashi Sebe, Tomoki Otsuka

Based on the correspondence of projection to an eigenvalue problem via the underlying group structure, we generalize the projection algorithm proposed by Morrison et al. This algorithm is eligible for large-scale computations, because we can avoid the accumulation of errors. As an example, we apply it to the spurious c.m. motion in a multi-$\hbarω$ shell-model calculation. In comparison with Lawson's method, the present method is exact and nevertheless does not need longer CPU time. It is pointed out that the exact treatment of the spurious c.m. motion is crucial to some physical quantities.

arXiv:nucl-th/9712008•Dec 2, 1997•1 citation

Matrix Formulation of the Eigenvalue Problem

James B. Seaborn

Springer eBooks•Jan 1, 2002•0 citations

Projected Inverse Iteration: An Eigenvalue Approach to Ground-State Computation with Neural Quantum States

Hang Zhang, Victor Armegioiu, Juan Carrasquilla +4 more

Deep learning offers a powerful approach to quantum many-body problems via neural network wavefunctions, but their optimization remains a severe bottleneck. Existing optimization methods, including natural gradient descent and stochastic reconfiguration, suffer from spectral gap-dependent convergence that limits their effectiveness on systems fraught with competing orders and nearly degenerate ground states, such as frustrated magnets and strongly correlated electron materials. Here, we introduce Projected Inverse Iteration (PII) by re-framing the ground-state search as an eigenvalue problem. PII achieves rapid, gap-insensitive convergence while preserving the favorable polynomial computational scaling of stochastic reconfiguration. Demonstrated on challenging two-dimensional spin systems, including the highly frustrated $J_1$-$J_2$ model, PII outperforms standard optimization techniques and presents a promising algorithmic strategy for discovering complex quantum states in the presence of small spectral gaps. More broadly, PII can be interpreted as a novel natural gradient method tailored for eigenvalue problems, opening up its application to related challenges within deep learning.

quant-pharXiv:2606.07825•Jun 9, 2026•3 citations

Quantum techniques for eigenvalue problems

Dean Lee

arXiv:2307.03889•The European Physical Journal A•Nov 20, 2023•6 citations

Eigenvalue Problems

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Linear algebra at exponential scale via tensor network dimension reduction

Chris Camaño, Ethan N. Epperly, Raphael A. Meyer +1 more

Many problems in modern scientific computing are challenging because of a \emph{curse of dimension}, where their mathematical formulation involves objects whose dimension is \emph{exponential} in the nominal "size" of the problem. Tensor networks can provide a compact representation for exponentially large vectors and matrices that arise in applications, but these representations do not always lead to reliable algorithms. This paper develops and analyzes techniques for randomized dimension reduction of tensor network data. These techniques support a suite of efficient algorithms for provably solving exponential-scale linear algebra problems, including trace estimation and eigenvalue approximation. The paper includes several stylized illustrations from quantum many-body physics with ambient dimension up to $2^{200}$.

math.NACross-listedarXiv:2606.15350•Jun 16, 2026•0 citations
Based on the correspondence of projection to an eigenvalue problem via the underlying group structure, we generalize the projection algorithm proposed by Morrison et al. This algorithm is eligible for large-scale computations, because we can avoid the accumulation of errors. As an example, we apply it to the spurious c.m. motion in a multi-ℏω\hbarωℏω shell-model calculation. In comparison with Lawson's method, the present method is exact and nevertheless does not need longer CPU time. It is pointed out that the exact treatment of the spurious c.m. motion is crucial to some physical quantities.
Deep learning offers a powerful approach to quantum many-body problems via neural network wavefunctions, but their optimization remains a severe bottleneck. Existing optimization methods, including natural gradient descent and stochastic reconfiguration, suffer from spectral gap-dependent convergence that limits their effectiveness on systems fraught with competing orders and nearly degenerate ground states, such as frustrated magnets and strongly correlated electron materials. Here, we introduce Projected Inverse Iteration (PII) by re-framing the ground-state search as an eigenvalue problem. PII achieves rapid, gap-insensitive convergence while preserving the favorable polynomial computational scaling of stochastic reconfiguration. Demonstrated on challenging two-dimensional spin systems, including the highly frustrated J1J_1J1​-J2J_2J2​ model, PII outperforms standard optimization techniques and presents a promising algorithmic strategy for discovering complex quantum states in the presence of small spectral gaps. More broadly, PII can be interpreted as a novel natural gradient method tailored for eigenvalue problems, opening up its application to related challenges within deep learning.
Many problems in modern scientific computing are challenging because of a \emph{curse of dimension}, where their mathematical formulation involves objects whose dimension is \emph{exponential} in the nominal "size" of the problem. Tensor networks can provide a compact representation for exponentially large vectors and matrices that arise in applications, but these representations do not always lead to reliable algorithms. This paper develops and analyzes techniques for randomized dimension reduction of tensor network data. These techniques support a suite of efficient algorithms for provably solving exponential-scale linear algebra problems, including trace estimation and eigenvalue approximation. The paper includes several stylized illustrations from quantum many-body physics with ambient dimension up to 22002^{200}2200.