Skip to content
Preprint

Efficient Hamiltonian Truncation: Fast Matrix Construction and Quantum Krylov Diagonalization

Aug 2026 · 1 citation · 62 references
Physics

Abstract

Hamiltonian truncation offers a nonperturbative route to quantum field theory, yet its accuracy is limited by the rapid expansion of the truncated Hilbert space, which drives up computational cost. We tackle this bottleneck with a hybrid strategy that pairs classical and quantum algorithms: 1) we develop an efficient basis-generation scheme built on integer partitions; 2) we speed up the construction of the sparse Hamiltonian matrix using symmetry-aware algorithms; and 3) we explore quantum Krylov diagonalization as a route to the low-lying spectrum. Benchmarking against the free massive scalar and $\phi^4$ theories in two spacetime dimensions, we achieve substantial gains in the computational efficiency of Hamiltonian truncation and chart a path toward future quantum implementations.

View source

Similar papers

Preprint Sep 2026

Operator Score Matching for Learning Quantum Hamiltonians

Learning quantum Hamiltonians from low-temperature thermal state measurements is a fundamental problem in quantum physics. Scalability of existing methods is limited by the complexity of semidefinite optimization problems or partition function computation. Here, we develop a quantum analog of classical score matching m...

Shreya Shukla, Abhijith Jayakumar, A. Lokhov · 0 citations
Preprint Aug 2026

An Efficient Explicit Implementation of a Quantum Algorithm with Quantum Advantage for Nonlinear Scalar Conservation Laws

Quantum algorithms for nonlinear partial differential equations remain challenging because nonlinear dynamics are not directly amenable to unitary quantum simulation. Building on the level-set formulation, we construct a quantum algorithm and provide an explicit gate-level implementation for solving scalar conservation...

Kezhen Wang, Jun-Peng Hu, Lei Zhang · 0 citations
Preprint Sep 2026

Wavelength-Uniform Quantum Algorithms for Quantum Dynamics

One of the main challenges in quantum simulation is the prohibitive cost of computing its solutions in the semi-classical regime, in which the de Broglie wavelength is small compared with the characteristic length scale and the solution is highly oscillatory. This difficulty is overcome by using the Weyl variable, unde...

Shi Jin, Chu-Wen Ma · 0 citations
Preprint Aug 2026

First-principle predictions of fragmentation functions via quantum computing

We report on an algorithm to compute fragmentation functions from the first principles Quantum Chromodynamics (QCD) Hamiltonian quantized in Light-Front Gauge, opening a path for digital quantum computers to calculate these longitudinal jet-structure observables. Simulating the behaviour of such computers on a classica...

J. J. G'alvez-Viruet, F. Llanes--Estrada, N. M. Arenaza et al. · 1 citation
Preprint Sep 2026

Wavelength-Uniform Quantum Algorithms for Mixed-State Quantum Dynamics

One of the main challenges in numerical simulation of quantum dynamics is the prohibitive cost in the semi-classical regime, in which the de Broglie wave length is small compared with the characteristic length scale and the solution is highly oscillatory. For the von-Neumann equation for mixed-state quantum dynamics, t...

Shi Jin, Chu-Wen Ma · 0 citations
Preprint Aug 2026

Resource-efficient quantum eigenvalue transform with commutator scaling

A protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation is introduced, and tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities are provid...

Arul Rhik Mazumder, James D. Watson, Samson Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.