Preparation of Fractional Quantum Hall States on Quantum Computers

This paper introduces a direct quantum circuit construction method that efficiently prepares fractional quantum Hall states, specifically the $\nu=1/3$ Laughlin state on a sphere, with reduced gate complexity and hardware-feasible control pulses for arbitrary geometries, offering a practical pathway for implementation on both near-term and fault-tolerant quantum devices.

The Gist

Imagine you are trying to bake a very specific, complex cake called a "Fractional Quantum Hall State." This isn't just any cake; it's a special dessert made of electrons that behave like a single, giant, magical entity. Scientists have long wanted to bake this cake on a quantum computer (a super-powerful calculator that uses the rules of the subatomic world), but it has been incredibly difficult.

Here is the story of how the authors of this paper figured out a better way to bake it.

The Problem: Two Old, Flawed Recipes

Before this paper, scientists tried two main ways to make this quantum cake, but both had big problems:

1. The Slow Cooker Method: This involved slowly heating up a complex machine (a "Hamiltonian") to guide the electrons into the right shape. It's like trying to shape clay by slowly warming it up. The problem? It takes forever, requires very delicate temperature control, and the machine needed to be built in a very specific, rigid way that is hard to build in real life.
2. The Flatland Method: This involved using a shortcut that only works if you squish the cake into a very thin, flat strip (like a long noodle). While this makes the math easier, it changes the cake's flavor. It misses the special "round" properties that make the real cake so magical.

The New Solution: A Custom Blueprint

The authors, Hao Wu, Lei-Yi-Nan Liu, and their team, decided to stop trying to slowly cook the clay or squish it into a noodle. Instead, they drew a custom blueprint (a quantum circuit) to build the cake directly, step-by-step.

They chose a specific, difficult version of the cake: the $\nu = 1/3$ Laughlin state on a sphere.

• The Sphere: Imagine the electrons are living on the surface of a ball, not a flat sheet or a thin tube. This is the "real" 3D shape of the problem, which is much harder to solve but much more accurate.
• The Blueprint: They realized that this specific cake has a hidden pattern. It's like a tree where most branches are empty. Because of this "sparse" pattern, they didn't need to build the whole tree; they only needed to build the specific branches that mattered.

The Three Methods They Tested

To prove their blueprint works, they tried three different ways to bake it on a quantum computer:

1. The Exact Blueprint (Direct Circuit):
   They wrote a precise set of instructions (a circuit) that builds the state perfectly, like following a recipe with exact measurements.

   • The Result: This was the most efficient. It used the fewest steps (gates) and the least amount of time. It's like using a laser cutter to make the cake instead of carving it by hand.

2. The Guess-and-Check Method (Variational Circuit):
   This is like a baker who doesn't know the exact recipe. They start with a basic dough and keep tweaking the ingredients (adjusting knobs on the computer) until the cake tastes right.

   • The Result: It worked, but it took much longer and required many more steps than the Exact Blueprint. It's flexible, but less efficient.

