⚛️ quantum physics

Floquet-ADAPT-VQE: A Quantum Algorithm to Simulate Non-Equilibrium Physics in Periodically Driven Systems

This paper introduces Floquet-ADAPT-VQE, a hybrid quantum-classical algorithm that leverages the Floquet-Hilbert space formalism to efficiently simulate non-equilibrium dynamics in periodically driven systems by computing quasienergies, Floquet eigenstates, and observable expectation values with improved convergence.

Original authors: Abhishek Kumar, Karunya Shirali, Nicholas J. Mayhall, Sophia E. Economou, Edwin Barnes

Published 2026-10-19

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Abhishek Kumar, Karunya Shirali, Nicholas J. Mayhall, Sophia E. Economou, Edwin Barnes

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

Nature is rarely static. While much of physics focuses on systems at rest, in perfect balance, a vast and fascinating realm exists where matter is constantly being pushed and pulled by external forces. Imagine a quantum system—a collection of atoms or electrons behaving according to the strange rules of the subatomic world—that is being rhythmically shaken or driven by a repeating pulse of energy. These are not systems that settle down; they are perpetually in motion, driven by a clockwork rhythm that never stops. In these driven environments, matter can exhibit behaviors that are impossible in a calm, resting state. It can form new phases of matter, such as time crystals, which repeat their structure not in space, but in time, or develop exotic topological properties that protect them from disorder. Understanding these non-equilibrium states is crucial for controlling quantum materials and building future technologies, but simulating them on a computer is notoriously difficult. The mathematics required to track a system that changes every fraction of a second grows so complex so quickly that even the most powerful supercomputers struggle to keep up.

To tackle this challenge, a team of researchers at Virginia Tech has developed a new method that allows quantum computers to simulate these rhythmic systems more efficiently than ever before. Their approach, called Floquet-ADAPT-VQE, transforms the problem of a time-varying system into a problem that looks like a static one, making it possible to use current, imperfect quantum hardware to study these complex dynamics. The core of their innovation lies in a mathematical framework known as the Floquet-Hilbert space. Instead of trying to calculate the system's evolution step-by-step as time ticks forward—a process that requires deep, error-prone calculations on a quantum computer—the researchers map the entire repeating cycle onto a single, larger, but unchanging structure. Think of this structure as a vast library where every book represents a different moment in the cycle. By organizing the information this way, the system's behavior over time becomes a set of fixed relationships that a quantum computer can analyze all at once, rather than having to march through time one step at a time.

The researchers built a hybrid algorithm that combines the processing power of a classical computer with the unique capabilities of a quantum processor. This algorithm, an adaptation of a technique called ADAPT-VQE, works by constructing a quantum circuit piece by piece. It starts with a simple state and iteratively adds small, specific quantum operations that are most likely to improve the accuracy of the simulation. The goal is to find the "quasienergies" and "Floquet states" of the system. In simple terms, quasienergies are the special energy levels that a driven system settles into, and Floquet states are the specific patterns the system adopts while being driven. Finding these is essential because they dictate how the system will behave, whether it will conduct electricity, how it will respond to magnetic fields, or if it will exhibit those exotic time-crystal behaviors. The team's method is particularly clever because it identifies a specific starting point for the calculation that remains stable regardless of how many extra "helper" bits of information the computer needs to store the time-dependent data. This stability ensures the algorithm converges quickly and reliably, avoiding the pitfalls that often cause other quantum simulations to fail or take too long.

To prove their method works, the team ran detailed numerical simulations on a model of a chain of spins—a common representation of magnetic atoms—subjected to a periodically changing magnetic field and varying interaction strengths. They tested the algorithm across a wide range of driving frequencies and amplitudes. The results were striking: the algorithm successfully identified the correct energy levels and states of the system with high precision. Crucially, they demonstrated that by choosing the right initial state for their calculation, the energy of the starting point did not drift upward as they added more helper bits or increased the speed of the driving force. This independence from the size of the simulation and the speed of the drive is a significant breakthrough, as it means the method can be scaled up to study larger, more complex systems without becoming computationally unmanageable. Furthermore, the researchers showed that once the system's state is prepared, they could calculate how the system behaves at any specific moment in time using a quantum circuit of fixed depth. This means the complexity of the calculation does not grow as the simulation time increases, a major advantage over previous methods where the circuit would have to grow longer and longer to track the system's evolution.

The implications of this work extend beyond just solving a difficult math problem. By providing a robust framework for simulating periodically driven systems, the researchers have opened a new door for studying non-equilibrium physics on quantum computers. Their method allows scientists to explore phenomena like time crystals and light-matter interactions in ways that were previously out of reach for noisy, intermediate-scale quantum devices. The team also highlighted that their approach avoids the need for certain complex, error-prone techniques like Trotterization, which breaks time evolution into tiny, discrete steps and often accumulates errors. Instead, their direct mapping of the time-periodic Hamiltonian into a static form offers a cleaner, more efficient path forward. While the current results are based on classical simulations of the quantum algorithm, the framework is designed to be implemented on actual quantum hardware. If successful, this could allow physicists to probe the exotic properties of driven quantum matter, potentially leading to the discovery of new materials or the development of ultra-sensitive sensors that exploit these rhythmic, non-equilibrium states. The work stands as a foundational step, proving that with the right mathematical tools, the chaotic dance of driven quantum systems can be tamed and understood.

Technical Summary: Floquet-ADAPT-VQE

Problem Statement
Periodically driven (Floquet) quantum systems exhibit non-equilibrium phenomena absent in static systems, such as time crystals and Floquet topology. However, simulating these systems is significantly more challenging than simulating equilibrium systems due to the exponential growth of the Hilbert space and the errors introduced by approximating time evolution (e.g., via Trotterization). While digital quantum computers offer a universal platform for such simulations, current approaches face specific limitations:

