Error-Corrected QRAM Queries with One-Fault-Tolerant \texttt{CSWAP} Gates
Abstract
Quantum random-access memory (QRAM) enables coherent queries to classical data. However, the O(N) qubits required for a memory with N=2n addresses make QRAM appear vulnerable to noise. Though bucket-brigade routing provides intrinsic noise resilience to reduce the error in QRAM, improving the fidelity of QRAM queries is still an important and challenging problem. We introduce a low-overhead protection framework for bucket-brigade QRAM with two complementary components. First, we propose a one-fault-tolerant repeat-until-success logical controlled-SWAP gate using the [[4,2,2]] code under erasure noise channel. Interleaved erasure checks and local recovery correct every single erasure, so the leading logical failure probability is second order in the physical erasure error rates. Second, we exploit validity constraints of bucket-brigade routing to define local parity checks directly on the router states, without adding extra data qubits to create code redundancy. Under bit-flip noise, minimum-weight perfect matching with noiseless syndrome measurements corrects single interior faults, while open spatial boundaries retain a first-order contribution in the residual bit-flip rate. Monte Carlo simulations confirm quadratic suppression for the protected controlled-SWAP and improved depth scaling for decoded QRAM router-state snapshots. The two codes admit a concatenated realization in which the inner code supplies erasure protection and the outer code optionally corrects interior logical bit flips. Together, these results show how routing constraints and a protected non-Clifford routing gate can improve QRAM reliability under biased and erasure-dominant noise.
Related
- Fault-tolerant execution of error-corrected quantum algorithms
- Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection
- Fault-tolerant quantum error correction for constant-excitation stabilizer codes under coherent noise
- Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
- Standard estimators cannot represent fault-tolerant workloads at measured error rates: evaluated, evidence-based uncertainty for quantum resource estimation
BibTeX
@misc{xu2026errorcorrected,
title = {{Error-Corrected QRAM Queries with One-Fault-Tolerant \textttCSWAP Gates}},
author = {Shifan Xu and Connor T. Hann and Nathan Wiebe and Steven M. Girvin and Yongshan Ding},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17185},
eprint = {2610.17185},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17185},
}
RIS
TY - UNPB
TI - Error-Corrected QRAM Queries with One-Fault-Tolerant \texttt{CSWAP} Gates
AU - Shifan Xu
AU - Connor T. Hann
AU - Nathan Wiebe
AU - Steven M. Girvin
AU - Yongshan Ding
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.17185
UR - https://arxiv.org/abs/2610.17185
AB - Quantum random-access memory (QRAM) enables coherent queries to classical data. However, the O(N) qubits required for a memory with N=2^n addresses make QRAM appear vulnerable to noise. Though bucket-brigade routing provides intrinsic noise resilience to reduce the error in QRAM, improving the fidelity of QRAM queries is still an important and challenging problem. We introduce a low-overhead protection framework for bucket-brigade QRAM with two complementary components. First, we propose a one-fault-tolerant repeat-until-success logical controlled-SWAP gate using the [[4,2,2]] code under erasure noise channel. Interleaved erasure checks and local recovery correct every single erasure, so the leading logical failure probability is second order in the physical erasure error rates. Second, we exploit validity constraints of bucket-brigade routing to define local parity checks directly on the router states, without adding extra data qubits to create code redundancy. Under bit-flip noise, minimum-weight perfect matching with noiseless syndrome measurements corrects single interior faults, while open spatial boundaries retain a first-order contribution in the residual bit-flip rate. Monte Carlo simulations confirm quadratic suppression for the protected controlled-SWAP and improved depth scaling for decoded QRAM router-state snapshots. The two codes admit a concatenated realization in which the inner code supplies erasure protection and the outer code optionally corrects interior logical bit flips. Together, these results show how routing constraints and a protected non-Clifford routing gate can improve QRAM reliability under biased and erasure-dominant noise.
ER -