Quantinuum is developing new frameworks for artificial intelligence
How do machines “learn”?
While recent years have seen incredible advancements in Artificial Intelligence (AI), no-one really knows how these ‘first-gen’ systems actually work. New work at Quantinuum is helping to develop different frameworks for AI that we can understand - making it interpretable and accountable and therefore far more fit for purpose.
The current fascination with AI systems built around generative Large Language Models (LLMs) is entirely understandable, but lost amid the noise and excitement is the simple fact that AI tech in its current form is basically a “black box” that we can’t look into or examine in any meaningful manner. This is because when computer scientists were starting to figure out how to make machines ‘human like’ and ‘think’, they turned to our best model for a thinking machine, the human brain. The human brain essentially consists of neural networks, and so computer scientists developed artificial neural networks.
However, just as we don’t fully understand how human intelligence works, it’s also true that we don’t really understand how current artificial intelligence works – neural networks are notoriously difficult to interpret and understand. This is broadly described as the “interpretability” issue in AI.
It is self-evident that interpretability is crucial for all kinds of reasons – AI has the power to cause serious harm alongside immense good. It is critical that users understand why a system is making the decisions it does. When we read and hear about ‘safety concerns’ with AI systems, interpretability and accountability are key issues.
At Quantinuum we have been working on this issue for some time – and we began way before AI systems such as generative LLM’s became fashionable. In our AI team based out of Oxford, we have been focused on the development of frameworks for “compositional models” of artificial intelligence. Our intentions and aims are to build artificial intelligence that is interpretable and accountable. We do this in part by using a type of math called “category theory” that has been used in everything from classical computer programming to neuroscience.
Category theory has proven to be a sort of “Rosetta stone”, as John Baez put it, for understanding our universe in an expansive sense – category theory is helpful for things as seemingly disparate as physics and cognition. In a very general sense, categories represent things and ways to go between things, or in other words, a general science of systems and processes. Using this basic framework to understand cognition, we can build new artificial intelligences that are more useful to us – and we can build them on quantum computers, which promise remarkable computing power.
Our AI team, led by Dr. Stephen Clark, Head of AI at Quantinuum, has published a new paper applying these concepts to image recognition. They used their compositional quantum framework for cognition and AI to demonstrate how concepts like shape, color, size, and position can be learned by machines – including quantum computers.
“In the current environment with accountability and transparency being talked about in artificial intelligence, we have a body of research that really matters, and which will fundamentally affect the next generation of AI systems. This will happen sooner than many anticipate” said Ilyas Khan, Quantinuum’s founder.
This paper is part of a larger body of work in quantum computing and artificial intelligence, which holds great promise for our future - as the authors say, “the advantages this may bring, especially with the advent of larger, fault-tolerant quantum computers in the future, is still being worked out by the research community, but the possibilities are intriguing at worst and transformational at best.”
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.
The 2025 Joint March Meeting and April Meeting — referred to as the APS Global Physics Summit — is the largest physics research conference in the world, uniting 14,000 scientific community members across all disciplines of physics.
The Quantinuum team is looking forward to participating in this year’s conference to showcase our latest advancements in quantum technology. Find us throughout the week at the below sessions and visit us at Booth 1001.
Join these sessions to discover how Quantinuum is advancing quantum computing
T11: Quantum Error Correction
Speaker: Natalie Brown
Date: Sunday, March 16th
Time: 8:00 – 8:12am
Location: Anaheim Convention Center, 261B (Level 2)
The computational power of random quantum circuits in arbitrary geometries
Session MAR-F34: Near-Term Quantum Resource Reduction and Random Circuits
Speaker: Matthew DeCross
Date: Tuesday, March 18th
Time: 8:00 – 8:12am
Location: Anaheim Convention Center, 256A (Level 2)
Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer
Session MAR-F14: Realizing Topological States on Quantum Hardware
Speaker: Henrik Dreyer
Date: Tuesday, March 18th
Time: 9:12 – 9:48am
Location: Anaheim Convention Center, 158 (Level 1)
Trotter error time scaling separation via commutant decomposition
Session MAR-F34: Near-Term Quantum Resource Reduction and Random Circuits
Speaker: Yi-Hsiang Chen (Quantinuum)
Date: Tuesday, March 18th
Time: 10:00 – 10:12am
Location: Anaheim Convention Center, 256A (Level 2)
Squared overlap calculations with linear combination of unitaries
Session MAR-J35: Circuit Optimization and Compilation
Speaker: Michelle Wynne Sze
Date: Tuesday, March 18th
Time: 4:36 – 4:48pm
Location: Anaheim Convention Center, 256B (Level 2)
High-precision quantum phase estimation on a trapped-ion quantum computer
Session MAR-L16: Quantum Simulation for Quantum Chemistry
Speaker: Andrew Tranter
Date: Wednesday, March 19th
Time: 9:48 – 10:00am
Location: Anaheim Convention Center, 160 (Level 1)
Robustness of near-thermal dynamics on digital quantum computers
Session MAR-L16: Quantum Simulation for Quantum Chemistry
Speaker: Eli Chertkov
Date: Wednesday, March 19th
Time: 10:12 – 10:24am
Location: Anaheim Convention Center, 160 (Level 1)
Floquet prethermalization on a digital quantum computer
Session MAR-Q09: Quantum Simulation of Condensed Matter Physics
Speaker: Reza Haghshenas
Date: Thursday, March 20th
Time: 10:00 – 10:12am
Location: Anaheim Convention Center, 204C (Level 2)
Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer
Session MAR-S11: Advances in QEC Experiments
Speaker: Ciaran Ryan-Anderson
Date: Thursday, March 20th
Time: 11:30 – 12:06pm
Location: Anaheim Convention Center, 155 (Level 1)
*All times in Pacific Standard Time
A team from Quantinuum and the University of Freiburg found that quantum computers outperform classical for a workhorse calculation often used in accelerators like the Large Hadron Collider (LHC) at CERN.
Quantinuum’s Ifan Williams worked with the University of Freiburg’s Mathieu Pellen to tackle a pernicious problem in accelerator physics: calculating “cross sections”. Together, they developed a general, scalable approach to calculating cross sections that offers a quadratic speed-up compared to its classical counterpart.
A “cross-section” relates to the probability of a certain interaction happening. Scientists who do experiments in particle accelerators compare real measurements with theoretical cross-section calculations (predictions), using the agreement (or disagreement) to reason about the nature of our universe.
Generally, scientists run Monte Carlo simulations to make their theoretical predictions. Monte Carlo simulations are currently the biggest computational bottleneck in experimental high-energy physics (HEP), costing enormous CPU resources, which will only grow larger as new experiments come online.
It’s hard to put a specific number on exactly how costly calculations like this are, but we can say that probing fundamental physics at the LHC probably uses roughly 10 billion CPUH/year for data treatment, simulations, and theory predictions. Knowing that the theory predictions represent approximately 15-25% of this total, putting even a 10% dent in this number would be a massive change.
The collaborators used Quantinuum’s Quantum Monte Carlo integration (QMCI) engine to solve the same problem. Their work is the first published general methodology for performing cross-section calculations in HEP using quantum integration.
Importantly, the team’s methodology is potentially extendable to the problem sizes needed for real-world HEP cross-section calculations (currently done classically). Overall, this work establishes a solid foundation for performing such computations on a quantum computer in the future.
The Large Hadron Collider, the world’s biggest particle accelerator, generates a billion collisions each second, far more data than can be computationally analyzed. Planned future experiments are expected to generate even more. Quantum computers are also accelerating. Quantinuum’s latest H2 System became the highest performing commercially available system in the world when it was launched. When it was upgraded in 2024, it became the first quantum computer that cannot be exactly simulated by any classical computer. Our next generation Helios, on schedule to launch in 2025, will encode at least a trillion times more information than the H2—this is the power of exponential growth.
We can’t wait to see what’s next with quantum computing and high-energy physics.
The Quantinuum team is looking forward to participating in this year’s SCAsia conference from March 10th – 13th in Singapore. Meet our team at Booth B2 to discover how Quantinuum is bridging the gap between quantum computing and high-performance compute with leading industry partners.
Our team will be participating in workshops and presenting at the keynote and plenary sessions to showcase our quantum computing technologies. Join us at the below sessions:
Monday, March 10th, 1:30 – 2:30pm
Workshop: Accelerating Quantum Supercomputing: CUDA-Q Tutorial across Multiple Quantum Platforms
Location: Room P10 – Peony Jr 4512 (Level 4)
This workshop will explore the seamless integration of classical and quantum resources for quantum-accelerated supercomputing. Join Kentaro Yamamoto and Enrico Rinaldi, Lead R&D Scientists at Quantinuum, for an Introduction to our integrated full-stack for quantum computing, Quantum Phase Estimation (QPE) for solving quantum chemistry problems, and a demonstration of a QPE algorithm with CUDA-Q on Quantinuum Systems. If you're interested in access to our quantum computers and emulator for use on the CUDA-Q platform, register here.
Tuesday, March 11th, 11:00 – 11:30pm
Keynote: Quantum Computing: A Transformative Force for Singapore's Regional Economy
Location: Melati Ballroom (Level 4)
Quantum Computing is no longer a distant promise; it has arrived and is poised to revolutionize several economies. Join our President and CEO, Dr. Rajeeb Hazra, to discover how Quantinuum’s approach to Quantum Generative AI is driving breakthroughs in applications which hold significant relevance for Singapore, in fields like chemistry, computational biology, and finance. Additionally, Raj will discuss the challenges and opportunities of adopting quantum solutions from both technical and business perspectives, emphasizing the importance of collaboration to build quantum applications that integrate the best of quantum and AI.
Tuesday, March 11th, 5:40 – 6:00pm
Industry Breakout Track: Transformative value of Quantum and AI: bringing meaningful insights for critical applications today
Location: Room L1 – Lotus Jr (Level 4)
The ability to solve classically intractable problems defines the transformative value of quantum computing, offering new tools to redefine industries and address complex humanity challenges. In this session with Dr. Elvira Shishenina, Senior Director of Strategic Initiatives, discover how Quantinuum’s hardware is leading the way in achieving early fault-tolerance, marking a significant step forward in computational capabilities. By integrating quantum technology with AI and high-performance computing, we are building systems designed to address real-world issues with efficiency, precision and scale. This approach empowers critical applications from hydrogen fuel cells and carbon capture to precision medicine, food security, and cybersecurity, providing meaningful insights at a commercial level today.
Wednesday, March 12th, 4:40 – 5:00pm
Hybrid Quantum Classical Computing Track: Quantifying Quantum Advantage with an End-to-End Quantum Algorithm for the Jones Polynomial
Location: Room O3 – Orchid Jr 4211-2 (Level 4)
Join Konstantinos Meichanetzidis, Head of Scientific Product Development, for this presentation on an end-to-end reconfigurable algorithmic pipeline for solving a famous problem in knot theory using a noisy digital quantum computer. Specifically, they estimate the value of the Jones polynomial at the fifth root of unity within additive error for any input link, i.e. a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. In their research, they demonstrate our quantum algorithm on Quantinuum’s H2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, they construct an efficiently verifiable benchmark to characterize the effect of noise present in a given quantum processor. In parallel, they implement and benchmark the state-of-the-art tensor-network-based classical algorithms.The practical tools provided in the work presented will allow for precise resource estimation to identify near-term quantum advantage for a meaningful quantum-native problem in knot theory.
Thursday, March 13th, 11:00 – 11:30pm
Industry Plenary: Quantum Heuristics: From Worst Case to Practice
Location: Melati Ballroom (Level 4)
Which problems allow for a quantum speedup, and which do not? This question lies at the heart of quantum information processing. Providing a definitive answer is challenging, as it connects deeply to unresolved questions in complexity theory. To make progress, complexity theory relies on conjectures such as P≠NP and the Strong Exponential Time Hypothesis, which suggest that for many computational problems, we have discovered algorithms that are asymptotically close to optimal in the worst case. In this talk, Professor Harry Buhrman, Chief Scientist for Algorithms and Innovation, will explore the landscape from both theoretical and practical perspectives. On the theoretical side, I will introduce the concept of “queasy instances”—problem instances that are quantum-easy but classically hard (classically queasy). On the practical side, I will discuss how these insights connect to advancements in quantum hardware development and co-design.
*All times in Singapore Standard Time