Quantum Leap: New "Geometric" Gate Paves the Way for Error-Resistant Quantum Computing

Researchers at ETH Zurich have developed a revolutionary quantum swap gate that is significantly less sensitive to errors, marking a major step forward in the quest for practical quantum computers.

The Breakthrough

The new gate achieved a stunning 99.91% precision in under one millisecond, tested across 17,000 qubit pairs. The study, published in Nature on April 8, details a method that abandons conventional approaches in favor of a more robust geometric technique.

"Laser light... enables us to hold atoms in place."
— Yann Hendrick Kiefer, postdoctoral researcher and first author

How It Works

The team uses neutral potassium atoms cooled to near absolute zero. These atoms are held in place by an optical lattice—a grid created by intersecting laser beams.

The key innovation lies in the gate's operation. Traditional swap gates rely on precise timing and laser strength, making them highly vulnerable to experimental noise. The ETH Zurich approach instead depends on the path the atoms take, a geometric phase that is inherently more stable.

"Quantum computing on a practical scale still requires significant advancements. The most limiting factors are twofold: scale and fidelity."

— Yann Hendrick Kiefer

Quantum mechanics describes atomic particles using wave functions. Manipulating these states introduces a "phase"—either dynamical or geometric. The geometric phase used here is what provides the error protection.

Why This Matters

Quantum computers use qubits that can exist in superposition states, and swap gates are essential for routing information between them.

• Previous error rates for qubits were about 1 in 1,000
• Classical bits have error rates of 1 in 1 trillion
• This disparity has been a primary obstacle to scaling quantum systems

The team also demonstrated half-swap gates, which are critical components for running complex quantum algorithms.

The Road Ahead

While this achievement is significant, practical quantum computing remains a long-term goal. However, Kiefer points to a recent study suggesting that Shor's algorithm—a famous quantum algorithm capable of breaking current encryption—could be solved with just 10,000 qubits, fewer than previously estimated.

"There is a lot of work to be done before actually solving Shor's algorithm, but we are entering the phase in which the dream of quantum computing might actually be slowly converted into reality."

Current neutral-atom platforms already promise thousands of qubits per device, bringing the necessary scale within reach.

Source: Kiefer, Y., Zhu, Z., Fischer, L., et al. (2026). Protected quantum gates using qubit doublons in dynamical optical lattices. Nature, 652(8110), 609–614.