Digital dissipative state preparation for frustration-free gapless quantum systems

This paper introduces a fully digital protocol utilizing local projective measurements and unitary feedback to efficiently prepare algebraically correlated, a priori unknown ground states of frustration-free gapless quantum systems, with performance verified across various models and shown to reveal universal critical properties through transient cooling dynamics.

The Gist

Imagine you are trying to find the absolute lowest point in a vast, foggy, and mountainous landscape. This landscape represents a complex quantum system, and the lowest point is its "ground state"—the most stable, calm, and energy-efficient configuration possible.

In the world of quantum computing, finding this lowest point is incredibly hard. Usually, scientists try to "slide" down the mountain slowly and carefully (a method called adiabatic evolution). But if the mountain has flat spots or tricky valleys (which happens in "gapless" systems), you might get stuck, or it might take forever to reach the bottom.

This paper introduces a new, clever way to get to the bottom: Digital Dissipative State Preparation. Think of it not as sliding, but as a game of "Hot or Cold" with a magical reset button.

Here is how it works, broken down into simple concepts:

1. The Game: "Check the Rules, Fix the Mistakes"

Imagine the quantum system is a giant puzzle made of many small pieces. The rules of the puzzle say that certain pieces must fit together perfectly. If they don't, there is a "mistake" (high energy).

• The Check: The computer looks at small groups of pieces (local projectors) to see if they are following the rules.
• The Mistake: If a group is broken (the rule is violated), the computer knows exactly where the problem is.
• The Fix: Instead of trying to gently nudge the whole mountain, the computer applies a quick, sharp "correction" (a unitary feedback) to that specific spot to fix the mistake.

2. The Magic: "Stochastic Resets" (The Reset Button)

Here is the tricky part: In these complex quantum systems, fixing one mistake might accidentally break a neighbor. It's like trying to fix a wobbly table leg, but your hammer knocks the table over.

In this new protocol, when a mistake is found and fixed, there is a chance the system gets "reset" to a simpler starting state.

• The Analogy: Imagine you are trying to walk down a dark, winding staircase. Every time you trip (find a mistake), you don't just try to stand up; you are teleported back to the top of the stairs, but slightly closer to the bottom than before.
• The Result: You keep getting teleported back, but each time you land, you are in a slightly better position. Eventually, you stop tripping entirely and reach the bottom.

3. The Quasiparticles: "The Ants in the System"

The authors explain that the "mistakes" in the system behave like tiny, energetic ants (quasiparticles) running around.

• The protocol acts like a cooling fan. It catches these ants when they are active (high energy) and resets them.
• Over time, the ants lose their energy and settle down. The paper proves that this "cooling" happens at a speed that is mathematically predictable and surprisingly fast, even for huge systems.

4. Why This is a Big Deal

• No Map Needed: You don't need to know the shape of the mountain (the ground state) beforehand. You just need the rules of the puzzle (the Hamiltonian). The system figures out the rest on its own.
• Digital vs. Analog: Old methods tried to simulate a smooth, continuous slide (analog), which is hard to do perfectly on current computers. This method uses "digital" steps (measure, check, fix), which are much easier for today's quantum computers to handle.
• Speed: The paper shows that for many difficult systems, the time it takes to reach the ground state is directly related to how "wide" the gap is between the bottom and the next step up. It's fast enough to be useful on near-future quantum computers.

The Bottom Line

The authors have invented a digital "cooling" protocol that uses measurements and quick fixes to guide a quantum system to its most stable state. Instead of slowly sliding down a slippery slope, it's like playing a game where you keep getting reset to a better position until you finally win. This opens the door to simulating complex materials and solving problems that were previously too difficult for quantum computers to tackle.

Technical Summary

Here is a detailed technical summary of the paper "Digital dissipative state preparation for frustration-free gapless quantum systems" by Feldmeier et al.

1. Problem Statement

Preparing the ground states of quantum many-body systems is a fundamental task for quantum simulation. While preparing gapped ground states is relatively well-understood (e.g., via adiabatic evolution or variational algorithms), preparing gapless ground states presents significant challenges:

• Critical Slowing Down: Near quantum critical points, the energy gap $\Delta$ closes as the system size $N$ increases ($\Delta \sim N^{-z/d}$), causing adiabatic protocols to require exponentially long times.
• Algorithmic Overhead: Existing digital methods often require continuous evolution (Trotterization) or large initial overlaps with the ground state, which are difficult to achieve for unknown, highly entangled states.
• Frustration-Free Systems: Many critical models (e.g., Heisenberg, Fredkin chains, Resonating Valence Bond states) are frustration-free, meaning their Hamiltonian can be written as a sum of local projectors $H = \sum P_i$ where the ground state $|\Omega\rangle$ satisfies $P_i |\Omega\rangle = 0$ for all $i$. However, these projectors generally do not commute, making dynamics complex.

The goal is to develop a fully digital, scalable protocol that prepares these unknown, algebraically correlated ground states efficiently without analog control or prior knowledge of the state.

2. Methodology

The authors propose a digital dissipative cooling protocol based on local projective measurements and unitary feedback.

The Protocol

