Quantum Codes for Distributed Quantum Fault Sensing

Targeted recovery in modular quantum processors requires identifying the component affected by a fault. Independent qubits can monitor faults through repeated preparation and measurement. Bell-pair probes improve the guaranteed correct-site probability for unknown local channels, but require partners kept away from the fault. Can entanglement among exposed probes supply this advantage without protected storage? We establish a quantum-code criterion for optimal distributed fault sensing of one unknown local qubit channel with strength in a prescribed positive range. For one interrogation with zero false alarms and no background noise, suitable code states attain the optimal worst-case correct-site probability, improving on independent probes by 50% with every qubit exposed. Exact attainment is equivalent to mutually orthogonal input and single-qubit Pauli error subspaces. Pairwise entanglement gives no improvement, and entanglement depth at most four cannot exceed 95.54% of the optimum without protected ancillas. Approaching the optimum without protected ancillas also requires a number of probes proportional to the array size to participate in larger entangled factors. For a persistent fault under memoryless depolarizing background of fixed strength 0 < eta < 1, independent probes already attain the optimal logarithmic interrogation scaling at fixed success between zero and one and a positive false-alarm budget. In three 1000-site comparisons with specified readouts, an encoded-probe protocol certifies fewer interrogations than independent probes and only one more than optimally decoded ideal Bell pairs, while storing no protected qubits.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22530
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum Codes for Distributed Quantum Fault Sensing

Xiu-Hao Deng
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Quantum Codes for Distributed Quantum Fault Sensing

Xiu-Hao Deng
preprint en

Abstract

Targeted recovery in modular quantum processors requires identifying the component affected by a fault. Independent qubits can monitor faults through repeated preparation and measurement. Bell-pair probes improve the guaranteed correct-site probability for unknown local channels, but require partners kept away from the fault. Can entanglement among exposed probes supply this advantage without protected storage? We establish a quantum-code criterion for optimal distributed fault sensing of one unknown local qubit channel with strength in a prescribed positive range. For one interrogation with zero false alarms and no background noise, suitable code states attain the optimal worst-case correct-site probability, improving on independent probes by 50% with every qubit exposed. Exact attainment is equivalent to mutually orthogonal input and single-qubit Pauli error subspaces. Pairwise entanglement gives no improvement, and entanglement depth at most four cannot exceed 95.54% of the optimum without protected ancillas. Approaching the optimum without protected ancillas also requires a number of probes proportional to the array size to participate in larger entangled factors. For a persistent fault under memoryless depolarizing background of fixed strength 0 < eta < 1, independent probes already attain the optimal logarithmic interrogation scaling at fixed success between zero and one and a positive false-alarm budget. In three 1000-site comparisons with specified readouts, an encoded-probe protocol certifies fewer interrogations than independent probes and only one more than optimally decoded ideal Bell pairs, while storing no protected qubits.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon