Quantinuum researchers are unlocking a more efficient and powerful path towards fault tolerance
We've discovered a technique based on “genon braiding” for the construction of logical gates which could be applied to “high rate” error correcting codes
“Computers are useless without error correction”
- Anonymous
If you stumble while walking, you can regain your balance, recover, and keep walking. The ability to function when mistakes happen is essential for daily life, and it permeates everything we do. For example, a windshield can protect a driver even when it’s cracked, and most cars can still drive on a highway if one of the tires is punctured. In fact, most commercially operated planes can still fly with only one engine. All of these things are examples of what engineers call “fault-tolerance”, which just describes a system’s ability to tolerate faults while still functioning.
When building a computer, this is obviously essential. It is a truism that errors will occur (however rarely) in all computers, and a computer that can’t operate effectively and correctly in the presence of faults (or errors) is not very useful. In fact, it will often be wrong - because errors won’t be corrected.
In a new paper from Quantinuum’s world class quantum error correction team, we have made a hugely significant step towards one of the key issues faced in quantum error correction – that of executing fault-tolerant gates with efficient codes.
This work explores the use of “genon braiding” – a cutting-edge concept in the study of topological phases of matter, motivated by the mathematics of category theory, and both related to and inspired by our prior groundbreaking work on non-Abelian anyons.
The native fault tolerant properties of braided toric codes have been theoretically known for some time, and in this newly published work, our team shares how they have discovered a technique based on “genon braiding” for the construction of logical gates which could be applied to “high rate” error correcting codes – meaning codes that require fewer physical qubits per logical qubit, which can have a huge impact on scaling.
Stepping along the path to fault-tolerance
In classical computing, building in fault-tolerance is relatively easy. For starters, the hardware itself is incredibly robust and native error rates are very low. Critically, one can simply copy each bit, so errors are easy to detect and correct.
Quantum computing is, of course, much trickier with challenges that typically don’t exist in classical computing. First off, the hardware itself is incredibly delicate. Getting a quantum computer to work requires us to control the precise quantum states of single atoms. On top of that, there’s a law of physics called the no cloning theorem, which says that you can’t copy qubits. There are also other issues that arise from the properties that make quantum computing so powerful, such as measurement collapse, that must be considered.
Some very distinguished scientists and researchers have thought about quantum error correcting including Steane, Shor, Calderbank, and Kitaev [9601029.pdf (arxiv.org), 9512032.pdf (arxiv.org), arXiv:quant-ph/9707021v1 9 Jul 1997]. They realized that you can entangle groups of physical qubits, store the relevant quantum information in the entangled state (called a “logical qubit”), and, with a lot of very clever tricks, perform computations with error correction.
There are many different ways to entangle groups of physical qubits, but only some of them allow for useful error detection and correction. This special set of entangling protocols is called a “code” (note that this word is used in a different sense than most readers might think of when they hear “code” - this isn’t “Hello World”).
A huge amount of effort today goes into “code discovery” in companies, universities, and research labs, and a great deal of that research is quite bleeding-edge. However, discovering codes is only one piece of the puzzle: once a code is discovered, one must still figure out how to compute with it. With any specific way of entangling physical qubits into a logical qubit you need to figure out how to perform gates, how to infer faults, how to correct them, and so on. It’s not easy!
Quantinuum has one of the world’s leading teams working on error correction and has broken new ground many times in recent years, often with industrial or scientific research partners. Among many firsts, we were the first to demonstrate real-time error correction (meaning a fully-fault tolerant QEC protocol). This included many milestones: repeated real-time error correction, the ability to perform quantum "loops" (repeat-until-success protocols), and real-time decoding to determine the corrections during the computation. We were also the first to perform a logical two-qubit gate on a commercial system. In one of our most recent demonstrations, in partnership with Microsoft, we supported the use of error correcting techniques to achieve the first demonstration of highly reliable logical qubits, confirming our place at the forefront of this research – and indeed confirming that Quantinuum’s H2-1 quantum computer was the first – and at present only – device in the world capable of what Microsoft characterizes as Level 2 Resilient quantum computing.
Introducing new, exotic error correction codes
While codes like the Steane code are well-studied and effective, our team is motivated to investigate new codes with attractive qualities. For example, some codes are “high-rate”, meaning that you get more logical qubits per physical qubit (among other things), which can have a big impact on outlooks for scaling – you might ultimately need 10x fewer physical qubits to perform advanced algorithms like Shor’s.
Implementing high-rate codes is seductive, but as we mentioned earlier we don’t always know how to compute with them. A particular difficulty with high-rate codes is that you end up sharing physical qubits between logical qubits, so addressing individual logical qubits becomes tricky. There are other difficulties that come from sharing physical qubits between logical qubits, such as performing gates between different logical qubits (scientists call this an “inter-block” gate).
One well-studied method for computing with QEC codes is known as “braiding”. The reason it is called braiding is because you move particles, or “braid” them, around each other, which manipulates logical quantum information. In our new paper, we crack open computing with exotic codes by implementing “genon” braiding. With this, we realize a paradigm for constructing logical gates which we believe could be applied to high-rate codes (i.e. inter-block gates).
What exactly “genons” are, and how they are braided, is beautiful and complex mathematics - but the implementation is surprisingly simple. Inter-block logical gates can be realized through simple relabeling and physical operations. “Relabeling”, i.e. renaming qubit 1 to qubit 2, is very easy in Quantinuum’s QCCD architecture, meaning that this approach to gates will be less noisy, faster, and have less overhead. This is all due to our architectures’ native ability to move qubits around in space, which most other architectures can’t do.
Using this framework, our team delivered a number of proof-of-principle experiments on the H1-1 system, demonstrating all single qubit Clifford operations using genon braiding. They then performed two kinds of two-qubit logical gates equivalent to CNOTs, proving that genon braiding works in practice and is comparable to other well-researched codes such as the Steane code.
What does this all mean? This work is a great example of co-design – tailoring codes for our specific and unique hardware capabilities. This is part of a larger effort to find fault-tolerant architectures tailored to Quantinuum's hardware. Quantinuum scientist and pioneer of this work, Simon Burton, put it quite succinctly: “Braiding genons is very powerful. Applying these techniques might prove very useful for realizing high-rate codes, translating to a huge impact on how our computers will scale.”
About Quantinuum
Quantinuum, the world’s largest integrated quantum company, pioneers powerful quantum computers and advanced software solutions. Quantinuum’s technology drives breakthroughs in materials discovery, cybersecurity, and next-gen quantum AI. With over 500 employees, including 370+ scientists and engineers, Quantinuum leads the quantum computing revolution across continents.
Last year, we joined forces with RIKEN, Japan's largest comprehensive research institution, to install our hardware at RIKEN’s campus in Wako, Saitama. This deployment is part of RIKEN’s project to build a quantum-HPC hybrid platform consisting of high-performance computing systems, such as the supercomputer Fugaku and Quantinuum Systems.
Today, a paper published in Physical Review Research marks the first of many breakthroughs coming from this international supercomputing partnership. The team from RIKEN and Quantinuum joined up with researchers from Keio University to show that quantum information can be delocalized (scrambled) using a quantum circuit modeled after periodically driven systems.
"Scrambling" of quantum information happens in many quantum systems, from those found in complex materials to black holes. Understanding information scrambling will help researchers better understand things like thermalization and chaos, both of which have wide reaching implications.
To visualize scrambling, imagine a set of particles (say bits in a memory), where one particle holds specific information that you want to know. As time marches on, the quantum information will spread out across the other bits, making it harder and harder to recover the original information from local (few-bit) measurements.
While many classical techniques exist for studying complex scrambling dynamics, quantum computing has been known as a promising tool for these types of studies, due to its inherently quantum nature and ease with implementing quantum elements like entanglement. The joint team proved that to be true with their latest result, which shows that not only can scrambling states be generated on a quantum computer, but that they behave as expected and are ripe for further study.
Thanks to this new understanding, we now know that the preparation, verification, and application of a scrambling state, a key quantum information state, can be consistently realized using currently available quantum computers. Read the paper here, and read more about our partnership with RIKEN here.
In our increasingly connected, data-driven world, cybersecurity threats are more frequent and sophisticated than ever. To safeguard modern life, government and business leaders are turning to quantum randomness.
What is quantum randomness, and why should you care?
The term to know: quantum random number generators (QRNGs).
QRNGs exploit quantum mechanics to generate truly random numbers, providing the highest level of cryptographic security. This supports, among many things:
- Protection of personal data
- Secure financial transactions
- Safeguarding of sensitive communications
- Prevention of unauthorized access to medical records
Quantum technologies, including QRNGs, could protect up to $1 trillion in digital assets annually, according to a recent report by the World Economic Forum and Accenture.
Which industries will see the most value from quantum randomness?
The World Economic Forum report identifies five industry groups where QRNGs offer high business value and clear commercialization potential within the next few years. Those include:
- Financial services
- Information and communication technology
- Chemicals and advanced materials
- Energy and utilities
- Pharmaceuticals and healthcare
In line with these trends, recent research by The Quantum Insider projects the quantum security market will grow from approximately $0.7 billion today to $10 billion by 2030.
When will quantum randomness reach commercialization?
Quantum randomness is already being deployed commercially:
- Early adopters use our Quantum Origin in data centers and smart devices.
- Amid rising cybersecurity threats, demand is growing in regulated industries and critical infrastructure.
Recognizing the value of QRNGs, the financial services sector is accelerating its path to commercialization.
- Last year, HSBC conducted a pilot combining Quantum Origin and post-quantum cryptography to future-proof gold tokens against “store now, decrypt-later” (SNDL) threats.
- And, just last week, JPMorganChase made headlines by using our quantum computer for the first successful demonstration of certified randomness.
On the basis of the latter achievement, we aim to broaden our cybersecurity portfolio with the addition of a certified randomness product in 2025.
How is quantum randomness being regulated?
The National Institute of Standards and Technology (NIST) defines the cryptographic regulations used in the U.S. and other countries.
- NIST’s SP 800-90B framework assesses the quality of random number generators.
- The framework is part of the FIPS 140 standard, which governs cryptographic systems operations.
- Organizations must comply with FIPS 140 for their cryptographic products to be used in regulated environments.
This week, we announced Quantum Origin received NIST SP 800-90B Entropy Source validation, marking the first software QRNG approved for use in regulated industries.
What does NIST validation mean for our customers?
This means Quantum Origin is now available for high-security cryptographic systems and integrates seamlessly with NIST-approved solutions without requiring recertification.
- Unlike hardware QRNGs, Quantum Origin requires no network connectivity, making it ideal for air-gapped systems.
- For federal agencies, it complements our "U.S. Made" designation, easing deployment in critical infrastructure.
- It adds further value for customers building hardware security modules, firewalls, PKIs, and IoT devices.
The NIST validation, combined with our peer-reviewed papers, further establishes Quantum Origin as the leading QRNG on the market.
--
It is paramount for governments, commercial enterprises, and critical infrastructure to stay ahead of evolving cybersecurity threats to maintain societal and economic security.
Quantinuum delivers the highest quality quantum randomness, enabling our customers to confront the most advanced cybersecurity challenges present today.
The most common question in the public discourse around quantum computers has been, “When will they be useful?” We have an answer.
Very recently in Nature we announced a successful demonstration of a quantum computer generating certifiable randomness, a critical underpinning of our modern digital infrastructure. We explained how we will be taking a product to market this year, based on that advance – one that could only be achieved because we have the world’s most powerful quantum computer.
Today, we have made another huge leap in a different domain, providing fresh evidence that our quantum computers are the best in the world. In this case, we have shown that our quantum computers can be a useful tool for advancing scientific discovery.
Understanding magnetism
Our latest paper shows how our quantum computer rivals the best classical approaches in expanding our understanding of magnetism. This provides an entry point that could lead directly to innovations in fields from biochemistry, to defense, to new materials. These are tangible and meaningful advances that will deliver real world impact.
To achieve this, we partnered with researchers from Caltech, Fermioniq, EPFL, and the Technical University of Munich. The team used Quantinuum’s System Model H2 to simulate quantum magnetism at a scale and level of accuracy that pushes the boundaries of what we know to be possible.
As the authors of the paper state:
“We believe the quantum data provided by System Model H2 should be regarded as complementary to classical numerical methods, and is arguably the most convincing standard to which they should be compared.”
Our computer simulated the quantum Ising model, a model for quantum magnetism that describes a set of magnets (physicists call them ‘spins’) on a lattice that can point up or down, and prefer to point the same way as their neighbors. The model is inherently “quantum” because the spins can move between up and down configurations by a process known as “quantum tunneling”.
Gaining material insights
Researchers have struggled to simulate the dynamics of the Ising model at larger scales due to the enormous computational cost of doing so. Nobel laureate physicist Richard Feynman, who is widely considered to be the progenitor of quantum computing, once said, “it is impossible to represent the results of quantum mechanics with a classical universal device.” When attempting to simulate quantum systems at comparable scales on classical computers, the computational demands can quickly become overwhelming. It is the inherent ‘quantumness’ of these problems that makes them so hard classically, and conversely, so well-suited for quantum computing.
These inherently quantum problems also lie at the heart of many complex and useful material properties. The quantum Ising model is an entry point to confront some of the deepest mysteries in the study of interacting quantum magnets. While rooted in fundamental physics, its relevance extends to wide-ranging commercial and defense applications, including medical test equipment, quantum sensors, and the study of exotic states of matter like superconductivity.
Instead of tailored demonstrations that claim ‘quantum advantage’ in contrived scenarios, our breakthroughs announced this week prove that we can tackle complex, meaningful scientific questions difficult for classical methods to address. In the work described in this paper, we have proved that quantum computing could be the gold standard for materials simulations. These developments are critical steps toward realizing the potential of quantum computers.
With only 56 qubits in our commercially available System Model H2, the most powerful quantum system in the world today, we are already testing the limits of classical methods, and in some cases, exceeding them. Later this year, we will introduce our massively more powerful 96-qubit Helios system - breaching the boundaries of what until recently was deemed possible.