Skip to content
Preprint

First fault-tolerant quantum memory demonstration for a generalized superfast encoding

Sep 2026 · 0 citations · 29 references
Physics

Abstract

The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance $d$ constant stabilizer-weight GSE where each of $N$ modes is assigned a $d$-qubit block arranged on a ring. The resulting stabilizer generators have constant weight 4 or 6 for any even distance $d$. Furthermore, the full stabilizer set of this construction can always be partitioned into four qubit-wise commuting groups, which enables compact syndrome-extraction scheduling. We simulate quantum memory experiments under circuit-level depolarizing noise for two instances of this code, $[[48,8,6]]$ and $[[64,8,8]]$ and the threshold is observed to be $\approx 4\times10^{-3}$. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.

View source

Similar papers

Preprint Sep 2026

Experimental validation of a compact fault-tolerant architecture for trapped ions

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, a...

Noah F. Berthusen, Ali Lavasani, Asmae Benhemou et al. · 0 citations
Preprint Oct 2026

Single-Shot Error Correction at Optimal Spacetime Cost

Recent work established that, for independent erasures, storing $K$ logical qubits for $S$ time steps with error at most $\varepsilon$ requires a spacetime cost of $\Omega(S(K+\log(S/\varepsilon)))$. A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be ac...

Kishor Bharti, Tobias Haug, Derek Khu et al. · 0 citations
Preprint Sep 2026

Syndrome measurements enable deterministic fault-tolerant $T$ gates

Non-Clifford gates are essential for universal quantum computation, yet implementing them fault-tolerantly remains a central challenge for stabilizer codes. Here, we show how a syndrome degree of freedom can mediate a logical non-Clifford gate. Releasing one stabilizer check makes an additional logical qubit available...

Kishor Bharti, Tobias Haug, Andrew Tanggara · 0 citations
Preprint Sep 2026

Error Correction in a Distributed Quantum Computer

The first experimental demonstration of distributed quantum error detection and correction is reported, providing an experimental foundation for quantum error correction (QEC) across modular quantum architectures.

E. M. Ainley, A. Agrawal, T. Araki et al. · 2 citations
Preprint Sep 2026

Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing

This work introduces a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer.

Jian Gao, Xiao Yuan, Yuan Yao · 0 citations
Preprint Sep 2026

Modular fault-tolerant quantum computing on a non-CSS code

This work implements for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer, and demonstrates the smallest quantum error-correcting (QEC) code capable of cor...

R. Freund, F. Butt, Cesar Benito et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.