Researchers in Sweden have developed a new way to perform complex quantum operations in a single control cycle rather than thousands, potentially removing one of the biggest obstacles to reliable, large-scale quantum computers.

A team of researchers at Chalmers University of Technology in Sweden has unveiled a quantum-computing technique capable of performing certain advanced operations more than 1,000 times faster than conventional approaches, a development that could help solve one of the field’s most persistent problems: keeping fragile quantum information intact long enough to perform useful calculations.

The breakthrough centres on a new control method for so-called bosonic quantum codes, an increasingly important approach to quantum error correction. Instead of storing information only in individual quantum bits, or qubits, bosonic codes can encode quantum information in electromagnetic fields inside superconducting circuits.

That distinction is important because quantum computers are extraordinarily vulnerable to interference.

Tiny environmental disturbances—including electrical noise, heat and even radiation—can alter quantum states and introduce errors. The longer a quantum operation takes, the more opportunities there are for those errors to accumulate.

Researchers have therefore been searching not only for better ways to correct quantum errors, but also for ways to complete operations before too many errors arise.

The new method attacks the problem from the speed side.

According to the Chalmers team, operations that previously required thousands of repeated control cycles can now, in principle, be completed in just one.

That could dramatically reduce the time during which quantum information remains exposed to disruptive environmental effects.

A different way to protect quantum information

Modern quantum processors rely on qubits whose unusual properties allow them to represent combinations of states simultaneously.

That ability is what gives quantum computers their theoretical advantage for certain calculations.

But it also creates their greatest weakness.

Qubits are notoriously delicate. Interactions with their surroundings can cause them to lose their quantum properties through a process known as decoherence.

Traditional quantum-computing architectures therefore require elaborate error-correction systems, often involving large numbers of physical qubits to create a smaller number of reliable logical qubits.

Bosonic codes offer another approach.

Rather than spreading information exclusively across arrays of individual qubits, researchers encode quantum information in the quantum states of microwave or optical resonators.

These systems can provide built-in protection against some categories of error and potentially reduce the amount of physical hardware required for fault tolerance.

But controlling those encoded states efficiently has remained difficult.

Creating the precise quantum states needed for computation has often required many successive control pulses or periodic driving cycles.

Each additional step increases the duration of the operation—and therefore the likelihood that something will go wrong.

From thousands of cycles to one

The Swedish researchers developed a method based on what they call quantum lattice gates.

These gates act as elementary building blocks for manipulating bosonic quantum states.

The researchers combine them with a technique known as Floquet control, in which a quantum system is manipulated using periodically repeating signals.

Earlier Floquet-based methods often required a quantum system to pass through large numbers of repeated driving cycles before reaching the desired state.

The new approach effectively compresses that process.

Instead of gradually building the desired operation over thousands of cycles, quantum lattice gates can perform a broad class of operations within a single driving cycle.

Lead researcher Lei Du compared the difference to constructing something from prefabricated modules instead of assembling it piece by piece.

The result is not merely a faster calculation.

Speed can translate directly into reliability.

If the system spends less time completing an operation, there is less time for noise or environmental disturbance to corrupt the quantum state.

That connection between speed and error reduction is what makes the research particularly important.

Why fault tolerance matters

Quantum computers already exist, but today’s machines remain relatively limited.

They can perform sophisticated experiments and specialised calculations, yet they are still prone to errors and cannot reliably execute many of the large algorithms that researchers ultimately hope to run.

A truly transformative quantum computer would need to be fault tolerant.

That means it would have to continue performing reliable calculations even when individual components occasionally fail or experience noise.

Fault tolerance requires both strong error-correction systems and extremely precise control over quantum states.

The new Chalmers technique addresses the second part of that equation.

If quantum operations can be performed dramatically faster while preserving control accuracy, fewer errors may accumulate between correction cycles.

That could lower the engineering burden required to maintain stable logical qubits.

The development therefore tackles one of the less visible but fundamental bottlenecks in the quantum-computing race.

Building more qubits alone is not enough.

Researchers must also learn how to control them quickly, accurately and repeatedly.

Compatible with existing superconducting technology

Another important aspect of the work is that the method does not necessarily require an entirely new type of quantum computer.

The researchers say the technique is particularly suitable for superconducting quantum circuits, one of the leading hardware platforms currently being developed by companies and research laboratories worldwide.

Superconducting systems are also the technology used at Chalmers, where researchers are developing a 100-qubit quantum computer.

