← Latest papers
🔬 mesoscale physics

Projective Measurements: Topological Quantum Computing with an Arbitrary Number of Qubits

This paper demonstrates that incorporating projective measurements to enable transitions between qubit encodings overcomes the limitations of pure braiding in topological quantum computing, thereby restoring computational universality and achieving high-fidelity, fault-tolerant operations on systems with up to ten qubits.

Original authors: Themba Hodge, Philipp Frey, Stephan Rachel

Published 2026-08-31
📖 8 min read🧠 Deep dive

Original authors: Themba Hodge, Philipp Frey, Stephan Rachel

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 authors. For technical accuracy, refer to the original paper. Read full disclaimer

Quantum computers promise to solve problems that are impossible for today's machines, but they are notoriously fragile. The slightest whisper of heat or vibration can scramble the delicate information they hold, causing calculations to fail. To build a machine that can actually work, scientists are exploring a different approach called topological quantum computing. Instead of storing information in the charge of a single electron or the spin of an atom, this method hides data in the very shape of the system, using exotic particles known as Majorana zero modes. These particles exist at the ends of tiny superconducting wires and have a unique property: their information is protected by the laws of physics, making it immune to local noise. To perform calculations, researchers do not push these particles with electric fields; instead, they move them around each other in space, a process called braiding. Just as twisting a rope changes its structure without cutting it, braiding these particles changes the quantum state in a way that is robust against errors.

However, a significant hurdle has emerged as scientists try to scale this idea up. While moving two particles around each other works well for simple tasks, researchers found that simply braiding more particles together is not enough to perform the full range of calculations needed for a universal computer. The standard method of moving these particles fails to create the complex connections required between many qubits, the basic units of quantum information. This limitation meant that even with perfect braiding, the computer could not be truly universal. To overcome this, a new strategy is required—one that goes beyond just moving particles and involves a different kind of interaction to bridge the gap between simple operations and complex computing.

In a recent study, researchers at the University of Melbourne have demonstrated a way to bypass this limitation by combining the movement of particles with a specific type of measurement. They showed that by occasionally "checking" the state of the system through a projective measurement, they can switch between different ways of encoding information. This switching allows the system to perform the full set of logical operations needed for a universal computer. The team did not build a physical machine for this experiment; instead, they created a highly detailed computer simulation of the physics involved. They modeled a system of superconducting wires where these exotic particles live and simulated the process of moving them, measuring them, and moving them again. Their work proves that this hybrid approach is mathematically sound and capable of handling large numbers of qubits, offering a clear path forward for building fault-tolerant quantum computers.

The core of the problem lies in how information is stored. In the simplest setup, known as sparse encoding, each logical qubit is given its own dedicated pair of extra particles to help keep the math consistent. This makes it easy to perform single-qubit operations, but it makes it very difficult to link different qubits together to create entanglement, which is essential for complex calculations. Conversely, a denser arrangement, called dense encoding, groups the particles more tightly, allowing qubits to interact easily. However, this dense arrangement makes it hard to perform the basic single-qubit operations on all parts of the system. For years, it was unclear how to get the best of both worlds without losing the protection that makes topological computing so attractive. The researchers realized that they did not need to choose one or the other. Instead, they could start in the sparse arrangement to do the easy single-qubit work, switch to the dense arrangement to perform the difficult two-qubit interactions, and then switch back.

To make this switch possible, the team utilized a technique involving projective measurements. In the context of their simulation, this means forcing the system to reveal a specific property—whether the total number of particles in a certain region is even or odd—without destroying the quantum information stored in the rest of the system. This act of measurement acts as a bridge, collapsing the system from the sparse state into the dense state, or vice versa, while preserving the data. The researchers simulated this entire process, showing that they could take a system of two qubits, prepare a specific entangled state known as a Bell state, and then expand this to create a much larger entangled state involving five qubits, known as a GHZ state. These are not just theoretical possibilities; the simulation showed that the system could successfully transition between these states with high accuracy.

The team then pushed the simulation further to test the robustness of their method. They ran a random sequence of operations, essentially a complex circuit of gates, on a five-qubit system. In the real world, these systems are never perfect; they are subject to static disorder, which can be thought of as tiny, random imperfections in the material that shift the energy levels of the particles. The researchers introduced these imperfections into their simulation to see how the system would hold up. They found that even with moderate levels of disorder, the system maintained a fidelity, or accuracy, of over 99 percent. This high level of accuracy was preserved as long as the braiding operations were performed slowly enough to allow the system to adjust adiabatically, meaning the particles moved gently enough to stay in their protected state. The results showed that the topological protection is real and effective, keeping the information safe even when the environment is not perfect.

To demonstrate that this approach could scale to the size needed for a useful computer, the researchers simulated a random circuit on a system of ten qubits. This is a significant leap in complexity, involving forty of these exotic particles and a total of seventy-seven different operations. The simulation included eighteen of the crucial switching measurements required to link the qubits together. The results were encouraging: despite the increased complexity and the presence of errors that caused a slight loss of probability, the system retained the essential statistical properties of the particles. The final state of the simulation matched the intended target with a fidelity of 97.4 percent, a remarkable result for a system of this size. This suggests that the method is not just a theoretical curiosity but a viable pathway for scaling up topological quantum computing.

The study also addressed the computational cost of simulating such systems. Usually, simulating quantum systems becomes exponentially harder as you add more qubits, quickly overwhelming even the most powerful supercomputers. The researchers found that by calculating the results of each measurement step sequentially, rather than trying to store the entire quantum state at once, they could manage the memory requirements. While the time required to run the simulation still grows with the number of operations, the method avoids the need to store the full state of the system, making it possible to simulate larger circuits than would otherwise be feasible. This efficiency is crucial for testing future designs before they are built in a laboratory.

The implications of this work extend beyond the specific numbers and qubits. The researchers emphasized that their method is not tied to a single type of material or device. While they used a specific model of a superconducting wire for their calculations, the logic of switching between encodings via measurement applies to any platform that can host these exotic particles. This includes potential future systems based on superconductor-semiconductor hybrids or magnetic structures. By proving that the method works in simulation, the team has provided a blueprint for experimentalists. They have shown that the barrier to universal topological computing is not a fundamental law of physics, but a solvable engineering challenge. The path forward involves building systems that can perform these braiding operations and measurements with the precision required to maintain the high fidelities seen in the simulation.

Ultimately, this research offers a concrete solution to a problem that has long stalled the progress of topological quantum computing. It moves the field from a state of "we can do simple things, but not enough" to "we can do everything we need, if we build it right." The combination of braiding and measurement provides a universal toolkit, turning a collection of protected particles into a fully functional computer. As the technology matures, the ability to simulate these large-scale circuits will be vital for identifying the specific conditions needed to build a machine that can outperform all others. The work stands as a testament to the power of combining theoretical insight with rigorous simulation to map out the future of quantum technology.

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 →