3. The Remote Control Method (Optimal Control):
   Instead of building the cake step-by-step, they treated the quantum computer like a remote-controlled car. They sent a series of radio signals (control pulses) to steer the electrons directly into the right shape.

   • The Result: They tested this on two types of "cars": Superconducting circuits (like the ones in Google's quantum computers) and Rydberg atoms (using super-cooled atoms). Both worked very well, proving you can drive the electrons into this state without needing a slow, gradual process.

Why This Matters (The "Noise" Test)

Real quantum computers are "noisy"—they are like trying to bake a cake in a windy kitchen where the oven temperature fluctuates.

• The authors tested their methods against this "wind."
• They found that their Exact Blueprint was the most robust. Even when the kitchen was messy (noisy), the cake still looked and tasted mostly right.
• They also checked if the cake had the right "topology" (its internal structure). They looked at the "entanglement spectrum," which is like checking the internal crumb structure of the cake to ensure it's truly the magical quantum kind, not just a fake imitation. Their methods passed this test with flying colors.

The Bottom Line

This paper shows that we don't need to wait for perfect, slow machines to create these exotic quantum states. By using smart, direct blueprints that take advantage of the state's hidden patterns, we can build these complex quantum "cakes" efficiently on today's imperfect, noisy quantum computers.

They successfully baked a 7-ingredient version of the cake and showed that the recipe can be scaled up to 10 ingredients, opening the door to creating even more complex quantum matter in the future.

Technical Summary

Technical Summary: Preparation of Fractional Quantum Hall States on Quantum Computers

Problem Statement
The realization of fractional quantum Hall (FQH) states on quantum computers represents a significant challenge at the intersection of condensed matter physics and quantum information science. Unlike integer quantum Hall states, FQH states arise from strong interactions and possess intrinsic topological order with long-range entanglement, making them difficult to simulate. Existing preparation methods face distinct limitations:

1. Hamiltonian-based approaches: These rely on (quasi-)adiabatic evolution of complex parent Hamiltonians. They often require implementing difficult multipartite interactions and deep circuits (or long evolution times) to maintain adiabaticity. Furthermore, they are typically tailored to specific models and geometries.
2. Direct circuit approaches: Current methods for direct state preparation are largely confined to effectively one-dimensional systems near the "thin cylinder" or "thin torus" limit. In this regime, the wavefunction simplifies into a charge-density-wave (CDW) configuration with local squeezing rules. However, these quasi-one-dimensional descriptions fail to capture the essential non-local features and universal entanglement structures of genuine two-dimensional FQH states.

Consequently, there is a lack of efficient, scalable, and hardware-relevant protocols for preparing generic FQH states on arbitrary geometries, particularly on noisy intermediate-scale quantum (NISQ) devices.

Methodology
The authors propose a complementary scheme based on direct quantum circuit construction that operates on arbitrary geometries, specifically targeting the $\nu = 1/3$ Laughlin state on a sphere with seven orbitals (three particles). The study evaluates three distinct preparation strategies:

1. Direct Exact Circuit Construction:

   • Instead of relying on a parent Hamiltonian, the authors exploit the sparsity of the FQH wavefunction in the occupation-number basis.
   • They utilize a binary-tree (decision-diagram) representation, recursively decomposing the target state.
   • Crucially, they leverage the specific structure of the Laughlin state (root configuration and inward squeezing) to significantly reduce control requirements. Unlike generic state preparation which requires multi-controlled gates dependent on all preceding qubits, this method restricts dependencies, allowing the 7-qubit state to be prepared with only 12 single-qubit rotations and 14 CNOT gates without ancillary qubits.

2. Variational Quantum Circuits (VQC):

   • A parameterized ansatz is constructed using layers of single-qubit rotations ($R_y, R_x$) and nearest-neighbor entangling blocks, tailored to a 2D planar qubit topology.
   • Parameters are optimized using the AdaBelief optimizer to maximize fidelity against the target state.
   • This approach serves as a flexible, hardware-adaptable alternative, though it generally requires deeper circuits and more two-qubit gates than the exact construction.

3. Optimal Control Techniques:

   • The authors employ the dressed chopped random basis (dCRAB) algorithm to design time-dependent control pulses that drive the system from a trivial product state to the target FQH state.
   • This non-adiabatic approach bypasses the need for gap protection and long evolution times.
   • Protocols are designed for two specific hardware platforms: superconducting qubits (using microwave drives) and Rydberg atom arrays (using laser Rabi frequencies and detunings).

Key Results

• Exact Circuit Efficiency: The direct construction for the 7-qubit $\nu = 1/3$ Laughlin state achieves the target state with a minimal gate count (14 CNOTs). Compared to variational approaches, this method significantly reduces circuit depth and two-qubit gate requirements.
• Variational Performance: A VQC with 4 composite layers (56 parameters, 32 CNOTs) achieves 97.9% fidelity, while a 5-layer circuit reaches 99.99%. The study demonstrates that qubit connectivity topology is critical; 2D planar layouts outperform 1D chains or modified layouts.
• Optimal Control Fidelity:
  • For superconducting systems, increasing evolution time from 0.05 $\mu$s to 0.10 $\mu$s improves fidelity from 92.85% to 96.30%.
  • For Rydberg atom arrays, the dCRAB algorithm achieves 96.26% fidelity.
  • The optimal control method successfully identifies experimentally feasible protocols for both platforms.
• Noise Robustness:
  • Under depolarizing noise models, the exact circuit exhibits the slowest fidelity degradation, retaining >92% fidelity even with a 0.625% two-qubit error rate (99.5% gate fidelity).
  • VQC and optimal control schemes show higher sensitivity to noise, particularly the Rydberg platform which is more susceptible to amplitude fluctuations than superconducting systems.
• Topological Characterization: Beyond fidelity, the prepared states are characterized by:
  • Entanglement Spectrum (ES): All methods preserve the low-lying structure and the entanglement gap characteristic of the Laughlin state, even under noise.
  • Density and Correlations: The orbital-resolved particle density and two-point correlation functions match the theoretical target, confirming the preservation of the incompressible quantum liquid nature and many-body correlations.

Significance and Claims
The paper claims to provide an efficient and hardware-relevant pathway for realizing generic FQH states on both NISQ and fault-tolerant quantum devices. By moving beyond the thin-cylinder limit, the authors demonstrate that genuine two-dimensional topological states can be prepared directly on quantum computers without relying on complex parent Hamiltonians.

The work highlights that exploiting the intrinsic sparsity and structure of the FQH wavefunction allows for a substantial reduction in circuit complexity compared to generic state-preparation schemes. While the variational and optimal control methods offer flexibility for different hardware constraints, the direct circuit construction is presented as the most favorable for near-term implementations due to its low gate count and superior noise robustness. The authors conclude that their results offer a complementary pathway to existing methods, enabling the study of strongly correlated topological states in geometries free from edge effects and quasi-one-dimensional approximations. Future work is identified as necessary to scale these methods to larger systems (e.g., 10 qubits) and to explore other filling factors, such as the non-Abelian $\nu = 5/2$ Moore-Read state.