Reduced filtering using classical control hierarchy with linear optimality for continuous quantum error correction

Continuous quantum error correction promises reduced thresholds and hardware overhead compared to the digital paradigm, but its complex model estimation has greatly reduced its practicality. We recast this problem as a classical control-theoretic state hierarchy made of an exact bilinear reduced model, an exact conditional filter, and standard estimation and feedback design. For any $[[n,k,d]]$ stabilizer code whose generators are all continuously monitored and which is driven by a single Pauli recovery channel, we prove that the exact filter closes at dimension $3\cdot2^{\,n-k-1}$. This dimension is set by the syndrome space instead of the Hilbert space and is minimal within invariant-subspace filtering. The reduced model exposes and corrects two failure mechanisms of the feedback loop. Strong monitoring damps the rotational partner through which the controller steers the stabilizer and injects back-action diffusion along the recovery path; lowering the measurement strength during correction raises the entanglement fidelity of partner-steering LQR control by $0.096$ in the three-qubit code with three monitored parities. Linearizing at the codespace leaves the syndrome uncontrollable, so the controller can stall; a gain designed at a shifted operating point removes this degeneracy. In the limit of zero measurement during correction, we prove that a syndrome-only filter is exact at every recovery boundary. The resulting committed-recovery controller needs only $2^{\,n-k}$ class probabilities and gives the highest entanglement fidelity compared among the methods tested in the literature, $0.947$ against $0.920$ for a measurement-based estimator protocol in the three-qubit bit-flip code, and $0.726$ vs at most $0.407$ for continuous controllers in the five-qubit perfect code.

Authors

Publication Details

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

Reduced filtering using classical control hierarchy with linear optimality for continuous quantum error correction

F. A. Cárdenas-López, Felix Motzoi, Manuel Guatto
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Reduced filtering using classical control hierarchy with linear optimality for continuous quantum error correction

F. A. Cárdenas-López, Felix Motzoi, Manuel Guatto
preprint en

Abstract

Continuous quantum error correction promises reduced thresholds and hardware overhead compared to the digital paradigm, but its complex model estimation has greatly reduced its practicality. We recast this problem as a classical control-theoretic state hierarchy made of an exact bilinear reduced model, an exact conditional filter, and standard estimation and feedback design. For any $[[n,k,d]]$ stabilizer code whose generators are all continuously monitored and which is driven by a single Pauli recovery channel, we prove that the exact filter closes at dimension $3\cdot2^{\,n-k-1}$. This dimension is set by the syndrome space instead of the Hilbert space and is minimal within invariant-subspace filtering. The reduced model exposes and corrects two failure mechanisms of the feedback loop. Strong monitoring damps the rotational partner through which the controller steers the stabilizer and injects back-action diffusion along the recovery path; lowering the measurement strength during correction raises the entanglement fidelity of partner-steering LQR control by $0.096$ in the three-qubit code with three monitored parities. Linearizing at the codespace leaves the syndrome uncontrollable, so the controller can stall; a gain designed at a shifted operating point removes this degeneracy. In the limit of zero measurement during correction, we prove that a syndrome-only filter is exact at every recovery boundary. The resulting committed-recovery controller needs only $2^{\,n-k}$ class probabilities and gives the highest entanglement fidelity compared among the methods tested in the literature, $0.947$ against $0.920$ for a measurement-based estimator protocol in the three-qubit bit-flip code, and $0.726$ vs at most $0.407$ for continuous controllers in the five-qubit perfect code.

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