The biggest, or maybe the most notable, is that we expanded the number of fully connected qubits from 12 to 20. That is a significant increase and the most qubits we’ve added to an existing machine. Last year, we added two fully connected qubits to the 10 qubits H1-1 already had. It was a major accomplishment at the time. Now, that seems easy compared to this upgrade because for us, it is not as simple as adding qubits.
To add eight more qubits and maintain all-to-all connectivity, we upgraded the optics that deliver the light used to control our qubits. Previously, we were only delivering the light needed to complete quantum gates to three different regions of the trap, which we call gate zones. Now we can address all five zones in our trap simultaneously. This enables us to complete more single-qubit or two-qubit gates in parallel, which means users can run complex algorithms without experiencing a slowdown.
This one was significantly more involved than previous upgrades. Although we didn’t modify the trap at the heart of the computer or the vacuum chamber and cryostat that enclose it, we redesigned the entire optical delivery system. This was necessary so as not to deliver light to more regions of the trap, but also to improve stability.
Increasing the size and complexity of the machine without improving the stability would be a recipe for disaster. Because we were able to improve the stability, we were able to add more qubits without sacrificing performance or key features our users expect such as all-to-all connectivity, high single and two-qubit gate fidelities, and mid-circuit measurement.
The gate zones are where all the interesting quantum stuff happens. More zones allow us to run more quantum operations in parallel, allowing for faster, more complex algorithms.
Having more gate zones allows us to use more qubits in an efficient way.
Because we can do all these operations in five different locations in parallel, it finally makes sense to put more qubits into the trap. We could have loaded more qubits into earlier versions of the system, but without additional gate zones, it doesn’t make a lot of sense. In fact, doing that would create a bottleneck with qubits waiting for their turn to do a two-qubit gate, which then slows down an algorithm. Now, we can do five quantum gates in parallel, which allows us to run more complex algorithms without sacrificing speed.
Twenty qubits are probably where this generation of traps ends. There is a possibility to add a handful more, but it feels like this is probably the most efficient number for these H1 Systems due to layout of the trap. But future generations, some of which are already trapping ions in the lab today, will use even more qubits and with the same or better efficiency.
In the QCCD architecture, trapped ions are easy to move around. By applying the right set of voltages to the trap — a small, electrode-filled device that holds qubits in place — we can arbitrarily rearrange the chain of qubits so any qubit can pair with any other and perform a quantum gate. So, you can think of any algorithm as a set of steps where we shuffle all the qubits to pair them up for the next set of gates, move them into the gate zones, and then shuffle them again to set them up for the next set of gates. The ions “dance” across the trap moving from partner to partner to execute a quantum circuit.
Some circuits, like quantum volume circuits, are densely packed, meaning that every possible pair wants to do a gate at each step of the circuit. Other circuits are very loosely packed, meaning you can only do a few gates in parallel before moving on to the next slice because you need to reuse one of those qubits with a different partner.
Although this dance may sound complicated, it makes it very easy to program our quantum computer. A user sends us a time-ordered set of gates without having to think about the layout of the qubits, and our compiler figures out how to pair up the appropriate qubits to make it happen. You don't have to worry about which ones are next to each other because any pair of qubits is equal to all the others. And, at any step, we can completely rearrange this chain and put any two qubits next to each other.
It’s like a square dance where someone calls out directions to the dancers.
We will continue to work with our customers to improve our system performance and their overall experience. One of the reasons we have a commercial system now is to allow our customers to program their algorithms on a real machine. They're dealing with all the constraints of real quantum hardware. They're pushing on their algorithms while we're pushing on the hardware, to get the fastest iterations.
As they learn new things about their algorithm, we learn what the most important things are to improve. And we work on those. We are learning a lot from our customers, and they are learning a lot by running on our hardware.
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.
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:
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.
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:
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.
Quantum randomness is already being deployed commercially:
Recognizing the value of QRNGs, the financial services sector is accelerating its path to commercialization.
On the basis of the latter achievement, we aim to broaden our cybersecurity portfolio with the addition of a certified randomness product in 2025.
The National Institute of Standards and Technology (NIST) defines the cryptographic regulations used in the U.S. and other countries.
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.
This means Quantum Origin is now available for high-security cryptographic systems and integrates seamlessly with NIST-approved solutions without requiring recertification.
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.
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”.
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.