ԹϺ

ԹϺ researchers tackle AI’s ‘interpretability problem’, helping us build safer systems

June 26, 2024
The Artificial Intelligence (AI) systems that have recently permeated our lives have a serious problem: they are built in a way that makes them very hard - and sometimes impossible - to understand or interpret. Luckily, our team is tackling this problem, and we’ve just published that covers the issue in detail.


It turns out that the lack of explainability in machine learning (ML) models, such as ChatGPT or Claude, comes from the way that the systems are built. Their underlying architecture (a neural network) lacks coherent structure. While neural networks can be trained to effectively solve certain tasks, the way they do it is largely (or, from a practical standpoint, almost wholly) inaccessible. This absence of interpretability in modern ML is increasingly a major concern in sensitive areas where accountability is required, such as in finance and the healthcare and pharmaceutical sectors. The “interpretability problem in AI” is therefore a topic of grave worry for large swathes of the corporate and enterprise sector, regulators, lawmakers, and the general public. 

These concerns have given birth to the field of eXplainable AI, or XAI, which attempts to solve the interpretability problem through so-called ‘post-hoc’ techniques (where one takes a trained AI model and aims to give explanations for either its overall behavior or individual outputs). This approach, while still evolving, has its own issues due to the approximate nature and fundamental limitations of post-hoc techniques.  

The second approach to the interpretability problem is to employ new ML models that are, by design, inherently interpretable from the start. Such an interpretable AI model comes with explicit structure which is meaningful to us “from the outside”. Realizing this in the tech we use every day means completely redesigning how machines learn - creating a new paradigm in AI. As Sean Tull, one of the authors of the paper, stated: “In the best case, such intrinsically interpretable models would no longer even require XAI methods, serving instead as their own explanation, and one of a deeper kind.”

At ԹϺ, we’re continuing work to develop new paradigms in AI while also working to sharpen theoretical and foundational tools that allow us all to assess the interpretability of a given model. In , we present a new theoretical framework for both defining AI models and analyzing their interpretability. With this framework, we show how advantageous it is for an AI model to have explicit and meaningful compositional structure.

The idea of composition is explored in a rigorous way using a mathematical approach called “category theory”, which is a language that describes processes and their composition. The category theory approach to interpretability can be accomplished via a graphical calculus which was also developed in part by ԹϺ scientists, and which is finding use cases in everything from gravity to quantum computing. 

A fundamental problem in the field of XAI has been that many terms have not been rigorously defined, making it difficult to study - let alone discuss - interpretability in AI. Our paper presents the first known theoretical framework for assessing the compositional interpretability of AI models. With our team’s work, we now have a precise and mathematically defined definition of interpretability that allows us to have these critical conversations.    

After developing the framework, our team used it to analyze the full spectrum of ML approaches. We started with Transformers (the “T” in ChatGPT), which are not interpretable – pointing to a serious issue in some of the world’s most widely used ML tools. This is in contrast with (sparse) linear models and decision trees, which we found are indeed inherently interpretable, as they are usually described.  

Our team was also able to make precise how other ML models were what they call 'compositionally interpretable'. These include models already studied by our own scientists including models, causal models, and .

Many of the models discussed in this paper are classical, but more broadly the use of category theory and string diagrams makes these tools very well suited to analyzing quantum models for machine learning. In addition to helping the broader field accurately assess the interpretability of various ML models, the seminal work in this paper will help us to develop systems that are interpretable by design. 

This work is part of our broader AI strategy, which includes , and – in this case - using the tools of category theory and compositionality to help us better understand AI. 

About ԹϺ

ԹϺ, the world’s largest integrated quantum company, pioneers powerful quantum computers and advanced software solutions. ԹϺ’s technology drives breakthroughs in materials discovery, cybersecurity, and next-gen quantum AI. With over 500 employees, including 370+ scientists and engineers, ԹϺ leads the quantum computing revolution across continents. 

Blog
|
events
August 24, 2026
IEEE Quantum Week 2026

Every year, The IEEE International Conference on Quantum Computing and Engineering – or – brings together engineers, scientists, researchers, students, and others to learn about advancements in quantum computing.

This year’s conference, from September 13th - 18th in Toronto, Canada, will focus on translating research into real-world impact through the convergence of generative AI, distributed quantum systems, and quantum software engineering.

Throughout IEEE Quantum Week, our quantum experts will be on-site to share insights on upgrades to our hardware, enhancements to our software stack, our path to error correction, and more.

Meet our team at Booth #501 and join the below sessions to discover how ԹϺ is forging the path to fault-tolerant quantum computing with our integrated full-stack.

Keynote with ԹϺ's CEO, Dr. Rajeeb Hazra
September 14th

5:00 – 6:30pm | 800 Hall G
Quantum computing has passed the point where error correction is theoretical. What comes next depends on systems that hold logical performance steady and do real work at scale. On September 14th, join ԹϺ’s CEO Dr. Rajeeb Hazra for his keynote session on “Logically Speaking: The Next Era of Error Correction” where he will explore what the next era of quantum computing requires: shared definitions of logical performance, and benchmarks built on real workloads.

Speaking Sessions
September 13th

11:00 – 11:12am | Location: 601A/B
Finding Compatible Datasets for Quantum Generative Modeling
Presenting Author: Chen-Yu Liu

September 14th

1:00 – 1:20pm | Location: 701B
Cryo-ASICs for Scalable Control
Speaker: Dr. Patty Lee

September 15th

2:30 – 3:30pm | Exhibit Hall (informal event)
The Quantum Spectrum
Speaker: Dr. Patty Lee

3:00 – 4:30pm | Location: 801A
Panelist: Neal Erickson

3:00 – 4:30pm | Location: 718A
Panelist: Kortny Rolston-Duce

September 16th

10:00 – 11:30am | Location: 801B
Panelist: Enrico Rinaldi

September 17th

10:00 – 11:30am | Location: 701B
Organizer: Kortny Rolston-Duce

10:00 – 11:30am | Location: 714A
Speaker: Neal Erickson

10:00 – 11:30am
The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
Presenting Author: Leonardo Placidi

10:15 – 11:00 am | Location: 601A/B
Automated near-term quantum algorithm discovery
Speaker: Konstantinos Meichanetzidis

11:00 – 11:15am | Location: 601A/B
Fast Stabilizer State Preparation via AI-Optimized Graph Decimation
Presenting Author: Jasmine Brewer

1:00 – 1:15pm | Location: 601A/B
Reinforcement Learning for Adaptive Composition of Quantum Circuit Optimisation Passes
Speaker: Gabriel Matos

1:00 – 1:20am | 718B
Speaker: Ross Duncan

1:00 – 2:30pm | Location: 714A
Speaker: Phillipp Seitz

1:45 – 2:00pm | Location: 601A/B
Graph-Theoretic Quantum Circuit Optimization with the ZX-Calculus and Gumbel AlphaZero
Speaker: Alexander Koziell-Pipe

2:00 – 2:15pm | Location: 601A/B
Reusable Equivariant Neural Compilers for Matrix-Group Quantum Circuit Synthesis
Speaker: Richie Yeung

September 18th

10:00 – 11:30am | Location: 801B
Panelist: Setso Metodi

events
All
Blog
|
technical
August 18, 2026
Teaching AI with Quantum Data

AI + quantum computing: ԹϺ, NVIDIA, and Pfizer have combined transformer-based generative AI with quantum computing to automatically generate high-quality quantum chemistry circuits more efficiently than traditional optimization methods.

Practical pharma impact: The approach was used to prepare molecular ground states and validated on ԹϺ’s Helios hardware, demonstrating a path toward larger-scale computational chemistry and drug discovery.

Long-term vision: The team aims to build quantum foundation models that learn from increasingly complex quantum data, eventually enabling AI to design circuits for molecules too large for classical simulation.

Quantum computing has long promised a future that expands what we can do with compute — for example, in molecular simulation, materials discovery, or pharmaceuticals development. But between that promise and practical utility sits a stubborn bottleneck: quantum state preparation.

To run any algorithm on a quantum computer, you must first put the qubits in the right starting state. Think of it like setting up a Rube Goldberg machine- except in this case, you’re not sure exactly which initial setup will give you the results you want. This is what makes quantum state preparation so important: your choice of initial state dictates the accuracy and cost of the rest of the calculation.

We teamed up with NVIDIA and Pfizer to tackle this problem, with an eye towards developing meaningful industrial workflows. The result is a new generative quantum AI framework, called ADAPT-GQE, which we consider to be a canonical instance of GenQAI. ADAPT-GQE uses quantum data to train transformer models that ultimately synthesize quantum chemistry circuits faster, with better outcomes, in a sort of ‘virtuous cycle’.

Ultimately, this means we have developed a new interface between quantum computing and AI. By treating quantum circuit generation as a language modelling problem, we now have a system that can generate high-quality ground-state preparation circuits - with comparable or improved state preparation accuracy.

The Magic – and Difficulty – of Computational Chemistry

The goal of computational chemistry is to learn about chemical properties without performing expensive, time-consuming, and sometimes dangerous “wet-lab” experiments.

In principle, you can replace the majority of your physical experiments with computer simulations, saving billions of dollars and years of time.

In reality, computational chemistry is very tricky. To accurately simulate a chemical inside of a computer, you have to build it from the ground up. You start with a collection of atoms (in the case of imipramine, you have 19 Carbon atoms, 24 Hydrogen atoms, and 2 Nitrogen atoms). Then, like Nature’s ‘lego’, you assemble those atoms into a molecule: you set bond lengths, strengths, angles, interactions, and so on.

This is not straightforward: a single molecule can exist in many forms; with different angles, rotations, etc. We will call these different forms ‘conformations’.

Then, to actually estimate chemical properties, or to explore chemical reaction pathways, you have to reproduce the detailed physics that goes on at the atomic level: take your chosen conformation then figure out how each orbital is occupied, how the electrons are interacting with each other or the atomic nuclei, how is the addition of heat or a catalyst going to affect things.... it gets complicated, quickly.

Despite all this, computational chemistry is a powerhouse in pharmaceutical development. Right now, pharmaceutical companies save money and time by simulating as much as they can on computers, avoiding time consuming and expensive laboratory experiments. However, even with ~50 years of development, the existing classical methods have very real limitations.

This is where quantum computing comes in: this new computational paradigm can elide those limitations because it has many of the “hard parts” (like superposition or entanglement) natively encoded. Used correctly, quantum computing promises to break old barriers, further improving margins for pharma companies across the globe while contributing to meaningful, impactful, discoveries.

A Virtuous Cycle: Using Quantum Data to Train AI, Which Then Designs Better Quantum Circuits

While quantum computational chemistry is one of the strongest candidates for near-term quantum advantage, current hardware is still in the earlier stages of development. With limited qubits and error rates, algorithm designers need to make every gate count, keep circuits shallow, and be able to tolerate some level of noise.

This is where generative AI enters the picture.

Instead of hand-designing chemistry circuits and laboriously experimenting to see how well they run, there is another idea: what if we trained an AI to solve the problems that quantum computational chemistry faces?

Using this approach, not only can we save time and resources; but we can shorten the timeline to realize practical results. With better state prep and other circuits, applications that were once considered far in the future come into view.

Our first attempt at this is called ADAPT-GQE. The central idea behind ADAPT-GQE is deceptively simple: instead of laboriously searching for good quantum circuits from scratch, train a transformer model to generate them directly.

Importantly, the framework is model-agnostic, which we showed by deploying it on complementary transformer architectures - (a pretrained LLM) and (trained from scratch).

From Iterative Optimization to Generative Models

The initial goal here is to find the ‘ground state’ of the molecule imipramine (this is the electronic state with the smallest amount of energy stored inside it). To do this, you have to find the right ‘state preparation circuit’, as described above.

Until now, a leading method for finding the ground state with quantum computers was the ‘Variational Quantum Eigensolver (VQE)’, a hybrid quantum-classical approach. The VQE process starts with a ‘guess’ circuit for a particular conformation of the molecule. The quantum computer runs the circuit to measure the associated energy of the molecule. This result is fed back into a classical optimizer that then tweaks the circuit parameters, hopefully resulting in one with a lower molecular energy. This loop repeats until a minimum energy is found.

Unfortunately, VQE has a few severe limitations that make it infeasible for widespread use. The recently proposed ADAPT-VQE was a crucial step forward meant to address some of the issues with “plain” VQE. In ADAPT-VQE, instead of starting with a guess for the initial circuit, the process builds a circuit in steps by selecting operators from a pool(typically using gradient information) and optimizing. This approach can be more effective, but unfortunately still grows too large too quickly.

This is where the joint team jumped in.

Combining the best of all worlds, the team’s new framework, ADAPT-GQE, combines AI with the ADAPT-VQE to create something entirely new – and something that, so far, is a scalable, hardware-validated pathway toward automated quantum circuit synthesis.

First, transformers (in this case, Nemotron and Gemma) are trained via supervised fine-tuning on ADAPT-VQE data. In this way, the old method isn’t thrown away but is instead treated as a high-quality data-producing “oracle”.

Then, once the transformer has been initially trained, it defines a distribution over circuits, each one with some probability of corresponding to the ground state. This distribution can be used in a fine-tuning loop, for example, reinforcement learning. In reinforcement learning, the framework takes a circuit from that distribution, runs it, and measures the energy. It feeds the results back into the transformer, which adjusts its distribution. Over time, the model learns to prioritize circuits that prepare increasingly accurate ground states.

Crucially, reinforcement learning allows the system to surpass its original training data instead of merely imitating it. The model is no longer acting as a compressed lookup table for ADAPT-VQE. It begins exploring novel circuit configurations that may outperform the teacher algorithm itself. This is one of the most important conceptual shifts in the project.

In this case, instead of running all the initial circuits on ԹϺ’s Helios, the reinforcement learning circuits were run using NVIDIA accelerated computing and the CUDA-Q platform, simulating a quantum processor.

Finally, once the transformers are optimized via reinforcement learning, the best resulting circuits are validated for accuracy and feasibility, by running them using InQuanto and on ԹϺ’s newest hardware, Helios. With InQuanto v5.2, users can now with both the Helios quantum computer and the Selene quantum emulator through Nexus.

This powerful combination of InQuanto and Nexus enabled the execution one of the largest AI-generated quantum chemistry circuits to date on a quantum computer; helping to turn the promise of quantum computing into a practical tool for pharmaceutical development.

Teaching a Transformer

Looking farther in the future, the researchers envision something much larger than a single molecular benchmark.

For bigger and more complex molecules, ADAPT-VQE won’t work in the first place as the initial training “oracle”. In addition, the molecular energy calculations used in the reinforcement learning grow too large for classical systems simulating quantum computers, so the quantum processor becomes essential.

Luckily, this is not a problem. The ultimate goal of the ADAPT-GQE framework is to develop a “curriculum” for the transformers. This means instead of re-training them for every new molecule, you instead keep what you already learned, and expand your knowledge from there.

By initially teaching it on molecules that are smaller, and that can be fully simulated, you ensure it learns on good data that can be double checked using known methods. From there, you can carefully build up the complexity to see how the transformer learns. Eventually, you hope to train it on molecules that can’t be simulated classically, using purely quantum data, all the while getting closer to the complexity levels you’re chasing.

This penultimate result is called a ‘foundation model’, which is a massive AI neural network trained on vast, broad datasets that can be adapted to a wide variety of downstream tasks. In this case, the team is building the very ‘foundations’ of a model that can solve the ‘electronic structure problem’, which is the core computational challenge lying at the heart of quantum (and classical) computational chemistry.

A New Interface Between AI and Quantum Computing

What makes this work particularly interesting is that it treats quantum circuit generation as a language modeling problem: circuits become sequences, transformers learn distributions over those sequences, and reinforcement learning optimizes them against physical reward functions.

The result is an AI system capable of proposing quantum circuits that were never explicitly programmed by humans.

That does not mean generative AI is replacing physics or chemistry. Instead, it is becoming a new interface layer for navigating unimaginably large search spaces that traditional optimization methods struggle to explore efficiently.

For quantum chemistry, that could become transformative.

If successful, frameworks like ADAPT-GQE may eventually allow researchers to synthesize useful quantum circuits for molecular systems too large for classical computation, accelerating everything from materials discovery to pharmaceutical design.

The broader implication is difficult to ignore: foundation models may eventually extend beyond language, images, and code — and into the fabric of physical reality itself.

technical
All
partnership
All
Blog
|
technical
August 17, 2026
Accuracy Is the Foundation of Meaningful Quantum Computing

Recently, industry peers—including ԹϺ’s Startup Program Partners and , as well as our partner —published a exploring quantum magnetism that “extends beyond the reach of the state-of-the-art classical methods considered;” evidence of a quantum advantage result. Interestingly, the team validated their results on ԹϺ machines (both Helios and System Model H2).

In 2025, ), exploring a similar system - also at scales that frustrate classical computation. This got us thinking: with more successes like this in the literature, what does this mean for the ecosystem at large? What are the key lessons to learn from these early demonstrations? And, perhaps most importantly, what’s next?

We Are Entering the Era of ‘What’, Not ‘When’

The answer to the first question, ‘what does this mean for the ecosystem at large’, is a delight to answer. After decades of promises, we are finally in the era where quantum computing is matched with, if not outright exceeding, classical HPC and supercomputing.

Examples of (complexity-theory proven) quantum advantage are already common, usually in the form of . This was extended to , which was one of the earliest commercial applications of quantum computing.

Since then, we have seen a number of results from different groups that push the limits of classical computing while exploring ‘real’ problems; these range from papers exploring (as mentioned above), to papers exploring things like or

Whether or not these are definitively ‘quantum advantage’ results is almost beside the point. They mark a distinct place on the path towards broad scale quantum utility, when quantum computers will be widely useful for researchers and industry alike. More importantly, these papers all speak to a certain level of ‘technological readiness’, showing that quantum computers are now proven to work on problems that are relevant (to some people, at least), at scales that aren’t easily reproduced elsewhere.

Accuracy is a Baseline Requirement  

One of the key lessons we can learn from all these demonstrations is that hardware accuracy is paramount. Without accuracy, quantum computers are very expensive noise generators, unable to move the needle beyond HPC. Happily, we are finding that current generation machines are still capable of quite a lot, thanks to baseline physical accuracy, optionally coupled with clever error mitigation on top.

In general, we are very pleased to see how error mitigation can significantly reduce the impact of hardware errors and improve the quality of computed results by applying sophisticated post-processing techniques. However, error mitigation is not free. As hardware noise increases, mitigation becomes increasingly computationally expensive, and the techniques themselves can skew the results. If the underlying hardware is insufficiently accurate, it becomes more difficult to distinguish genuine physical phenomena from artifacts introduced via mitigation.

This is precisely where hardware quality matters. The validation on ԹϺ systems provided an important independent confirmation that the mitigated results from another vendor reflected real physical behavior rather than bias introduced through the mitigation process. Because ԹϺ's hardware operates with substantially lower native error rates, it served as a high-confidence reference point for validating scientific results. Importantly, this validation was about confirming the underlying physics, not validating a claim of quantum advantage.

Hardware Accuracy Improves Computational Efficiency

All the above reflects our systems' strong native performance: when hardware begins with exceptionally high fidelity, there is simply less error to overcome. However, error mitigation remains an interesting and valuable approach: high-quality hardware establishes the baseline, and software extends what is possible.

However, native accuracy affects more than scientific confidence—it also influences computational efficiency. As program complexity and size increases, hardware error rates increase, and successful error mitigation generally requires more sampling, more processing, and more computational resources. The lower the physical fidelity, the greater the overhead required before arriving at trustworthy results.

By starting with significantly lower native error rates, ԹϺ systems reduce the amount of mitigation needed to achieve comparable scientific outcomes. This creates a practical advantage in computational cost while helping to preserve confidence in the resulting data.

Accuracy is the Foundation for Fault Tolerance

Finally, we can answer the question of what comes next. This may seem obvious, but it’s multifaceted. What’s next is large-scale fault tolerant quantum computing. But the real question is, what does that look like?

A truly large-scale fault tolerant quantum computer will operate with error correction embedded into the workflow, working on the ‘logical’ level. That means that programmers will write their code to operate on logical qubits, with all the mechanisms of error correction hidden under the hood. The result will be error rates low enough to run some truly behemoth workflows.

We are well along the path to realizing this : we have demonstrated , have world-leading , and have a platform as they are invented; a crucial advantage in a quickly-evolving landscape. All of this is enabled by our high native accuracy; the accomplishments listed would be impossible without hardware that wasn’t ultra-low error to begin with.

However, even with the full force of error correction, error mitigation may still play an important role in the post fault-tolerance era. While error correction will be applied broadly to all workflows, there will still be some special cases where error mitigation may stretch the hardware further, always ensuring we stay on our front foot as computational power grows.

Progress Is the Real Milestone

Scientific breakthroughs matter because they move the field forward. But lasting enterprise value will come from quantum computers that consistently deliver results organizations can trust.

With Helios—the world's most accurate commercial quantum computer[1]—and a growing ecosystem of partners building complementary technologies, ԹϺ is creating the accurate, scalable foundation needed to transform scientific achievements into practical quantum computing.

[1] Based on two qubit gate fidelity, as of December 31, 2025.

technical
All