Time-domain algorithms often require deep circuits involving Trotterization and Iterative Quantum Phase Estimation (IQPE), limiting them to short time periods or high frequencies.
Frequency-domain algorithms (e.g., variational Hamiltonian ansatz) often rely on auxiliary spaces with limited dimensions, lack general prescriptions for Pauli decomposition of auxiliary matrices for arbitrary qubit truncation, and struggle with ansatz initialization, leading to poor convergence.
General Gap: There is no established, general-purpose Pauli-string decomposition of the extended Floquet Hamiltonian, preventing systematic implementation of quantum algorithms within the Floquet-Hilbert space formalism. Furthermore, existing methods lack a framework to compute expectation values of observables with respect to Floquet states without deep circuits.

Methodology
The authors propose Floquet-ADAPT-VQE, a hybrid quantum-classical algorithm designed to simulate periodically driven systems by mapping them to a time-independent form using the Floquet-Hilbert space formalism.

Floquet-Hilbert Space Mapping:
- The time-periodic Hamiltonian $\hat{H}(t)$ is transformed into an effective time-independent extended Floquet Hamiltonian $\hat{\hat{H}}_F$ acting on a tensor product space $\mathcal{F} = \mathcal{A} \otimes \mathcal{H}$ , where $\mathcal{H}$ is the physical Hilbert space and $\mathcal{A}$ is an auxiliary space representing Fourier modes (Floquet zones).
- The authors provide a systematic method to decompose the auxiliary matrices (diagonal and off-diagonal) into Pauli strings native to qubit-based processors. They demonstrate that these matrices can be decomposed into a subset of Pauli strings scaling as $O(2^{n_a})$ rather than the full $4^{n_a}$ , where $n_a$ is the number of auxiliary qubits.
- To ensure the Hamiltonian is Hermitian and symmetric across Floquet zones after truncation, they introduce asymmetric correction terms ( $A^{asy}$ ) and provide their explicit Pauli decompositions.
Algorithm Design (Floquet-ADAPT-VQE):
- Cost Function: Instead of minimizing the expectation value of $\hat{\hat{H}}_F$ directly (which targets the lowest Floquet zone where truncation errors are largest), the algorithm minimizes the cost function $C_\lambda(\vec{\theta}) = \langle \psi(\vec{\theta}) | (\hat{\hat{H}}_F - \lambda \hat{\hat{I}})^2 | \psi(\vec{\theta}) \rangle$ . By choosing $\lambda$ within the central Floquet zone ( $-\Omega/2 < \lambda < \Omega/2$ ), the algorithm targets states with minimal truncation error.
- Initial State: A critical contribution is the identification of a specific auxiliary initial state $|0\rangle$ (an eigenstate of the diagonal auxiliary matrix $A_d$ with zero eigenvalue). The authors prove and demonstrate numerically that the squared Floquet energy of this state is independent of the number of auxiliary qubits ( $n_a$ ) and the driving frequency ( $\Omega$ ). This ensures the initial state remains close to the central Floquet zone, significantly improving convergence compared to random initial states.
- Operator Pool: A "mixed Floquet pool" is constructed, combining Pauli operators for the auxiliary space and problem-specific operators (e.g., two-local operators) for the physical space to manage gradient measurement costs.
Observables and Dynamics:
- The framework enables the calculation of time-dependent expectation values and the preparation of time-periodic Floquet states $|\phi(t)\rangle$ using fixed-depth quantum circuits.
- By applying time-dependent $Z$ -rotations to the auxiliary qubits and measuring in specific bases, the algorithm extracts micromotion dynamics without the circuit depth growing with evolution time (unlike Trotterization in the original Hilbert space).

Key Results
The authors validate the algorithm through classical numerical simulations of a periodically driven XYZ spin chain with an external magnetic field:

Convergence: Simulations confirm that the proposed initial state ( $|0\rangle \otimes |\phi_p\rangle$ ) yields a squared Floquet energy that does not increase with $n_a$ or $\Omega$ , whereas random initial states show degraded performance as these parameters increase.
Accuracy: The algorithm successfully computes quasienergies and Floquet eigenstates that match exact diagonalization results (obtained via the Floquet unitary $\hat{U}_F$ ) across various drive parameters, including different driving frequencies and amplitudes.
Spectrum Reconstruction: By tuning the shift parameter $\lambda$ , the algorithm successfully reconstructs the full quasienergy spectrum within the central Floquet zone.
Observables: The method successfully calculates expectation values for net magnetization and two-point correlation functions.

Significance and Claims
The paper claims to address fundamental gaps in the literature by providing:

A General Framework: A systematic Pauli decomposition of the extended Floquet Hamiltonian, enabling the implementation of both near-term (NISQ) and fault-tolerant quantum algorithms within the Floquet-Hilbert space.
Efficiency: An approach that avoids Trotterization and IQPE for computing quasienergies, allowing for the simulation of systems at arbitrary driving frequencies with shallower circuits compared to time-domain methods.
Robustness: A specific initial state strategy that ensures convergence is independent of the auxiliary space size and driving frequency, a known bottleneck in previous variational approaches.
Dynamic Access: A unique capability to access micromotion dynamics and time-periodic states using fixed-depth circuits, a feature not available in methods that only access stroboscopic dynamics or require deep time-evolution circuits.

The authors position Floquet-ADAPT-VQE as a foundational tool for studying non-equilibrium phenomena, such as time crystals and light-matter interactions, in periodically driven many-body systems on current and future quantum hardware.

Technical Summary: Floquet-ADAPT-VQE

More like this