← Latest papers
⚛️ quantum physics

Fer expansion converges almost twice as far as Magnus for qubits

This paper establishes that for qubits, the Fer expansion guarantees convergence up to a threshold of approximately 1.98π1.98\pi, nearly doubling the optimal universal convergence radius of the Magnus expansion (π\pi).

Original author: Lorenzo Bagnasacco, Vittorio Giovannetti

Published 2026-11-16
📖 5 min read🧠 Deep dive

Original author: Lorenzo Bagnasacco, Vittorio Giovannetti

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the author. For technical accuracy, refer to the original paper. Read full disclaimer

In the quantum world, where particles like electrons and atoms follow rules that seem to defy common sense, scientists often need to predict how a system changes over time. Imagine trying to track the path of a spinning top that is being pushed by a wind that changes direction and strength every fraction of a second. In quantum physics, this wind is a force called a Hamiltonian, and the spinning top is a tiny piece of matter, such as a qubit, which is the basic unit of information in a quantum computer. To understand how this system evolves, physicists use a mathematical tool called a series expansion. This tool breaks a complex, continuous change into a sequence of simpler steps, allowing researchers to calculate the outcome. However, these calculations are only useful if they actually work. If the sequence of steps grows too large or chaotic, the calculation fails to give a correct answer. For decades, scientists have relied on two main methods to organize these steps: one that groups them into a single, massive calculation, and another that keeps them as a chain of individual steps. The question of how far these methods can be pushed before they break has been a central puzzle in the field.

A team of researchers in Pisa, Italy, has now solved a specific version of this puzzle for the simplest type of quantum system, the qubit. They focused on a method known as the Fer expansion, which is a way of rewriting the evolution of a quantum system as a chain of separate, manageable steps. While a competing method, called the Magnus expansion, was known to work reliably up to a certain limit, the Fer expansion was thought to fail much sooner. Previous studies suggested that the Fer expansion would stop working once the total accumulated strength of the force acting on the system reached a value of about 2.6. This limit was smaller than the limit for the Magnus expansion, which was known to hold up to a value of roughly 3.14. This made the Fer expansion seem less useful for many practical applications, despite its potential to converge much faster once it started working. The researchers set out to see if this limit was truly a hard wall or if it was simply a result of using a blunt instrument to measure a delicate shape.

By looking closely at the geometry of how a qubit moves, the team discovered that the old limit was far too conservative. They realized that the previous calculations treated the system's behavior as if every possible direction of movement were equally likely to cause a failure. In reality, for a qubit, the way the system moves and the way it accumulates change are deeply connected. The researchers found that the part of the motion that would normally cause the calculation to grow out of control is actually the very part that gets canceled out by the next step in the chain. It is like trying to push a heavy box across a floor while someone else is simultaneously pulling it back; if you only look at the pushing, you think the box will fly away, but if you see the whole picture, the forces balance in a way that keeps the box stable. By accounting for this precise cancellation, the team calculated a new, much higher limit for when the Fer expansion is guaranteed to work.

The new limit they found is approximately 6.21. This number is nearly double the previous estimate and is almost twice as large as the best-known limit for the Magnus expansion. To put this in perspective, if the Magnus expansion is like a bridge that is safe to cross up to a certain weight, the Fer expansion, under these new findings, is a bridge that can safely carry almost twice that weight before it is guaranteed to hold. The researchers did not just guess this number; they proved it by mapping out the exact worst-case scenario for a single step of the calculation. They treated the path of the quantum system as a curve in space and used advanced mathematical techniques to find the specific shape of that curve that would push the system to its absolute limit. They showed that for any qubit, as long as the total accumulated strength of the force stays below this new threshold of 6.21, the chain of steps will eventually settle down and give a correct answer.

This discovery is significant because it changes how scientists might choose to simulate quantum systems. The Fer expansion is known to converge very quickly, meaning it reaches a precise answer with fewer steps than other methods, but only if the system stays within its safe zone. By expanding that safe zone to be almost twice as wide as previously thought, the researchers have made this powerful tool available for a much wider range of problems. They demonstrated that for a qubit, the method is robust enough to handle forces that were previously thought to be too strong. While they have not proven that this new number is the absolute maximum possible limit for all time, they have shown that it is the best possible guarantee one can make using the standard method of checking each step individually. The work suggests that the geometry of the quantum world is more forgiving than we once believed, allowing for more accurate and efficient simulations of the tiny machines that will power the future of computing.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →