🔬 physics

Implementing Hamiltonian Renormalization Group Flow on Quantum Computers with VAPOR

This paper introduces VAPOR, a variational quantum algorithm designed to implement Hamiltonian renormalization group flow on quantum computers to identify discretization-error-free operators and fixed points, demonstrated through a toy model in SU(2) Yang-Mills theory.

Original authors: Federica Fragomeno, Jorden Roberts, Saeed Rastgoo, Klaus Liegener

Published 2026-09-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Federica Fragomeno, Jorden Roberts, Saeed Rastgoo, Klaus Liegener

Original paper licensed under CC BY 4.0 (https://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

The universe, at its most fundamental level, is not a smooth, continuous fabric but a seething sea of quantum fields. Physicists have long struggled to describe how these fields interact to create the particles and forces we observe, particularly when those interactions become so strong that standard mathematical tools break down. To study these intense environments, scientists often turn to a method called lattice gauge theory. Imagine taking the smooth continuum of space and replacing it with a grid, like a chessboard, where calculations can be performed point by point. This discretization allows computers to simulate complex quantum systems, but it introduces a problem: the grid itself is an artificial construct. The results depend on the size of the squares, and as the squares get smaller to mimic real space, the calculations become impossibly heavy, often requiring more computing power than exists on Earth. Furthermore, the artificial grid can distort the physics, creating errors that are hard to separate from the true behavior of nature. The ultimate goal is to find a way to remove the grid entirely, recovering a description of the universe that is independent of any artificial resolution, a state known as a continuum theory.

A team of researchers at the University of Alberta and the Walther-Meissner-Institute has proposed a new way to tackle this problem using the emerging power of quantum computers. They developed a method called VAPOR, which stands for Variational Algorithm for Pauli Orbit Renormalization. Instead of trying to brute-force the calculations on a classical supercomputer, they use a quantum computer to act as a specialized lens. This lens helps them identify which mathematical descriptions of physical forces remain stable as the grid is refined and eventually disappears. The core idea is to find "fixed points"—specific configurations of the physical laws that do not change no matter how closely you look at them. If a theory has such a fixed point, it means the theory is consistent and can describe the real, continuous universe without the artifacts of the grid.

The researchers tested their method on a simplified model of a complex force known as the Yang-Mills theory, which governs the strong nuclear force that holds atomic nuclei together. In their simulation, they started with a basic, initial version of the force that contained grid-induced errors. They then applied their algorithm to see how this force would change as they theoretically zoomed in, refining the grid. The quantum computer helped them navigate the vast space of possible mathematical variations, searching for the specific version of the force that remained unchanged by this refinement process. The results were precise: the algorithm successfully identified the correct, error-free version of the force. In cases where the starting point was already perfect, the method confirmed it. In cases where the starting point was flawed, the method corrected it, stripping away the artificial grid effects to reveal the underlying, stable physics.

This success is significant because it demonstrates a viable path toward defining quantum field theories without relying on the approximations that currently limit our understanding. The researchers showed that by breaking the problem down into smaller, manageable pieces and using a quantum computer to optimize the solution, they could find these stable points even in systems that are too complex for traditional computers. They verified their findings by comparing the quantum computer's output against known analytical solutions, finding a perfect match. This suggests that the approach is not just a theoretical possibility but a practical tool that can be scaled up.

The method works by treating the physical laws as a collection of building blocks. As the grid is refined, these blocks mix and change. The algorithm tracks how they evolve, looking for a combination that stops changing. It does this by preparing specific quantum states that act as probes, measuring how well a proposed set of laws holds up under scrutiny. If the laws are unstable, the measurement shows a mismatch; if they are stable, the measurement aligns perfectly. The team found that this process avoids a common pitfall in quantum computing known as the "barren plateau," where the search for the correct answer becomes so difficult that the computer gets lost in a sea of noise. By focusing on specific, stable pathways, their method keeps the search efficient and directed.

While the current study used a simplified model to prove the concept, the implications are broad. The researchers believe this technique can be applied to more complex, realistic models of the universe, including those that describe the behavior of particles in the early moments after the Big Bang or inside neutron stars. The ability to construct theories that are free from grid artifacts could finally allow physicists to simulate strongly interacting systems with the precision required to make new predictions. The work does not claim to have solved the entire problem of quantum gravity or the mass gap of the strong force, but it provides a concrete, working tool to take the next step. It shows that quantum computers can do more than just simulate particles; they can help refine the very rules that govern those particles, guiding us toward a clearer picture of the continuum universe.

Technical Summary: Implementing Hamiltonian Renormalization Group Flow on Quantum Computers with VAPOR

Problem Statement
The construction of interacting continuum quantum field theories (QFTs) remains a significant conceptual and computational challenge. While lattice gauge theory (LGT) successfully regulates ultraviolet divergences through discretization, standard discretizations introduce ambiguities and errors that must be validated against continuum physics. Standard renormalization group (RG) techniques in condensed matter and high-energy physics often focus on coarse-graining to find effective theories, but they do not necessarily ensure "cylindrical consistency"—the mathematical requirement that a family of discrete operators across scales can be reconstructed into a continuum theory via inductive limits.

Hamiltonian RG offers a pathway to identify operators that are stable under RG flow (fixed points), thereby defining a cylindrically consistent family of operators. However, implementing this on classical computers is prohibitive due to three main challenges:

The generation of increasingly non-local interactions during RG flow, which drastically increases the complexity of matrix element computations.
The lack of guarantee that flows from standard discretizations converge to physically relevant fixed points.
The exponential growth of Hilbert space dimensions with resolution, making explicit computation and storage of RG flows computationally intractable.

Methodology: VAPOR
To address these bottlenecks, the authors introduce VAPOR (Variational Algorithm for Pauli Orbit Renormalization), a variational quantum algorithm designed to identify RG fixed points on quantum hardware. The methodology proceeds as follows:

Operator Decomposition: Local, translation-invariant operators $O_m$ are expanded in a Pauli basis ( $O_m = \sum c_\alpha P_\alpha$ ).
Pauli Orbits: Instead of attempting to diagonalize the full, exponentially large RG matrix, VAPOR decomposes the problem into finite-dimensional sub-problems. It identifies "Pauli orbits" for each Pauli string $P_\alpha$ in the operator's support. An orbit is defined as the minimal subset of Pauli strings containing $P_\alpha$ that is closed under the RG coarse-graining map $A$ . These orbits act analogously to Krylov subspaces, decoupling the fixed-point problem.
Variational Optimization: Within each orbit, the fixed-point condition is formulated as a variational optimization problem. A residual operator $R(\theta) = O_\alpha(\theta) - A(O_\alpha(\theta))$ is defined, where $\theta$ represents variational coefficients. The algorithm minimizes a cost function $C(\theta) = \sum_I |\langle \psi_I | R(\theta) | \psi_I \rangle|^2$ using reference states $|\psi_I\rangle$ .
Iterative Search: The algorithm employs a hierarchical search strategy. It begins with low-order truncations of the orbit (extensions) and iteratively enlarges the search space only if a fixed point is not found, ensuring that spurious solutions are not produced and computational resources are used efficiently.

Key Contributions

Algorithmic Framework: The paper proposes VAPOR as a method to make the identification of Hamiltonian RG fixed points computationally tractable on quantum devices by restricting optimization to RG-invariant Pauli orbits.
Avoidance of Barren Plateaus: Unlike standard Variational Quantum Eigensolvers (VQE) where parameter counts grow with Hilbert space size (leading to barren plateaus), VAPOR ties the parameter count to the size of the Pauli orbits derived from the bare operator. This allows the algorithm to avoid the exponential vanishing of gradients.
Toy Model Demonstration: The authors apply VAPOR to a symmetry-restricted 2D SU(2) Yang-Mills theory. By enforcing translational symmetry in one direction, the system is reduced to a 1D chain with self-intersecting loops, preserving the non-Abelian Gauss constraint complexities while remaining computationally manageable.
Analytical Verification: The study utilizes a specific "filling kernel" embedding to analytically compute the RG flow of a 4-flux operator. This provides a benchmark against which the quantum algorithm's results can be directly compared.

Results
The authors implemented VAPOR on a simulated Quantum Processing Unit (QPU) using Qiskit's Statevector simulator.

Fixed-Point Recovery: For a 4-flux operator with cutoffs $j_{max} = 1/2$ (6 qubits) and $j_{max} = 3/2$ (12 qubits), VAPOR successfully identified the fixed-point operators. The variational results matched the analytically derived fixed points exactly, regardless of whether the bare operator was already a fixed point or required renormalization.
Physical Observables: Using the VAPOR-derived fixed-point operator, the authors computed expectation values on variationally prepared ground states (via VQE). These results showed good agreement with exact analytical values, demonstrating that physical continuum observables can be systematically extracted from near-term quantum simulations.
Orbit Stability: In the specific toy model tested, the Pauli orbits stabilized at order $N_\alpha \le 1$ , meaning the variational search terminated after at most two iterations, highlighting the efficiency of the orbit decomposition for this class of operators.

Significance and Claims
The paper claims that VAPOR provides a pragmatic route to constructing cylindrically consistent Hamiltonians, a necessary step for the non-perturbative definition of continuum QFTs.

Scalability: By representing observables and their RG flow natively on qubit spaces, the method circumvents the exponential storage limitations of classical numerics.
NISQ Compatibility: The algorithm utilizes shallow circuits and avoids the barren plateau problem, making it suitable for Noisy Intermediate-Scale Quantum (NISQ) devices.
Future Outlook: The authors note that while current hardware limitations necessitate variational methods, a fault-tolerant era could allow for direct implementation of embedding maps as multi-qubit unitaries. However, for the current generation of hardware, VAPOR offers a scalable approach to operator-level renormalization in regimes inaccessible to classical computation, such as higher cutoffs and large lattice geometries.

The work is presented as a proof-of-concept demonstration. The authors emphasize that while the toy model allows for analytical verification, the framework is general and intended to be applied to more complex settings in future research.

More like this