First fault-tolerant quantum memory demonstration for a generalized superfast encoding
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 ≈ 4×10−3. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.
Related
- Encoding and Node Choices in Transversal Fault-Tolerant Distributed Quantum Computations: An Initial Study
- From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications
- Unitary fault-tolerant encoding of Pauli states in surface codes
- Demonstration of a mobile ion-trap quantum device
- Fault-tolerant quantum computation with static atomic buses
BibTeX
@misc{brown2026first,
title = {{First fault-tolerant quantum memory demonstration for a generalized superfast encoding}},
author = {James Brown and Kenny Heitritter},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08957},
eprint = {2609.08957},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08957},
}
RIS
TY - UNPB
TI - First fault-tolerant quantum memory demonstration for a generalized superfast encoding
AU - James Brown
AU - Kenny Heitritter
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08957
UR - https://arxiv.org/abs/2609.08957
AB - 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 ≈ 4×10^−3. This is, to our knowledge, the first fault-tolerant quantum-memory characterization of a fermion-mapping with threshold-like scaling.
ER -