Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.16751

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

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

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2611.16751

Related papers

Efficient feedback controllers for continuous-time quantum error correction

Bradley A. Chase, Andrew J. Landahl, J. M. Geremia

We present an efficient approach to continuous-time quantum error correction that extends the low-dimensional quantum filtering methodology developed by van Handel and Mabuchi [e-print arXiv:quant-ph/0511221] to include error recovery operations in the form of real-time quantum feedback. We expect this paradigm to be useful for systems in which error recovery operations cannot be applied instantaneously. While we could not find an exact low-dimensional filter that combined both continuous syndrome measurement and a feedback Hamiltonian appropriate for error recovery, we developed an approximate reduced-dimensional model to do so. Simulations of the five-qubit code subjected to the symmetric depolarizing channel suggests that error correction based on our approximate filter performs essentially identically to correction based on an exact quantum dynamical model.

arXiv:0711.0689•Physical Review A•Mar 5, 2008•32 citations

Efficient feedback controllers for continuous-time quantum error correction

Andrew J. Landahl, Bradley A. Chase, J. M. Geremia

We present an efficient approach to continuous-time quantum error correction that extends the low-dimensional quantum filtering methodology developed by van Handel and Mabuchi [quantph/0511221 (2005)] to include error recovery operations in the form of real-time quantum feedback. We expect this paradigm to be useful for systems in which error recovery operations cannot be applied instantaneously. While we could not find an exact low-dimensional filter that combined both continuous syndrome measurement and a feedback Hamiltonian appropriate for error recovery, we developed an approximate reduced-dimensional model to do so. Simulations of the five-qubit code subjected to the symmetric depolarizing channel suggests that error correction based on our approximate filter performs essentially identically to correction based on an exact quantum dynamical model.

Bulletin of the American Physical Society•Mar 14, 2008•1 citation

Measurement-based quantum feedback controls for quantum computation

Song Zhang

The advance of experimental techniques in circuit quantum electrodynamics over last decadehas made it possible to monitor the evolution of qubits under continuous measurements in\nreal time . This kind of measurements, as compared to the discrete ones, provides a stream\nof information for feedback to alter the system's quantum dynamics continuously in a desired\nmanner, thus allowing broader possibilities. We obtain the information at a cost, the backaction on the states. However, the back-action turns out not to be just something disturbing \nand harmful to the control but instead can be harnessed, together with the control, to steer the system to our targets. \nThis thesis discusses one such application, namely to use measurements to create entanglement from remote qubits under locally optimal control. It is illustrated that by carefully designing symmetric measurement and feedback operators, we can construct efficient Markovian or non-Markovian protocols which generate N-qubit W,\ngeneral Dicke and Greenberger-Horne-Zeilinger states with high fidelity above 94% up to\nN = 100. In some cases, the fidelity even approaches unity. Following that, we describe how\nto take advantages of the continuous stream of information to protect the unitary dynamics of\na quantum system subject to noises. We develop a practical protocol for continuous operation\nof a quantum error correcting code for protection of coherent evolution due to an encoded\nHamiltonian against environmental errors, using the three qubit bit-flip code and bit-flip\nerrors as a canonical example. We demonstrate, for both quantum memory and adiabatic\nHamiltonians, that the protocol, once optimized, can significantly reduce logical errors with\na performance which is close to the theoretical limit of the bit-flip code's capability. In the\nadiabatic Hamiltonian case, we also propose some novel correction operators instead of the\nconventional ones to further reduce the logical errors.

•Jan 1, 2020•1 citation

Continuous-time Quantum Error Correction with Noise-assisted Quantum Feedback

Gerardo Cardona, Alain Sarlette, Pierre Rouchon

We address the standard quantum error correction using the three-qubit bit-flip code, yet in continuous-time. This entails rendering a target manifold of quantum states globally attractive. Previous feedback designs could feature spurious equilibria, or resort to discrete kicks pushing the system away from these equilibria to ensure global asymptotic stability. We present a new approach that consists of introducing controls driven by Brownian motions. Unlike the previous methods, the resulting closed-loop dynamics can be shown to stabilize the target manifold exponentially. We further present a reduced-order filter formulation with classical probabilities. The exponential property is important to quantify the protection induced by the closed-loop error-correction dynamics against disturbances. We study numerically the performance of this control law and of the reduced filter.

arXiv:1902.00115•IFAC-PapersOnLine•Jan 1, 2019•14 citations

Always-On Quantum Error Tracking with Continuous Parity Measurements

Razieh Mohseninia, Jing Yang, Irfan Siddiqi +2 more

We investigate quantum error correction using continuous parity measurements to correct bit-flip errors with the three-qubit code. Continuous monitoring of errors brings the benefit of a continuous stream of information, which facilitates passive error tracking in real time. It reduces overhead from the standard gate-based approach that periodically entangles and measures additional ancilla qubits. However, the noisy analog signals from continuous parity measurements mandate more complicated signal processing to interpret syndromes accurately. We analyze the performance of several practical filtering methods for continuous error correction and demonstrate that they are viable alternatives to the standard ancilla-based approach. As an optimal filter, we discuss an unnormalized (linear) Bayesian filter, with improved computational efficiency compared to the related Wonham filter introduced by Mabuchi [New J. Phys. 11, 105044 (2009)]. We compare this optimal continuous filter to two practical variations of the simplest periodic boxcar-averaging-and-thresholding filter, targeting real-time hardware implementations with low-latency circuitry. As variations, we introduce a non-Markovian ``half-boxcar'' filter and a Markovian filter with a second adjustable threshold; these filters eliminate the dominant source of error in the boxcar filter, and compare favorably to the optimal filter. For each filter, we derive analytic results for the decay in average fidelity and verify them with numerical simulations.

