Explicitly correlated ground states with a feedback-free variational hybrid algorithm
This paper proposes and experimentally demonstrates a feedback-free hybrid quantum-classical algorithm that uses a quantum processor to prepare a momentum-space matrix product state and classical post-processing to variationally optimize an explicitly correlated Jastrow-type correlator, achieving high-accuracy ground-state energy estimates for the 2D Fermi-Hubbard model with reduced sampling and gate requirements compared to other hybrid methods.
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
In the microscopic world of electrons, particles do not always behave like independent individuals moving through empty space. In certain materials, they become deeply entangled, their movements dictated by a fierce, immediate repulsion when they come too close to one another. This phenomenon, known as strong correlation, is the key to understanding how some materials conduct electricity, how they become magnetic, or how they might one day become superconductors. To predict these behaviors, scientists must solve a massive mathematical puzzle: calculating the exact energy state of a system where every electron is constantly reacting to every other electron. For decades, the most powerful classical computers have struggled with this task, often hitting a wall when the interactions become too intense or the system grows too large. The difficulty lies in a fundamental mismatch: the most efficient way to describe the long-range order of these electrons is in terms of their momentum, while the most efficient way to describe their short-range, violent repulsions is in terms of their physical position. Trying to combine these two descriptions on a classical computer has been like trying to solve a jigsaw puzzle where the pieces are cut from two different pictures.
A team of researchers at the University of New Mexico has found a way to bridge this divide using a quantum computer, not by asking the machine to solve the entire puzzle at once, but by using it to prepare a specific, high-quality starting point for a classical computer to finish. Their approach, detailed in a recent study, focuses on a theoretical model called the Fermi-Hubbard model, which describes electrons hopping between sites on a grid. The researchers used a quantum processor to generate a low-entanglement state of electrons in momentum space, a configuration that is difficult for classical computers to create efficiently. They then rotated this state into real space, effectively translating the description so that the short-range repulsions could be handled. Crucially, they did this without a back-and-forth loop where the computer and the classical algorithm constantly adjust each other. Instead, the quantum processor performed its task once, measured the results, and handed the data over to a classical computer. The classical computer then used this data to optimize a mathematical "correlator"—a tool that fine-tunes the description of the electron repulsions—entirely after the quantum experiment was over.
The experiment was conducted on a 32-qubit quantum computer, specifically the H2-2 model from Quantinuum. The team prepared a state representing a grid of 16 sites, half-filled with electrons, and measured the energy of the system. After filtering the data to remove outcomes that violated the known rules of particle conservation, they applied a calibration technique to correct for the small errors inherent in current quantum hardware. The result was a ground-state energy estimate that was remarkably close to the known exact value, with a relative error of just 3.5 percent. This level of accuracy was achieved using significantly fewer quantum measurements and fewer complex two-qubit gates than other leading methods that rely on repeated feedback loops or deep quantum circuits. The researchers demonstrated that by separating the quantum preparation from the classical optimization, they could reuse the same quantum data to test many different mathematical models of electron interaction without ever needing to run the quantum computer again.
The study also explored how this method might scale up to larger systems. By analyzing the data, the authors found that the number of measurements required to maintain a fixed level of precision grows exponentially with the size of the grid, but at a rate that is manageable for near-term quantum devices. They compared their approach to other hybrid algorithms, such as quantum-selected configuration interaction and quantum Krylov methods. While those methods can offer rigorous mathematical guarantees, they often require vastly more quantum resources—either millions of times more samples or thousands of times more complex gates—to reach the same level of accuracy on the small systems tested. The new method's ability to decouple the quantum measurement from the classical optimization allows for a flexibility that the other methods lack; researchers can swap out the mathematical model for the electron interactions after the data is collected, testing different theories against the same quantum experiment.
This work represents a proof of principle rather than a final solution to the problem of strongly correlated electrons. The researchers acknowledge that their current demonstration was limited to a small 4 by 4 grid, and that larger systems will require more advanced state preparation techniques. However, the success of the feedback-free hybrid algorithm suggests a viable path forward. By using the quantum processor strictly as a tool to generate a specific, hard-to-create state and then letting classical computers do the heavy lifting of optimization, the team has shown that quantum advantage in materials science might not require the massive, error-corrected machines of the distant future. Instead, it may be achievable today by carefully designing algorithms that respect the unique strengths of both quantum and classical hardware, turning a fundamental mismatch of bases into a complementary partnership.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.