The team says discussions about experimental demonstrations of the technique are already under way.

That matters because many theoretical quantum advances face an enormous obstacle between mathematics and engineering.

A technique might work elegantly on paper but require unrealistic materials, temperatures or control systems before it can be demonstrated experimentally.

The Chalmers researchers argue that their approach could potentially be implemented using existing superconducting circuit architectures.

The next major test will therefore be experimental.

The current study establishes the theoretical framework. Scientists will now need to show that comparable speed improvements can be achieved in physical quantum hardware while maintaining sufficient accuracy.

The global quantum race accelerates

The discovery arrives as investment in quantum computing continues to accelerate globally.

Governments and technology companies increasingly see quantum technology as strategically important for science, cybersecurity, pharmaceuticals, materials development and national security.

Researchers hope that mature quantum computers could eventually tackle calculations that would overwhelm even the world’s most powerful conventional supercomputers.

Potential applications include simulating complex molecules for drug development, designing new materials, optimising logistics networks and modelling chemical reactions.

Quantum systems may also eventually threaten some forms of modern encryption, prompting governments to develop post-quantum cryptography before large-scale machines become available.

The scale of investment reflects those possibilities.

But the industry remains constrained by a fundamental engineering reality: today’s quantum systems still make too many mistakes.

Increasing the number of qubits without improving reliability can simply create larger machines that produce unreliable answers.

That is why advances in error correction and quantum control can be as significant as announcements of processors containing larger numbers of qubits.

Faster is not automatically better

The 1,000-fold figure should nevertheless be interpreted carefully.

The research does not mean quantum computers as a whole suddenly operate 1,000 times faster.

Rather, certain operations involving bosonic quantum states can theoretically be executed in a single driving period instead of the thousands of cycles required using previous techniques.

The improvement therefore applies to a particular control problem rather than every quantum algorithm.

The researchers also have not yet demonstrated a universal fault-tolerant quantum computer using the method.

Experimental verification remains necessary.

Even if successful, many other challenges must still be solved, including qubit fabrication, calibration, error detection, cryogenic engineering and scaling quantum processors from laboratory devices into machines containing potentially thousands or millions of reliable logical components.

Still, removing individual bottlenecks is how the field advances.

Quantum computing has rarely progressed through a single revolutionary invention. Instead, researchers are gradually solving a series of extremely difficult engineering and physics problems.

The Chalmers work may provide one more piece of that puzzle.

From laboratory experiment to useful machines

The longer-term implication could be substantial.

If quantum states can be generated and manipulated much faster, future machines may need fewer correction cycles and could execute more complicated algorithms before errors overwhelm the calculation.

That could help shift quantum computers from experimental platforms toward practical scientific instruments.

Drug discovery is frequently cited as one of the most promising applications.

Understanding how complex molecules interact requires enormous computational power because the underlying systems follow quantum-mechanical rules.

Conventional computers must approximate many of those interactions.

A sufficiently reliable quantum computer could potentially simulate them more naturally.

Similar benefits could emerge in materials science, energy technology, artificial intelligence and optimisation.

But those applications depend on hardware capable of maintaining quantum information accurately for long periods.

That is why a technique concerned with something as technical as control cycles could eventually have consequences far beyond the laboratory.

The race is increasingly about reliability

For years, quantum-computing announcements were dominated by qubit counts.

Companies competed to build processors containing hundreds and eventually thousands of quantum bits.

The focus is now shifting.

Researchers increasingly recognise that the quality of qubits—and the ability to correct errors and manipulate quantum states reliably—may matter more than the raw number of components.

A processor containing fewer reliable logical qubits can potentially outperform a much larger machine composed of unstable physical ones.

The new research fits directly into that transition.

Its significance is not that it makes today’s quantum computers immediately capable of replacing conventional machines.

Instead, it offers a potentially faster route for performing the delicate operations required to keep future quantum processors stable.

The study, titled “Single-Period Floquet Control of Bosonic Codes with Quantum Lattice Gates,” has been published in Physical Review Letters. The work was conducted by researchers affiliated with Chalmers University of Technology and Tianjin University.

Quantum computing remains far from the moment when it will routinely outperform classical machines across commercially useful tasks.

Yet its biggest barriers are steadily becoming more clearly defined—and, one by one, researchers are beginning to find ways around them.

Turning thousands of delicate quantum-control cycles into one may prove to be one of those important steps.