Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration

This paper introduces the weighted-projective Gerchberg–Saxton (WPGS) algorithm, a phase-stable method for dynamic hologram updates that ensures inter-frame phase continuity to suppress transient trap loss and accelerate reconfiguration in large-scale neutral-atom arrays.

The Gist

Imagine you are a master conductor trying to organize a massive orchestra of 1,000+ musicians (atoms) into a perfect formation on a stage. This is what scientists do when they build quantum computers using neutral atoms. They use invisible "hands" made of light (called optical tweezers) to pick up individual atoms and move them into specific spots to create a grid.

However, there's a big problem: moving these atoms isn't like moving chess pieces on a board. It's more like conducting a symphony where the music changes every second.

The Problem: The "Glitch" in the Transition

In this paper, the authors describe a common headache in this process. To move the atoms, they use a special digital mirror called an SLM (Spatial Light Modulator). Think of the SLM as a giant, high-tech projector screen that paints the light-traps.

When the computer needs to change the pattern to move the atoms, it has to refresh the screen.

• The Old Way (The "Flicker"): Imagine the projector screen suddenly switching from a picture of a "Circle" to a picture of a "Square." In the tiny split-second while the screen is changing, the pixels don't just snap instantly; they fade and morph. If the "Circle" and the "Square" aren't perfectly aligned in their timing (phase), the light waves cancel each other out during that transition.
• The Result: For a split second, the light holding the atom disappears. The atom gets cold, falls out of the trap, and is lost. This is like a tightrope walker losing their balance for a split second and falling off.

The old methods (called WGS) were great at making sure the final picture was perfect (all atoms in the right spot with equal strength), but they didn't care about how the picture got there. They let the "transition music" get messy, causing the tightrope to wobble.

The Solution: The "Smooth-Step" Algorithm (WPGS)

The authors introduce a new algorithm called WPGS (Weighted-Projective Gerchberg–Saxton). Here is how it works in simple terms:

1. The "Phase-Continuity" Rule
Instead of just asking, "What does the final picture look like?" WPGS asks, "How do we get from Picture A to Picture B without the light ever flickering?"
It forces the transition to be phase-stable. Imagine the tightrope walker again. The old method let the rope twist wildly while they moved. The new method ensures the rope stays perfectly straight and taut the entire time, even while the walker is moving.

2. The "Weighted" Balance
Sometimes, some atoms are harder to move than others (maybe they are in a crowded spot). The algorithm uses a "weighted" approach, like a smart traffic controller. It gives extra attention to the difficult spots to ensure everyone moves smoothly without bumping into each other or losing their grip.

3. The "Projective" Shortcut
The math behind this is complex, but the idea is simple: The algorithm projects the "ideal" path onto the "real" path. It finds the shortest, smoothest route that satisfies both the destination (where the atom needs to go) and the journey (keeping the light stable).

The Results: A Super-Stable Orchestra

The authors tested this on massive scales:

• 2D Grids: Moving 1,000 atoms in a flat square.
• 3D Grids: Moving atoms in a cube (3 layers deep).
• Complex Moves: Moving atoms between layers and rearranging them while they move.

The Outcome:

• No Lost Atoms: The "tightrope" never wobbled. The light intensity stayed strong even during the switch.
• Faster Speed: Because the algorithm is smarter, it finds the solution much faster (about 4x to 5x faster than the old way).
• Scalability: This proves we can build quantum computers with thousands of atoms without them falling apart during the setup.

The Big Picture Analogy

Think of the old method as a construction crew trying to move a giant bridge. They would build the new bridge, then knock down the old one, and hope the workers didn't fall in the gap while the bridge was being swapped.

The new WPGS method is like a magical, seamless bridge that extends and retracts. As the new section grows, the old section shrinks, but the road surface is always continuous. The cars (atoms) never feel a bump, never lose traction, and the whole process happens in the blink of an eye.

This breakthrough is a crucial step toward building the massive, fault-tolerant quantum computers of the future, ensuring that the "atoms" stay exactly where we need them to be, no matter how complex the dance gets.

Technical Summary

1. Problem Statement

The assembly and reconfiguration of large-scale, defect-free Rydberg atom arrays are critical for scalable neutral-atom quantum computing. This process relies on Dynamic Holographic Optical Tweezers (HOTs) using Spatial Light Modulators (SLMs) to move atoms from stochastic initial positions to precise target geometries.

The Core Challenge:

• Refresh Instability: Liquid-crystal SLMs do not switch instantaneously. During the refresh interval between two holographic frames ($l$ and $l+1$), the pixel phases evolve continuously (approximated by exponential relaxation).
• Destructive Interference: The transient optical field during this refresh is a coherent interpolation between the initial and final fields. If the relative phase between consecutive holograms ($\Delta\phi$) is uncontrolled, it can approach $\pi$ (180 degrees).
• Consequence: When $\Delta\phi \approx \pi$, destructive interference occurs, causing transient intensity dips (potentially to near-zero). This leads to atom loss (trap loss) or heating, destabilizing the array during reconfiguration.
• Limitation of Current Methods: Standard Weighted Gerchberg-Saxton (WGS) algorithms optimize for intensity uniformity but leave trap phases unconstrained. Consequently, they often produce large, unpredictable inter-frame phase excursions, making them unsuitable for robust, large-scale dynamic reconfiguration.

