← Latest papers
⚛️ lattice

Hamiltonian spectra in quantum computers through the generalized eigenvalue method

This paper proposes and validates a method for extracting Hamiltonian energy eigenvalues from quantum-generated real-time correlators using the generalized eigenvalue problem, demonstrating through simulations and hardware tests that it is substantially more efficient than Fourier transform-based approaches.

Original authors: Valery Simonyan, Greg Ridgway, Paulo Bedaque

Published 2026-08-11
📖 5 min read🧠 Deep dive

Original authors: Valery Simonyan, Greg Ridgway, Paulo Bedaque

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to listen to a band playing a song, but the music is a chaotic, overlapping roar of every instrument at once. In the world of quantum physics, this "song" is the energy spectrum of a system—a list of all the possible energy levels a particle or a group of particles can have. Knowing these levels is like knowing the exact notes a molecule can sing; it tells us the mass of particles, how they stick together, and how they scatter off one another. For decades, scientists have tried to hear these notes by simulating the system in a "slow-motion" mode, where the music fades away, leaving only the lowest, deepest note (the ground state) audible. But this is like trying to hear a violin solo by waiting for the drums to stop playing; it works for the bass, but the higher, more complex notes get lost in the noise before you can hear them.

Now, imagine if you could listen to the band in real-time, where every instrument is playing loudly and clearly at the same time. This is what quantum computers do: they generate "real-time" signals that oscillate with all the energy levels mixed together. The problem is, when you have a signal this complex, the usual way to pick out the individual notes—using a mathematical tool called a Fourier transform—is like trying to identify a single singer in a stadium by looking at a blurry photo. You need to watch the performance for an incredibly long time to get a clear picture, but current quantum computers are too noisy and short-lived to hold a note that long. This paper asks a simple but powerful question: Is there a smarter way to separate the instruments in real-time without waiting forever?

The authors, Valery Simonyan, Paulo F. Bedaque, and Gregory Ridgway, say yes. They propose a clever trick borrowed from an old technique used in classical physics, adapted for the noisy, real-time world of quantum computers. Instead of waiting for the signal to settle or trying to blur the noise away, they treat the messy signal like a puzzle. They take a set of different "listening posts" (mathematical operators) and measure how they all talk to each other over time, creating a matrix of relationships. Then, they solve a "generalized eigenvalue problem"—a fancy way of finding the specific combinations of these listening posts that isolate each energy level, almost like tuning a radio to find a single station amidst static.

The team tested this idea on a model called the "fuzzy σ\sigma-model," which is a simplified version of complex field theories used to understand the universe. They ran simulations on classical computers and also tried it out on a real quantum computer, the IonQ Forte-Enterprise. The results were promising: their method could successfully pull out several low-energy levels with high precision, even when the time they had to listen was too short for the traditional Fourier transform method to work. In fact, the authors found that their approach was substantially more efficient than the standard method. While the traditional method required a time extent of T=100T=100 (in lattice units) to even begin resolving the peaks clearly, their new method could resolve the same levels with a much shorter time of T=5.6T=5.6.

However, the authors are careful not to claim they have solved the entire problem of quantum spectroscopy. Their success relied heavily on having a good "approximate ground state" and a set of operators that could span the space of the states they were interested in. In their simulations, they achieved sub-percent precision, but when they moved to the actual quantum hardware, the results were slightly off. The lowest energy level they measured was off by about 5.3% compared to the exact value, and the discrepancy was traced back to a mix of "Trotter errors" (small mistakes made when breaking time into steps) and the natural noise of the quantum device. The authors note that while the method works beautifully in theory and simulation, the current hardware limits mean the results are still an approximation, not a perfect measurement.

Ultimately, this paper suggests that by adapting the generalized eigenvalue problem to real-time data, we can extract energy spectra much faster than before. It doesn't require the signal to decay, nor does it demand the impossible long coherence times that current quantum computers struggle to provide. While the method isn't a magic wand that fixes all hardware errors, it offers a new, more efficient path forward for listening to the quantum universe, especially in situations where traditional methods fail, such as when studying theories with a "sign problem" that makes standard simulations impossible. The authors conclude that this approach is a natural candidate for future spectroscopy, provided we can find good approximations for the ground state and the operators we use to probe it.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →