�ԹϺ�����

Our next-generation quantum computer, Helios, will come online this year as more than a new chip. It will arrive as a full-stack platform that sets a new standard for the industry.

With our current and previous generation systems, H2 and H1, we have set industry records for the highest fidelities, pioneered the teleportation of logical qubits, and introduced the world’s first commercial application for quantum computers. Much of this success stems from the deep integration between our software and hardware.

Today, we are excited to share the details of our new software stack. Its features and benefits, outlined below, enable a lower barrier to entry, faster time-to-solution, industry-standard access, and the best possible user experience on Helios.

Most importantly, this stack is designed with the future in mind as �ԹϺ����� advances toward universal, fully fault-tolerant quantum computing.

Watch the technical webinar on our new software stack

Our Next-Generation Software Stack: What’s New

Our Current Generation Software Stack
Currently, the solutions our customers explore on our quantum hardware, which span cybersecurity, quantum chemistry, and quantum AI, plus third-party programs, are all powered by two middleware technologies: 

• TKET, an open-source tool kit used by developers to build quantum software programs; and
• Nexus, a cloud-based SaaS platform, is the pathway to access our hardware, as well as third-party hardware. Nexus is our all-in-one computing platform, the entry point to everything quantum.

Our Next Generation Software Stack
The launch of Helios will come with an upgraded software stack with new features. We’re introducing two key additions to the stack, specifically:

• Guppy, a new, open-source programming language based on Python, one of the most popular general-use programming languages for classical computing; and 
• Selene, a platform that partially emulates Helios, is used to perform program analysis and verification. Selene can be seen almost as a “digital sister” for Helios. 

Moving forward, users will now leverage Guppy to run software applications on Helios and our future systems. TKET will be used solely as a compiler tool chain and for the optimization of Guppy programs.

Nexus, which remains as the default pathway to access our hardware, and third-party hardware, has been upgraded to support Guppy and provide access to Selene. Nexus also supports Quantum Intermediate Representation (QIR), an industry standard, which enables developers to program with languages like , ensuring our stack stays accessible to the whole ecosystem.

With this new stack running on our next generation Helios system, several benefits will be delivered to the end user, including, but not limited to, improved time-to-solution and reduced memory error for programs critical to quantum error correction and utility-scale algorithms.

Below, we dive deeper into these upgrades and what they mean for our customers.

Introducing Guppy: A Purpose-Built Language for Quantum Programming

‍

‍

Designed for the Next Era of Quantum Computing
Guppy is a new programming language hosted in Python, providing developers with a familiar, accessible entry point into the next era of quantum computing.

As �ԹϺ����� leads the transition from the noisy intermediate scale quantum (NISQ) era to fault-tolerant quantum computing, represents a fundamental departure from legacy circuit-building tools. Instead of forcing developers to construct programs gate-by-gate, a tedious and error-prone process, Guppy treats quantum programs as structured, dynamic software.

With native support for real-time feedback and common programming constructs like ‘if’ statements and ‘for’loops, Guppy enables developers to write complex, readable programs that adapt as the quantum system evolves. This approach unlocks unprecedented power and clarity, far surpassing traditional tools.

Designed with fault-tolerance in mind, Guppy also optimizes qubit resource management automatically, improving efficiency and reducing developer overhead.

All Guppy programs can be seamlessly submitted and managed through Nexus, our all-in-one quantum computing platform.

Find out more at

The Most Flexible Approach to Quantum Error Correction
When it comes to quantum error correction (QEC), flexibility is everything. That is why we designed Guppy to reduce barriers to entry to access necessary features for QEC.

Unlike platforms locked into rigid, hardware-specific codes, �ԹϺ�����’s QCCD architecture gives developers the freedom to implement any QEC code. In a rapidly evolving field, this adaptability is critical: the ability to test and deploy the latest techniques can mean the difference between achieving quantum advantage and falling behind.

With Guppy, developers can implement advanced protocols such as magic state distillation and injection, quantum teleportation, and other measurement-based routines, all executed dynamically through our real-time control system. This creates an environment where researchers can push the limits of fault-tolerance now—not years from now.

In addition, users can employ NVIDIA’s CUDA-QX for out-of-the-box QEC, without needing to worry about writing their own decoders, simplifying the development of novel QEC codes.

By enabling a modular, programmable approach to QEC, our stack accelerates the path to fault-tolerance and positions us to scale quickly as more efficient codes emerge from the research frontier.

Real-Time Control for True Quantum Computing
Integrated seamlessly with Guppy is a next-generation control system powered by a new real-time engine, a key breakthrough for large-scale quantum computing.

This control layer makes our software stack the first commercial system to deliver full measurement-dependent control with undefined sequence length. In practical terms, that means operations can now be guided dynamically by quantum measurements as they occur—a critical step toward truly adaptive, fault-tolerant algorithms.

At the hardware level, features like real-time transport enable dynamic software capabilities, such as conditionals, loops, and recursion, which are all foundational for scaling from thousands to millions of qubits.

These advances deliver tangible performance gains, including faster time-to-solution, reduced memory error, and greater algorithmic efficiency, providing the foundational support required to convert algorithmic advances into useful real-world applications.

Meet Selene: A “Digital Sister” for Helios and Beyond 

Quantum hardware access is limited, but development shouldn't be. Selene is our new open-source emulator, built to model realistic, entangled quantum behavior with exceptional detail and speed.

Unlike generic simulators, Selene captures advanced runtime behavior unique to Helios, including measurement-dependent control flow and hybrid quantum-classical logic. It runs Guppy programs out of the box, allowing developers to start building and testing immediately without waiting for machine time.  

supports multiple simulation backends, giving users state-of-the-art options for their specific needs, including backends optimized for matrix product state and tensor network simulations using NVIDIA GPUs and cuQuantum. This ensures maximum performance both on the quantum processor and in simulation.

Nexus: Bringing It All Together

These new features, and more, are available through Nexus, our all-in-one quantum computing platform.

Nexus serves as the middle layer that connects every part of the stack, providing a cloud-native SaaS environment for full-stack workflows, including server-side Selene instances. Users can manage Guppy programs, analyze results, and collaborate with others, all within a single, streamlined platform.

Further, Selene users who submit quantum state-vector simulations—the most complete and powerful method to simulate a general quantum circuit on a classical computer—through Nexus will be leveraging the NVIDIA cuQuantum library for efficient GPU-powered simulation.

Bringing Us All Together

Our entire stack, including Nexus and Selene, supports the industry-standard Quantum Intermediate Representation (QIR) as input, allowing users to program in their preferred programming language. QIR provides a common format for accessing a range of quantum computing backends, and �ԹϺ����� Helios will support the full Adaptive Profile QIR This means developers can generate programs for Helios using tools like NVIDIA CUDA-Q, Microsoft Q#, and ORNL XACC.

Always Looking Forward

Our customers choose �ԹϺ����� as their top quantum computing partner because no one else matches our team or our results. We remain the leaders in quantum computing and the only provider of integrated quantum resources that will address our society’s most complex problems.

That future is already taking shape. With Helios and our new software stack, we are building the foundation for scalable, programmable, real-time quantum computing.

Wherever you’re sitting right now, you’re probably surrounded by the fruits of modern semiconductor technology. Chips aren't only in your laptops and cell phones – they're in your car, your doorbell, your thermostat, and even your toaster. Importantly, semiconductor-based chips are also in the heart of most quantum computers.

While quantum computing holds transformative potential, it faces two major challenges: first, achieving low error operations (say one in a billion), and second, scaling systems to enough qubits to address complex, real-world problems (say, on the order of a million). �ԹϺ����� is proud to lead the industry in providing the lowest error rates in the business, but some continue to question whether our chosen modality, trapped-ion technology, can scale to meet these ambitious goals.

Why the doubt? Well, early demonstrations of trapped-ion quantum computers relied on bulky, expensive laser sources, large glass optics, and sizeable ion traps assembled by hand. By comparison, other modalities, such as semiconductor and superconductor qubits, resemble conventional computer chips. However, our quantum-charge-coupled device (QCCD) architecture shares the same path to scaling: at their core, our quantum computers are also chip-based. By leveraging modern microfabrication techniques, we can scale effectively while maintaining the advantage of low error rates that trapped ions provide.

Fortunately, we are at a point in history where QCCD quantum computing is already more compact compared to the early days. Traditional oversized laser sources have already been replaced by tiny diode lasers based on semiconductor chips, and our ion traps have already evolved from bulky, hand-assembled objects to traps fabricated on silicon wafers. The biggest remaining challenge lies in the control and manipulation of laser light.

For this next stage in our journey, we have turned to Infineon. Infineon not only builds some of the world’s leading classical computer chips, but they also bring in-house expertise in ion-trap quantum computing. Together, we are developing a chip with integrated photonics, bringing the control and manipulation of light fully onto our chips. This innovation drastically reduces system complexity and paves the way for serious scaling.

Since beginning work with Infineon, our pace of innovation has accelerated. Their expertise in fabricating waveguides, building grating couplers, and optimizing deposition processes for ultra-low optical loss gives us a significant advantage. In fact, Infineon has already developed deposition processes with the lowest optical losses in the world—a critical capability for building high-performance photonic systems.

Their impressive suite of failure analysis tools, such as electron microscopes, SIMS, FIB, AFMs, and Kelvin probes, allow us to diagnose and correct failures in days rather than weeks. Some of these tools are in-line, meaning analysis can be performed without removing devices from the cleanroom environment, minimizing contamination risk and further accelerating development.

Together, we are demonstrating that QCCD quantum computing is fundamentally a semiconductor technology—just like conventional computers. While seeming like it’s a world away, quantum computing is now closer to home than ever.

As organizations assess the impact of quantum computing on cryptography, many focus on algorithm migration and timelines. But preparing for PQC requires a broader view—one that includes not just new algorithms, but also the quality of the inputs that support them, including randomness.

That’s why �ԹϺ����� joined with partners Thales, Keyfactor, and IBM Consulting to form the QSafe 360 Alliance, a collaboration focused on helping organizations build crypto-agile security architectures that are ready for the quantum era. Together, we’ve released a whitepaper—Digital Trust & Cybersecurity After Quantum Computing—to offer practical guidance on post-quantum readiness, from discovery and planning to deployment.

Lessons from Past Vulnerabilities

The history of cryptography offers clear examples of what happens when randomness fail, and how long those issues can go unnoticed. The , first disclosed in 2023, exploited weak randomness in Bitcoin transaction signatures and enabled the theft of at least $25 million across 773 wallets. The vulnerability persisted undetected for nine years. The , published in 2022, revealed that biased key generation in widely used Bitcoin wallet libraries exposed millions of wallets—across a window of more than a decade (2011–2022). In both cases, cryptographic algorithms functioned as designed; it was the randomness beneath them that silently failed, leaving companies vulnerable for many years

Post-Quantum Cryptography Inherits These Risks

Post-quantum cryptography (PQC) algorithms are being designed to resist attacks from quantum computers. But they still depend on random values to generate key material. That means any implementation of PQC inherits the same reliance on randomness—but without a way to prove its quality, that layer remains a potential vulnerability.

As security teams run cryptographic inventories, develop crypto-agility plans, or build software bill-of-materials (SBOMs) for PQC migration, it’s important to include randomness in that scope. No matter how strong the algorithm, poor randomness can undermine its security from the start.

A New Approach: Proven Randomness

Quantum Origin takes a fundamentally different approach to randomness quality to deliver proven randomness which improves key generation, algorithms, and the entire security stack. It leverages strong seeded randomness extractors—mathematical algorithms that transform even weak local entropy into provably secure output. These extractors are uniquely powered by a Quantum Seed, which is generated once by �ԹϺ�����'s quantum computers using quantum processes verified through Bell tests.

This one-time quantum generation enables Quantum Origin as a software-only solution designed for maximum flexibility. It works with existing infrastructure—on cloud systems, on-premises environments, air-gapped networks, and embedded platforms—without requiring special hardware or a network connection. It's also validated to NIST SP 800-90B standards (). This approach strengthens today’s deployments of AES, RSA, ECC, and other algorithms, and lays a secure foundation for implementing the NIST PQC algorithms.

The QSafe 360 Alliance

The outlines the path to post-quantum readiness, emphasizing crypto-agility as a guiding principle: the ability to adapt cryptographic systems without major disruption, from randomness to key generation to algorithmic strength.

For security architects, CISOs, and cryptographic engineering teams building their post-quantum transition strategies, randomness is not a peripheral concern. It is a starting point.

The QSafe 360 Alliance whitepaper offers valuable guidance on structuring a comprehensive PQC journey. As you explore that framework, consider how proven randomness—available today—will help strengthen your security posture from the ground up.

Our quantum algorithms team has been hard at work exploring solutions to continually optimize our system’s performance. Recently, they’ve invented a novel technique, called the , that can offer significant resource savings in future applications.

The transform takes complex representations and makes them simple, by transforming into a different “basis”. This is like looking at a cube from one angle, then rotating it and seeing just a square, instead. Transformations like this save resources because the more complex your problem looks, the more expensive it is to represent and manipulate on qubits.

You’ve changed

While it might sound like magic, transforms are a commonly used tool in science and engineering. Transforms simplify problems by reshaping them into something that is easier to deal with, or that provides a new perspective on the situation. For example, sound engineers use Fourier transforms every day to look at complex musical pieces in terms of their frequency components. Electrical engineers use Laplace transforms; people who work in image processing use the Abel transform; physicists use the Legendre transform, and so on.

In a new paper outlining the necessary tools to implement the QPT, Dr. Nathan Fitzpatrick and Mr. Jędrzej Burkat explain how the QPT will be widely applicable in quantum computing simulations, spanning areas like molecular chemistry, materials science, and semiconductor physics. The paper also describes how the algorithm can lead to significant resource savings by offering quantum programmers a more efficient way of representing problems on qubits.

Symmetry is key

The efficiency of the QPT stems from its use of one of the most profound findings in the field of physics: that symmetries drive the properties of a system.

While the average person can “appreciate” symmetry, for example in design or aesthetics, physicists understand symmetry as a much more profound element present in the fabric of reality. Symmetries are like the universe’s DNA; they lead to conservation laws, which are the most immutable truths we know.

Back in the 1920’s, when women were largely prohibited from practicing physics, one of the great mathematicians of the century, Emmy Noether, turned her attention to the field when she was tasked with helping Einstein with his work. In her attempt to solve a problem Einstein had encountered, Dr. Noether realized that all the most powerful and fundamental laws of physics, such as “energy can neither be created nor destroyed” are in fact the consequence of a deep simplicity – symmetry – hiding behind the curtains of reality. Dr. Noether’s theorem would have a profound effect on the trajectory of physics.

In addition to the many direct consequences of Noether’s theorem is a longstanding tradition amongst physicists to treat symmetry thoughtfully. Because of its role in the fabric of our universe, carefully considering the symmetries of a system often leads to invaluable insights.

Einstein, Pauli and Noether walk into a bar...

Many of the systems we are interested in simulating with quantum computers are, at their heart, systems of electrons. Whether we are looking at how electrons move in a paired dance inside superconductors, or how they form orbitals and bonds in a chemical system, the motion of electrons are at the core.

Seven years after Noether published her blockbuster results, Wolfgang Pauli made waves when he published the work describing his Pauli exclusion principle, which relies heavily on symmetry to explain basic tenets of quantum theory. Pauli’s principle has enormous consequences; for starters, describing how the objects we interact with every day are solid even though atoms are mostly empty space, and outlining the rules of bonds, orbitals, and all of chemistry, among other things.

Symmetry in motion

It is Pauli's symmetry, coupled with a deep respect for the impact of symmetry, that led our team at �ԹϺ����� to the discovery published today.

In their work, they considered the act of designing quantum algorithms, and how one’s design choices may lead to efficiency or inefficiency.

When you design quantum algorithms, there are many choices you can make that affect the final result. Extensive work goes into optimizing each individual step in an algorithm, requiring a cyclical process of determining subroutine improvements, and finally, bringing it all together. The significant cost and time required is a limiting factor in optimizing many algorithms of interest.

This is again where symmetry comes into play. The authors realized that by better exploiting the deepest symmetries of the problem, they could make the entire edifice more efficient, from state preparation to readout. Over the course of a few years, a team lead Dr. Fitzpatrick and his colleague Jędrzej Burkat slowly polished their approach into a full algorithm for performing the QPT.

The QPT functions by using Pauli’s symmetry to discard unimportant details and strip the problem down to its bare essentials. Starting with a Paldus transform allows the algorithm designer to enjoy knock-on effects throughout the entire structure, making it overall more efficient to run.

“It’s amazing to think how something we discovered one hundred years ago is making quantum computing easier and more efficient,” said Dr. Nathan Fitzpatrick.

Ultimately, this innovation will lead to more efficient quantum simulation. Projects we believed to still be many years out can now be realized in the near term.

Transforming the future

The discovery of the Quantum Paldus Transform is a powerful reminder that enduring ideas—like symmetry—continue to shape the frontiers of science. By reaching back into the fundamental principles laid down by pioneers like Noether and Pauli, and combining them with modern quantum algorithm design, Dr. Fitzpatrick and Mr. Burkat have uncovered a tool with the potential to reshape how we approach quantum computation.

As quantum technologies continue their crossover from theoretical promise to practical implementation, innovations like this will be key in unlocking their full potential.

, we've made a major breakthrough in one of quantum computing’s most elusive promises: simulating the physics of superconductors. A deeper understanding of superconductivity would have an enormous impact: greater insight could pave the way to real-world advances, like phone batteries that last for months, “lossless” power grids that drastically reduce your bills, or MRI machines that are widely available and cheap to use.  The development of room-temperature superconductors would transform the global economy.

A key promise of quantum computing is that it has a natural advantage when studying inherently quantum systems, like superconductors. In many ways, it is precisely the deeply ‘quantum’ nature of superconductivity that makes it both so transformative and so notoriously difficult to study.

Now, we are pleased to report that we just got a lot closer to that ultimate dream.

Making the impossible possible

To study something like a superconductor with a quantum computer, you need to first “encode” the elements of the system you want to study onto the qubits – in other words, you want to translate the essential features of your material onto the states and gates you will run on the computer.

For superconductors in particular, you want to encode the behavior of particles known as “fermions” (like the familiar electron). Naively simulating fermions using qubits will result in garbage data, because qubits alone lack the key properties that make a fermion so unique.

Until recently, scientists used something called the “Jordan-Wigner” encoding to properly map fermions onto qubits. People have argued that the Jordan-Wigner encoding is one of the main reasons fermionic simulations have not progressed beyond simple one-dimensional chain geometries: it requires too many gates as the system size grows.  

Even worse, the Jordan-Wigner encoding has the nasty property that it is, in a sense, maximally non-fault-tolerant: one error occurring anywhere in the system affects the whole state, which generally leads to an exponential overhead in the number of shots required. Due to this, until now, simulating relevant systems at scale – one of the big promises of quantum computing – has remained a daunting challenge.

Theorists have addressed the issues of the Jordan-Wigner encoding and have suggested alternative fermionic encodings. In practice, however, the circuits created from these alternative encodings come with large overheads and have so far not been practically useful.

We are happy to report that our team developed a new way to compile one of the new, alternative, encodings that dramatically improves both efficiency and accuracy, overcoming the limitations of older approaches. Their new compilation scheme is the most efficient yet, slashing the cost of simulating fermionic hopping by an impressive 42%. On top of that, the team also introduced new, targeted error mitigation techniques that ensure even larger systems can be simulated with far fewer computational "shots"—a critical advantage in quantum computing.

Using their innovative methods, the team was able to simulate the Fermi-Hubbard model—a cornerstone of condensed matter physics— at a previously unattainable scale. By encoding 36 fermionic modes into 48 physical qubits on System Model H2, they achieved the largest quantum simulation of this model to date.

This marks an important milestone in quantum computing: it demonstrates that large-scale simulations of complex quantum systems, like superconductors, are now within reach.

Unlocking the Quantum Age, One Breakthrough at a Time

This breakthrough doesn’t just show how we can push the boundaries of what quantum computers can do; it brings one of the most exciting use cases of quantum computing much closer to reality. With this new approach, scientists can soon begin to simulate materials and systems that were once thought too complex for the most powerful classical computers alone. And in doing so, they’ve unlocked a path to potentially solving one of the most exciting and valuable problems in science and technology: understanding and harnessing the power of superconductivity.

The future of quantum computing—and with it, the future of energy, electronics, and beyond—just got a lot more exciting.

, we’ve just delivered a crucial result in Quantum Error Correction (QEC), demonstrating key principles of scalable quantum computing developed by Drs Peter Shor, Dorit Aharonov, and Michael Ben-Or. we showed that by using “concatenated codes” noise can be exponentially suppressed — proving that quantum computing will scale.

When noise is low enough, the results are transformative

Quantum computing is already producing results, but high-profile applications like Shor’s algorithm—which can break RSA encryption—require error rates about a billion times lower than what today’s machines can achieve.

Achieving such low error rates is a holy grail of quantum computing. Peter Shor was the first to hypothesize a way forward, in the form of quantum error correction. Building on his results, Dorit Aharanov and Michael Ben-Or proved that by concatenating quantum error correcting codes, a sufficiently high-quality quantum computer can suppress error rates arbitrarily at the cost of a very modest increase in the required number of qubits.  Without that insight, building a truly fault-tolerant quantum computer would be impossible.

Their results, now widely referred to as the “threshold theorem”, laid the foundation for realizing fault-tolerant quantum computing. At the time, many doubted that the error rates required for large-scale quantum algorithms could ever be achieved in practice. The threshold theorem made clear that large scale quantum computing is a realistic possibility, giving birth to the robust quantum industry that exists today.

Realizing a legendary vision

Until now, nobody has realized the original vision for the threshold theorem. Last year, in a different context (without concatenated codes). This year, we are proud to report the first experimental realization of that seminal work—demonstrating fault-tolerant quantum computing using concatenated codes, just as they envisioned.

The benefits of concatenation

The team demonstrated that their family of protocols achieves high error thresholds—making them easier to implement—while requiring minimal ancilla qubits, meaning lower overall qubit overhead. Remarkably, their protocols are so efficient that fault-tolerant preparation of basis states requires zero ancilla overhead, making the process maximally efficient.

This approach to error correction has the potential to significantly reduce qubit requirements across multiple areas, from state preparation to the broader QEC infrastructure. Additionally, concatenated codes offer greater design flexibility, which makes them especially attractive. Taken together, these advantages suggest that concatenation could provide a faster and more practical path to fault-tolerant quantum computing than popular approaches like the .

We’re always looking forward

From a broader perspective, this achievement highlights the power of collaboration between industry, academia, and national laboratories. �ԹϺ�����’s commercial quantum systems are so stable and reliable that our partners were able to carry out this groundbreaking research remotely—over the cloud—without needing detailed knowledge of the hardware. While we very much look forward to welcoming them to our labs before long, its notable that they never need to step inside to harness the full capabilities of our machines.

As we make quantum computing more accessible, the rate of innovation will only increase. The era of plug-and-play quantum computing has arrived. Are you ready?