2. Methodology: The WPGS Algorithm

The authors propose the Weighted-Projective Gerchberg-Saxton (WPGS) algorithm, a phase-stable framework designed to enforce continuity between consecutive holograms.

Key Technical Components:

• Dual Constraints: The algorithm optimizes for two simultaneous goals during every frame update ($l \to l+1$):
  1. Intensity Continuity: Maintaining uniform trap depths (standard WGS goal).
  2. Phase Continuity: Explicitly constraining the inter-frame phase difference ($\Delta\phi$) to be near zero to prevent destructive interference.
• Mathematical Formulation:
  • The objective function minimizes the error between the synthesized field and a target field defined by both target amplitudes ($\sqrt{I_{tar}}$) and target phases ($\phi_{tar}$).
  • Objective: $\min_{\phi, s, W} \| W E(\phi) - s E_{tar} \|_2^2$
  • Variables:
    • $W$: A diagonal weight matrix to compensate for trap-to-trap amplitude variations.
    • $s$: A global complex scalar to handle global amplitude/phase offsets inherent to phase-only modulation.
    • $\phi$: The SLM phase pattern.
• Algorithmic Steps (Alternating Updates):
  1. Weight Update: Multiplicative update rule to equalize amplitudes based on the ratio of target to current intensity.
  2. Scale Update: Optimal global complex scaling ($s$) is calculated via projection onto the target field.
  3. Phase Update (The "Projective" Step): The SLM phase is updated by back-propagating the weighted target field and extracting the phase. Crucially, the target phase ($\phi_{tar}$) is set to ensure the new hologram's phase is close to the previous frame's phase, enforcing the continuity constraint.
• Path-Agnostic: The method operates on a frame-by-frame basis, independent of the specific geometric trajectory, making it applicable to any transport sequence generated by upstream planners (e.g., Hungarian algorithm).

3. Key Contributions

1. Identification of Phase Continuity as a Design Principle: The paper establishes that inter-frame phase continuity is as critical as intensity uniformity for dynamic holographic control. It provides a diagnostic tool (phase-difference distribution) to assess transient robustness.
2. Development of WPGS: A novel algorithm that integrates phase constraints into the hologram generation loop, solving the "refresh-induced flicker" problem without requiring pre-trained AI models or complex interpolation rules.
3. Theoretical Modeling of Transients: The authors derive a leading-order approximation of the transient field during SLM refresh, mathematically proving that intensity dips are governed by the cosine of the inter-frame phase difference.
4. Efficiency Gains: By enforcing phase constraints, the algorithm converges faster (fewer iterations) than unconstrained methods, accelerating hologram generation.

4. Results

The authors validated WPGS through numerical simulations on an NVIDIA A800 GPU, comparing it against standard WGS.

• Minimal 3x3 Transport:
  • WGS: Produced large phase excursions ($\sigma \approx 0.17$), leading to significant transient intensity dips.
  • WPGS: Kept phase excursions tightly concentrated near zero ($\sigma \approx 0.03$), suppressing intensity dips.
• Large-Scale 2D Reconfiguration (1024 traps):
  • WPGS maintained trap intensities above 86% of the initial value throughout the entire sequence, including transient samples.
  • WGS showed a "low-intensity tail," with 2.83% of samples dropping below the 86% threshold.
• 3D Multilayer Reconfiguration (3072 traps):
  • Tested on three layers with non-uniform initial conditions (different fillings and lattice constants).
  • WPGS maintained high uniformity and phase continuity across all layers, with all traps staying above 91% intensity.
• Offset-Bilayer Inter-layer Transport:
  • Demonstrated capability to handle non-uniform target intensities and complex 3D motion (inter-layer exchange + in-plane redistribution).
  • All traps remained above 96% intensity.
• Performance Benchmarks:
  • Speed: WPGS reduced the mean update time by 4x to 5x compared to WGS (e.g., 1.9 ms vs. 7.9 ms for 2D tasks).
  • Convergence: WPGS required only 5 iterations per update to converge, whereas WGS required 26 iterations.

5. Significance and Impact

• Scalability: WPGS enables the reliable reconfiguration of atom arrays exceeding $10^3$ particles, a prerequisite for fault-tolerant quantum computing and large-scale quantum simulation.
• Robustness: By eliminating transient trap loss, the method allows for continuous operation of atom arrays, essential for long-duration quantum algorithms and error correction cycles.
• General Applicability: The approach is hardware-agnostic (works with any phase-only SLM) and does not require machine learning training, offering a physically interpretable and computationally efficient solution.
• Future Applications: The framework supports advanced architectures such as:
  • Quantum Error Correction: Moving ancilla qubits between storage and interaction layers.
  • Programmable Defects: Creating controlled inhomogeneities for studying many-body physics.
  • End-to-End Compilation: Facilitating the translation of quantum algorithms into physical atom movements.

In summary, this work solves a critical bottleneck in neutral-atom quantum computing by transforming holographic reconfiguration from a static intensity optimization problem into a dynamic, phase-stable control problem, ensuring the integrity of large-scale quantum systems during operation.