At Chalmers University of Technology, researchers have found a way to compress thousands of fragile quantum operations into a single pulse, completing in microseconds what once demanded thousands of repeated cycles. The breakthrough addresses one of quantum computing's most persistent paradoxes: that the very methods used to protect quantum information were slow enough to let noise destroy it. By weaving together nonlinear superconducting physics and advanced mathematical transforms, the team has opened a more direct path from laboratory promise to practical quantum machines.
Chalmers Team Achieves 1,000x Speedup in Bosonic Quantum Operations
Collapsing thousands of cycles into a single pulse
Mark
So they made quantum operations faster. But why does speed matter so much in quantum computing? Isn't it just about getting the right answer?
Mimi
Speed matters because quantum states are fragile. The longer you manipulate them, the more environmental noise corrupts your information. These researchers compressed thousands of cycles into one, so the quantum data spends far less time exposed to that noise.
Luke
But I want to be precise here. The paper shows infidelities below 10-3 for state preparation. That's good, but is that actually better than what adiabatic methods achieve, or just faster at the same error level?
Mimi
The source says they achieved this with microsecond execution windows. The speed itself is the breakthrough—same fidelity, vastly shorter exposure time.
Mark
And this works for the specific types of quantum codes they tested?
Mimi
They demonstrated it on Binomial, Cat, and GKP codewords, which are the main bosonic codes in use. They also showed universal logical gates—Hadamard, Phase, π/8.
Luke
Universal gates are important because you need them to run arbitrary quantum algorithms. But the source doesn't say whether this method works for all possible quantum operations, or just the ones they tested.
Mimi
Fair point. What we know is it scales linearly with Hilbert-space dimension, so there's a path to more complex operations. But you're right—the paper is focused on these specific gates and state preparations.
Mark
How close is this to actually being used in a real quantum computer?
Mimi
The Wallenberg Centre is building a 100-qubit processor right now, and the Chalmers team says their method provides a hardware-compatible blueprint for controlling it. So it's not theoretical—it's designed to work with actual superconducting hardware.
Luke
That's important context. But "blueprint" doesn't mean it's already integrated. There's still work between this paper and a functioning 100-qubit machine.
Mimi
Absolutely. But the path is clear, and the speedup removes a real bottleneck that was slowing down the field.
The Pulse
- Bosonic quantum codes offered natural noise resistance, but their slow control methods were quietly canceling out that very advantage — a paradox at the heart of the field.
- The longer quantum states are exposed to environmental noise during manipulation, the more likely they are to collapse, making speed not just a performance metric but a survival condition.
- Chalmers researchers developed Quantum Lattice Gates — combining Josephson junction nonlinearity with Noncommutative Fourier Transformations — to synthesize quantum operations in a single driving period instead of thousands of incremental steps.
- Gate errors fell below one part in a thousand across multiple bosonic code types, with execution times in the microsecond range, matching the best existing methods at 1,000 times the speed.
- The technique scales linearly with system complexity, positioning it as a practical blueprint for the 100-qubit superconducting processor now under construction at Sweden's Wallenberg Centre for Quantum Technology.
At Chalmers University of Technology, researchers have found a way to compress thousands of fragile quantum operations into a single pulse, completing in microseconds what once demanded thousands of repeated cycles. The breakthrough addresses one of quantum computing's most persistent paradoxes: that the very methods used to protect quantum information were slow enough to let noise destroy it. By weaving together nonlinear superconducting physics and advanced mathematical transforms, the team has opened a more direct path from laboratory promise to practical quantum machines.
A research team at Chalmers University of Technology has cracked a problem that has quietly undermined one of quantum computing's most promising approaches. Bosonic quantum codes — which store information in the microwave fields of superconducting resonators rather than in individual qubits — offer built-in resistance to decoherence, the environmental noise that corrupts quantum data. But controlling these states has traditionally required slow, gradual processes that left quantum information exposed to noise for dangerously long periods, eroding the very protection the approach was designed to provide.
The Chalmers team resolved this contradiction by developing Quantum Lattice Gates, a method that combines the nonlinear properties of Josephson junctions with a mathematical framework called Noncommutative Fourier Transformations. Together, these tools allow arbitrary quantum operations to be synthesized directly from the vacuum state in a single Floquet driving period — collapsing what once required thousands of cycles into one pulse. Optimal Pulse Engineering further refines the control signals for maximum fidelity.
The results, published in Physical Review Letters, are difficult to overstate in practical terms. Across three types of bosonic codewords — Binomial, Cat, and GKP states — the team achieved infidelities below one part in a thousand. Universal single-qubit logical gates ran with average errors around 10-3, all within microsecond timescales. The method also scales linearly with the size of the quantum state space, meaning it remains viable as systems grow more complex.
That scalability carries immediate consequence: the Wallenberg Centre for Quantum Technology is currently building a 100-qubit superconducting processor, and the Chalmers technique offers a hardware-compatible roadmap for controlling it efficiently. By shrinking the window during which noise can corrupt quantum states, the work moves quantum computing measurably closer to machines capable of solving problems that remain beyond classical reach.
A team at Chalmers University of Technology has solved a stubborn problem that has slowed the development of practical quantum computers: how to manipulate quantum information stored in microwave fields without destroying it in the process. Their solution, published this month in Physical Review Letters, performs the same quantum operations 1,000 times faster than the standard method, collapsing what once took thousands of repeated cycles into a single pulse.
The challenge lies in how bosonic quantum codes work. Rather than encoding information in individual physical qubits, these codes store quantum data within the continuous-variable microwave fields of superconducting resonators. This approach offers a natural advantage—the quantum states are inherently more resistant to decoherence, the environmental noise that typically corrupts quantum information. But there is a catch. Controlling these continuous-variable states has traditionally required slow, gradual ramps that expose the fragile quantum data to noise for extended periods, undermining the very protection the bosonic approach was meant to provide.
The Chalmers researchers bypassed this bottleneck by developing Quantum Lattice Gates, a method that harnesses the non-linear properties of Josephson junctions—the superconducting components that form the backbone of modern quantum processors—combined with a mathematical technique called Noncommutative Fourier Transformations. This combination allows them to synthesize arbitrary quantum operations directly from the vacuum state in a single Floquet driving period, eliminating the need for thousands of incremental steps. The approach is paired with Optimal Pulse Engineering, a refinement technique that shapes the control pulses for maximum fidelity.
The results are striking. When preparing quantum states from the vacuum—a foundational operation in quantum computing—the team achieved infidelities below one part in a thousand for three different types of bosonic codewords: Binomial, Cat, and GKP states. They also demonstrated universal single-qubit logical gates, including Hadamard, Phase, and π/8 gates, with average errors on the order of 10-3, all executed within microsecond timescales. These error rates are competitive with the best existing methods, but achieved in a fraction of the time.
The method scales linearly with the size of the quantum state space, meaning it remains practical as quantum systems grow more complex. This scalability matters because the Wallenberg Centre for Quantum Technology, a major Swedish research initiative, is currently building a 100-qubit superconducting quantum processor. The Chalmers technique provides a hardware-compatible blueprint for how to control such a system efficiently, addressing one of the central challenges in scaling quantum computers from laboratory demonstrations to machines capable of solving real problems. The speedup reduces the window during which environmental noise can corrupt quantum states, a direct path toward more reliable quantum computation.
Notable Quotes
The technique scales linearly with Hilbert-space dimension, providing a hardware-compatible blueprint for the 100-qubit superconducting quantum processor currently under construction at the Wallenberg Centre for Quantum Technology.— Chalmers University research team (via publication)
Want the full story?
Read the original at quantumcomputingreport.com ↗
Science & Space