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.
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
A quantum algorithm is constructed and an explicit gate-level implementation for solving scalar conservation laws is provided, demonstrating a quantum advantage for observable estimation in sufficiently high spatial dimensions, under standard assumptions on state preparation and oracle access.
This work uses the Weyl variable and the exact Hermite moments and quantum singular value transformation to treat the polynomial and Fourier components of the potential, resulting in a quantum algorithm efficient for all ranges of wavelengths.
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
A quantum algorithm efficient for ranges of wave lengths, with complexity in the spatial dimension and discretization and query bounds containing {\it no} negative powers of the small wavelength, which can capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying th...
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.