1. Measurement: The non-commuting local projectors $\{P_i\}$ of the Hamiltonian are grouped into $A$ layers ($B_1, \dots, B_A$) such that projectors within a layer commute.
2. Feedback: In each round, projectors in a layer are measured.
   • If the outcome is $P_i = 0$ (satisfied), no action is taken.
   • If the outcome is $P_i = 1$ (violated), a local unitary correction $U_C(i)$ is applied to lower the local energy (e.g., flipping a spin to break a singlet).
3. Iteration: This process repeats for $t$ rounds. The protocol is "heralded" by the absence of violations in subsequent rounds.

Theoretical Framework

The authors model the dynamics as an effective cooling process of quasiparticles:

• Imaginary Time Evolution: Rounds where no violations occur ($P_i=0$) act as an imaginary time evolution operator $e^{-H\tau}$, suppressing high-energy components.
• Stochastic Resets: When a violation occurs ($P_i=1$), the system is "reset" to a localized excitation state.
• Single-Particle Mapping: For the single-particle sector of ferromagnetic Heisenberg models, the authors derive an exact solution mapping the protocol to a Markov process involving imaginary time evolution and stochastic resets.

3. Key Contributions & Theoretical Results

Universal Scaling Law

The central theoretical contribution is the derivation of the state preparation time $T_c$ required to reach a target infidelity $\epsilon$. The scaling depends on the ratio $\beta = d/z$, where $d$ is the spatial dimension and $z$ is the dynamical critical exponent:
$$T_c = O\left( \Delta^{-\max(1, \beta)} \left| \log\left( \frac{\epsilon \Delta^{\min(1, \beta)}}{N} \right) \right| \right)$$

• Case $\beta < 1$ ($d < z$): The convergence is dominated by the number of resets. The time scales as $T_c \sim \Delta^{-1}$.
• Case $\beta > 1$ ($d > z$): The convergence is dominated by the imaginary time evolution. The time scales as $T_c \sim \Delta^{-\beta}$.
• Case $\beta = 1$ ($d = z$): A marginal case with logarithmic corrections, $T_c \sim \Delta^{-1} |\log \Delta|$.

Crucially, for many physical systems (like the 1D Heisenberg chain where $d=1, z=2 \implies \beta=0.5$), the protocol achieves a preparation time scaling linearly with the inverse gap ($T_c \sim \Delta^{-1}$), matching the theoretical lower bound for reset-free trajectories despite the stochastic nature of the protocol.

Transient Dynamics

The theory predicts specific transient behaviors for the energy decay $E(t)$:

• Early Time: Algebraic decay $E(t) \sim t^{-\max(1-\beta, 0)}$.
• Late Time: Exponential decay $E(t) \sim e^{-\lambda \Delta^{\max(1, \beta)} t}$.

4. Numerical Results

The authors verified these predictions using numerical simulations (Matrix Product States and Exact Diagonalization) on several models:

1. 1D Heisenberg Chain ($d=1, z=2, \beta=0.5$):
   • Observed algebraic decay $E(t) \sim t^{-0.5}$ at early times.
   • Late-time decay rate linear in $\Delta$.
   • Preparation time $T_c \sim \Delta^{-1}$.
2. 2D Heisenberg Model ($d=2, z=2, \beta=1$):
   • No clear algebraic regime; decay follows the marginal case with log-corrections.
   • $T_c \sim \Delta^{-1} |\log \Delta|$.
3. Fredkin Spin Chain ($d=1, z \approx 8/3, \beta \approx 3/8$):
   • Demonstrated scaling consistent with $\beta = 3/8$, including early-time algebraic decay $t^{-5/8}$.
4. 2D Resonating Valence Bond (RVB) States ($d=2, z=2, \beta_{eff}=0.5$):
   • Surprisingly, the 2D dimer model exhibited effective 1D behavior ($\beta_{eff}=0.5$), suggesting quasiparticles explore an effective lower dimension.

5. Significance and Implications

• Efficiency vs. Adiabaticity: The protocol outperforms standard adiabatic preparation. While adiabatic ramps require time $T_{ramp} \sim \Delta^{-1}$ but suffer from Trotterization overheads scaling as $O(\Delta^{-(1+1/n)})$, this digital protocol achieves $O(\Delta^{-1})$ scaling with a constant circuit depth per round.
• Hardware Feasibility: The protocol is fully digital, requiring only local measurements and finite-depth unitary corrections. It avoids continuous analog evolution, making it suitable for near-term noisy intermediate-scale quantum (NISQ) devices and future error-corrected architectures.
• No Prior Knowledge: Unlike filtering methods that require a good initial guess, this protocol works from simple product states (e.g., Néel or columnar states) without needing to know the ground state wavefunction.
• Error Resilience: The dissipative nature stabilizes the system. Even with noise, the protocol can reach high-fidelity states, and post-selection or heralded strategies can further improve performance.
• Universal Physics: The work establishes a universal connection between the geometry of quasiparticle exploration ($d$) and the dynamical critical exponent ($z$) in determining the speed of digital cooling, providing a new lens to understand non-equilibrium quantum dynamics.

In summary, this paper introduces a robust, theoretically grounded, and numerically verified digital protocol for preparing complex gapless quantum ground states, offering a promising pathway for quantum simulation of critical phenomena on future quantum hardware.