arXiv:1907.08882•Quantum•Nov 4, 2020•22 citations

Channel-Adapted Quantum Error Correction

Andrew S. Fletcher

Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.

arXiv:0706.3400•Jun 22, 2007•28 citations
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]][[n,k,d]][[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⋅2 n−k−13\cdot2^{\,n-k-1}3⋅2n−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.0960.0960.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−k2^{\,n-k}2n−k class probabilities and gives the highest entanglement fidelity compared among the methods tested in the literature, 0.9470.9470.947 against 0.9200.9200.920 for a measurement-based estimator protocol in the three-qubit bit-flip code, and 0.7260.7260.726 vs at most 0.4070.4070.407 for continuous controllers in the five-qubit perfect code.
We present an efficient approach to continuous-time quantum error correction that extends the low-dimensional quantum filtering methodology developed by van Handel and Mabuchi [e-print arXiv:quant-ph/0511221] to include error recovery operations in the form of real-time quantum feedback. We expect this paradigm to be useful for systems in which error recovery operations cannot be applied instantaneously. While we could not find an exact low-dimensional filter that combined both continuous syndrome measurement and a feedback Hamiltonian appropriate for error recovery, we developed an approximate reduced-dimensional model to do so. Simulations of the five-qubit code subjected to the symmetric depolarizing channel suggests that error correction based on our approximate filter performs essentially identically to correction based on an exact quantum dynamical model.
We present an efficient approach to continuous-time quantum error correction that extends the low-dimensional quantum filtering methodology developed by van Handel and Mabuchi [quantph/0511221 (2005)] to include error recovery operations in the form of real-time quantum feedback. We expect this paradigm to be useful for systems in which error recovery operations cannot be applied instantaneously. While we could not find an exact low-dimensional filter that combined both continuous syndrome measurement and a feedback Hamiltonian appropriate for error recovery, we developed an approximate reduced-dimensional model to do so. Simulations of the five-qubit code subjected to the symmetric depolarizing channel suggests that error correction based on our approximate filter performs essentially identically to correction based on an exact quantum dynamical model.
The advance of experimental techniques in circuit quantum electrodynamics over last decadehas made it possible to monitor the evolution of qubits under continuous measurements in\nreal time . This kind of measurements, as compared to the discrete ones, provides a stream\nof information for feedback to alter the system's quantum dynamics continuously in a desired\nmanner, thus allowing broader possibilities. We obtain the information at a cost, the backaction on the states. However, the back-action turns out not to be just something disturbing \nand harmful to the control but instead can be harnessed, together with the control, to steer the system to our targets. \nThis thesis discusses one such application, namely to use measurements to create entanglement from remote qubits under locally optimal control. It is illustrated that by carefully designing symmetric measurement and feedback operators, we can construct efficient Markovian or non-Markovian protocols which generate N-qubit W,\ngeneral Dicke and Greenberger-Horne-Zeilinger states with high fidelity above 94% up to\nN = 100. In some cases, the fidelity even approaches unity. Following that, we describe how\nto take advantages of the continuous stream of information to protect the unitary dynamics of\na quantum system subject to noises. We develop a practical protocol for continuous operation\nof a quantum error correcting code for protection of coherent evolution due to an encoded\nHamiltonian against environmental errors, using the three qubit bit-flip code and bit-flip\nerrors as a canonical example. We demonstrate, for both quantum memory and adiabatic\nHamiltonians, that the protocol, once optimized, can significantly reduce logical errors with\na performance which is close to the theoretical limit of the bit-flip code's capability. In the\nadiabatic Hamiltonian case, we also propose some novel correction operators instead of the\nconventional ones to further reduce the logical errors.
We address the standard quantum error correction using the three-qubit bit-flip code, yet in continuous-time. This entails rendering a target manifold of quantum states globally attractive. Previous feedback designs could feature spurious equilibria, or resort to discrete kicks pushing the system away from these equilibria to ensure global asymptotic stability. We present a new approach that consists of introducing controls driven by Brownian motions. Unlike the previous methods, the resulting closed-loop dynamics can be shown to stabilize the target manifold exponentially. We further present a reduced-order filter formulation with classical probabilities. The exponential property is important to quantify the protection induced by the closed-loop error-correction dynamics against disturbances. We study numerically the performance of this control law and of the reduced filter.
We investigate quantum error correction using continuous parity measurements to correct bit-flip errors with the three-qubit code. Continuous monitoring of errors brings the benefit of a continuous stream of information, which facilitates passive error tracking in real time. It reduces overhead from the standard gate-based approach that periodically entangles and measures additional ancilla qubits. However, the noisy analog signals from continuous parity measurements mandate more complicated signal processing to interpret syndromes accurately. We analyze the performance of several practical filtering methods for continuous error correction and demonstrate that they are viable alternatives to the standard ancilla-based approach. As an optimal filter, we discuss an unnormalized (linear) Bayesian filter, with improved computational efficiency compared to the related Wonham filter introduced by Mabuchi [New J. Phys. 11, 105044 (2009)]. We compare this optimal continuous filter to two practical variations of the simplest periodic boxcar-averaging-and-thresholding filter, targeting real-time hardware implementations with low-latency circuitry. As variations, we introduce a non-Markovian ``half-boxcar'' filter and a Markovian filter with a second adjustable threshold; these filters eliminate the dominant source of error in the boxcar filter, and compare favorably to the optimal filter. For each filter, we derive analytic results for the decay in average fidelity and verify them with numerical simulations.
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.