Fault-tolerant execution of error-corrected quantum algorithms

Scaling up quantum algorithms to tackle high-impact problems in science and industry requires quantum error correction and fault tolerance. While progress has been made in experimentally realizing error-corrected primitives, the end-to-end execution of logical quantum algorithms using only fault-tolerant (FT) components has remained out of reach. We demonstrate the FT and error-corrected execution of two quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA) and the Harrow-Hassidim-Lloyd (HHL) algorithm applied to the Poisson equation, on Quantinuum H2 and Helios trapped-ion quantum processors using the $[[7,1,3]]$ Steane code. For QAOA circuits on 5 and 6 logical qubits, we show performance improvements from increasing the number of QAOA layers and the number of $T$ gates used to approximate logical rotations, despite increased physical circuit complexity. We further show that QAOA circuits with up to 8 logical qubits and 9 logical $T$ gates perform similarly to unencoded circuits. For the largest QAOA circuits we run, with 12 logical (97 physical) qubits and 2132 physical two-qubit gates, we still observe better-than-random performance. Finally, we show that adding active QEC cycles and increasing the repeat-until-success limit of state preparation subroutines can improve the performance of a quantum algorithm, thereby demonstrating critical capabilities of scalable FT quantum computation. Our results are enabled by an FT logical $T$ gate implementation with an infidelity of $\sim 2.6(4)\times10^{-3}$ and dynamic circuits with measurement-dependent feedback. Our work demonstrates near-break-even performance of complex, error-corrected algorithmic quantum circuits using only FT components.

arXiv.org
La société #Britannique #Quantinuum atteint un seuil critique jugé « improbable avant des années » en #informatique #quantique avec son processeur #Helios media24.fr/2026/03/08/l...

La société Britannique Quantin...
La société Britannique Quantinuum atteint un seuil critique jugé « improbable avant des années » en inform ...

Ils ont dépassé le point de bascule… avec 94 qubits logiques Dans le monde quantique, il existe un moment très particulier que les physiciens anglosaxons appellent le break-even ou (point de basule ou point mort en français). C’est l’instant où un qubit protégé par correction d’erreurs devient réellement plus fiable…

Media24.fr
La société Britannique Quantinuum atteint un seuil critique jugé « improbable avant des années » en inform ...

Ils ont dépassé le point de bascule… avec 94 qubits logiques Dans le monde quantique, il existe un moment très particulier que les physiciens anglosaxons appellent le break-even ou (point de basule ou point mort en français). C’est l’instant où un qubit protégé par correction d’erreurs devient réellement plus fiable…

Media24.fr

Quantum folks claim a neat flex: it’s hard for a quantum computer to tell which of two “half-the-items” states it got… but easy to swap one into the other 😼
Quantinuum (UK) and QuSoft (Netherlands) say their complement sampling algorithm beats any classical one in sample complexity, per a Physical Review Letters paper.

https://tech.slashdot.org/story/26/02/24/0047210/quantum-algorithm-beats-classical-tools-on-complement-sampling-tasks

#QuantumComputing #Quantinuum #QuSoft

Quantum Algorithm Beats Classical Tools On Complement Sampling Tasks - Slashdot

alternative_right shares a report from Phys.org: A team of researchers working at Quantinuum in the United Kingdom and QuSoft in the Netherlands has now developed a quantum algorithm that solves a specific sampling task -- known as complement sampling -- dramatically more efficiently than any classi...

Know Your "#Quantum:" Trapped ions can simulate topological Hamiltonians, but do not possess intrinsic topological protection. #IonQ #Quantinuum

Our new Helios quantum computer. Read all about it.
https://arxiv.org/abs/2511.05465

#quantum #quantumcomputing #quantinuum #helios #fuckyeah

Helios: A 98-qubit trapped-ion quantum computer

We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture. Helios features $^{137}$Ba$^{+}$ hyperfine qubits, all-to-all connectivity enabled by a rotatable ion storage ring connecting two quantum operation regions by a junction, speed improvements from parallelized operations, and a new software stack with real-time compilation of dynamic programs. Averaged over all operational zones in the system, we achieve average infidelities of $2.5(1)\times10^{-5}$ for single-qubit gates, $7.9(2)\times10^{-4}$ for two-qubit gates, and $4.8(6)\times10^{-4}$ for state preparation and measurement, none of which are fundamentally limited and likely able to be improved. These component infidelities are predictive of system-level performance in both random Clifford circuits and random circuit sampling, the latter demonstrating that Helios operates well beyond the reach of classical simulation and establishes a new frontier of fidelity and complexity for quantum computers.

arXiv.org

量子科技是什麼?比人工智慧(AI)更重要嗎?

BBC News 中文 2025-11-10 07:55:00 CST本文探討複雜難解的量子科技。其潛力巨大,有望在醫療、導航與最佳化等領域帶來革命。然而,其強大算力也對現行加密構成「Q日」威脅,引發重大資安疑慮,促使各界預先部署後量子加密技術。
https://www.thenewslens.com/article/260809
#人工智慧 #量子力學 #生成式AI #量子電腦 #量子晶片 #Quantinuum #量子羅盤 #谷歌 #微軟 #科技 #量子科技

量子科技是什麼?比人工智慧(AI)更重要嗎? - TNL The News Lens 關鍵評論網

本文探討複雜難解的量子科技。其潛力巨大,有望在醫療、導航與最佳化等領域帶來革命。然而,其強大算力也對現行加密構成「Q日」威脅,引發重大資安疑慮,促使各界預先部署後量子加密技術。

TNL The News Lens 關鍵評論網
Blir Google, Microsoft eller IBM den stora vinnaren i kvantdatorkapplöpningen? Svaret är kanske Quantinuum, som grundades så sent som 2021.#quantinuum #kvantdator #tech
Två speciella egenskaper gör den här kommersiella kvantdatorn unik
Två speciella egenskaper gör den här kommersiella kvantdatorn unik

Blir Google, Microsoft eller IBM den stora vinnaren i kvantdatorkapplöpningen? Svaret är kanske Quantinuum, som grundades så sent som 2021.

nyteknik
New quantum hardware puts the mechanics in quantum mechanics

As a test case, the machine was used to test a model of superconductivity.

Ars Technica

Lazy people in quantum computing use the term "fault-tolerant" to mean "I don't want to think about errors". Unfortunately for these magical thinkers, QEC will not make error rates go to zero, except in the asymptotic limit. For those of us who have to live with finite numbers like 7 or 144, logical operations on logical qubits will always have errors. If QEC is working correctly, these errors will be rarer than the physical ones, but also weirder. So you'd better understand them if you want your "fault-tolerant" quantum computer to actually work.

Fortunately my #quantinuum colleagues Matt Girling, Ben Criger, and Cristina Cirstoiu have put the effort in to start understanding a problem that many others don't even realise exists. Check it out:
https://arxiv.org/abs/2508.08188

#quantum #quantumcomputing #qec

Characterization of syndrome-dependent logical noise in detector regions

Characterizing how quantum error correction circuits behave under realistic hardware noise is essential for testing the premises that enable scalable fault tolerance. Logical error rates conditioned on syndrome outcomes are needed to enable noise-aware decoding and validate threshold-relevant assumptions. We introduce a protocol to directly estimate the logical Pauli channels (and pure errors) associated with detector regions formed of two or more syndrome extraction gadgets, conditioned on observing a particular parity in the syndrome outcomes. The method is SPAM-robust and most suitable for flag-based syndrome measurement schemes. For classical processing of the experimental data we implement a Bayesian modelling approach. We validate this new protocol on a small error-detecting code using Quantinuum H1-1, a trapped-ion device, and demonstrate that several noise diagnostic tests for fault tolerance improve significantly when using noise tailoring and mitigation strategies, such as swapped measurements for leakage protection, and Pauli frame randomization.

arXiv.org