← Latest papers
⚛️ quantum physics

Double-Bracket Quantum Algorithms for Preparing Multiple Excited States

This paper introduces the DB-MEX algorithm, a parameter-free, recursively compiled double-bracket quantum method that simultaneously evolves multiple orthonormal states to target specific low-lying excited states of a Hamiltonian by controlling a weighted sum of projectors.

Original author: Salahuddin Abdul Rahman, Özkan Karabacak, Rafal Wisniewski

Published 2026-11-18
📖 6 min read🧠 Deep dive

Original author: Salahuddin Abdul Rahman, Özkan Karabacak, Rafal Wisniewski

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 microscopic world of atoms and molecules, energy does not come in a smooth, continuous stream. Instead, it arrives in distinct, fixed packets, much like the rungs on a ladder. A system, such as a molecule, can sit on the bottom rung, which represents its most stable, calm state. But it can also climb to higher rungs, known as excited states. Understanding these higher states is crucial for scientists who want to design new drugs, create better solar cells, or understand how materials behave under extreme conditions. However, finding these higher rungs is notoriously difficult. While the bottom rung is often the easiest to locate, the higher ones are elusive, and calculating them requires immense computational power that often overwhelms even the most advanced supercomputers.

This challenge has driven researchers to look toward quantum computers, machines that use the strange laws of quantum mechanics to solve problems that are impossible for classical devices. For years, scientists have developed various methods to find the ground state, the lowest energy level, but preparing the excited states has remained a stubborn hurdle. Many existing approaches require a lot of guesswork, heavy mathematical tuning, or complex measurements that can introduce errors. They often treat each excited state as a separate problem, requiring a new calculation for every single rung of the ladder, which is slow and inefficient.

A team of researchers has now introduced a new method that changes how these excited states are found. They have developed an algorithm called DB-MEX, which stands for Double-Bracket quantum algorithm for Multiple EXcited states. Instead of hunting for each excited state one by one, this new approach prepares several of them at the same time using a single, unified process. The researchers proved that their method can guide a group of quantum states toward the lowest energy levels of a system simultaneously, keeping them distinct and separate throughout the journey. The key to their success lies in a mathematical flow that naturally sorts these states, ensuring they end up in the correct positions without the need for the heavy tuning or error-prone measurements that plague other techniques.

The core idea behind this work is to treat the search for excited states as a sorting problem. Imagine a collection of marbles rolling down a hill; the goal is to have them settle into specific, ordered valleys. In the quantum world, the researchers start with a set of states that are perfectly distinct from one another, like a set of parallel tracks. They then apply a specific set of rules, derived from a mathematical concept known as a double-bracket flow, which acts like a gentle, guiding force. This force pushes the states toward the lowest energy levels available. What makes this approach unique is that it does not require the states to be adjusted individually. Instead, the entire group evolves together under the same set of instructions, yet they naturally separate out to find their own specific energy levels.

The researchers showed that by adjusting the "weights" assigned to each state in their calculation, they could control exactly which energy levels the algorithm targets. If they wanted to find the ten lowest energy states, they could set the parameters to guide the system there. If they were only interested in a specific, higher energy state, they could tune the weights to isolate just that one. This flexibility is a significant improvement over previous methods, which often struggle to target specific states without knowing the exact energy values in advance. The algorithm does not need to know the answers beforehand; it simply follows the mathematical flow until the states settle into their correct positions.

One of the most important findings is that the states remain perfectly distinct from one another throughout the entire process. In many other quantum algorithms, states can accidentally mix together, losing their individual identities and requiring complex cleanup steps to separate them later. In this new method, the states are designed to stay separate by construction. This means that once the calculation is finished, the researchers have a clean set of results, each representing a specific excited state, without needing to perform extra, error-prone measurements to untangle them. The team also demonstrated that this process works reliably for almost any starting point, meaning it is robust and not easily thrown off by small imperfections in the initial setup.

The researchers compiled this mathematical flow into a quantum circuit, which is the set of instructions a quantum computer follows to perform the calculation. This circuit is built recursively, meaning it repeats a specific pattern of operations to refine the states step by step. While the circuit grows in complexity with each step, the researchers noted that for practical applications, only a few steps are usually needed to get a very good approximation. This makes the method particularly useful for refining a rough guess into a precise answer, or for providing a high-quality starting point for other algorithms. The team also provided a clear way to handle cases where the algorithm produces a group of states that are mixed together, showing how to use simple classical calculations to separate them into the individual energy levels scientists need.

This work represents a shift in how quantum algorithms are designed for complex problems. By combining a powerful mathematical flow with a clever way of managing multiple states at once, the researchers have created a tool that is both efficient and reliable. They proved that their method converges to the correct answer with a speed that depends on the gaps between the energy levels, a property that ensures it works well for a wide range of physical systems. The results suggest that this approach could become a standard tool for simulating molecules and materials, helping scientists explore the excited states that are vital for understanding chemical reactions and designing new technologies. The paper concludes that while the method requires a quantum computer to run, the logic behind it is sound and proven, offering a clear path forward for tackling some of the most difficult problems in quantum chemistry and physics.

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 →