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:quant-ph/0511221

Optimal error tracking via quantum coding and continuous syndrome measurement

Ramon van Handel, Hideo Mabuchi

Published Nov 22, 2005• 26 citations
arXivHTMLPDF

Abstract

We revisit a scenario of continuous quantum error detection proposed by Ahn, Doherty and Landahl [Phys. Rev. A 65, 042301 (2002)] and construct optimal filters for tracking accumulative errors. These filters turn out to be of a canonical form from hybrid control theory; we numerically assess their performance for the bit-flip and five-qubit codes. We show that a tight upper bound on the stochastic decay of encoded fidelity can be computed from the measurement records. Our results provide an informative case study in decoherence suppression with finite-strength measurement.

DOI
10.48550/arxiv.quant-ph/0511221

Related papers

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

Continuous quantum error correction as classical hybrid control

Hideo Mabuchi

The standard formulation of quantum error correction (QEC) comprises repeated cycles of error estimation and corrective intervention in the free dynamics of a qubit register. QEC can thus be seen as a form of feedback control, and it is of interest to seek a deeper understanding of the connection between the associated theories. Here we present a focused case study within this broad program, connecting continuous QEC with elements of hybrid control theory. We show that canonical methods of the latter engineering discipline, such as recursive filtering and dynamic programming approaches to solving the optimal control problem, can be applied fruitfully in the design of separated controller structures for quantum memories based on coding and continuous syndrome measurement.

New Journal of Physics•Oct 30, 2009•40 citations

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

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

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:2611.16751•Nov 12, 2026•0 citations

Continuous quantum error correction for evolution under time-dependent Hamiltonians

Juan Atalaya, Shuya Zhang, Murphy Yuezhen Niu +4 more

We develop a protocol for continuous operation of a quantum error correcting code for protection of coherent evolution due to an encoded Hamiltonian against environmental errors, using the three-qubit bit-flip code and bit-flip errors as a canonical example. To detect errors in real time, we filter the output signals from continuous measurement of the error syndrome operators and use a double thresholding protocol for error diagnosis, while correction of errors is done as in the conventional operation. We optimize our continuous operation protocol for evolution under quantum memory and under quantum annealing, by maximizing the fidelity between the target and actual logical states at a specified final time. In the case of quantum memory, we show that our continuous operation protocol yields a logical error rate that is slightly larger than the one obtained from using the optimal Wonham filter for error diagnosis while being simpler to implement. For quantum annealing, we show that our continuous quantum error correction protocol can significantly reduce the final logical state infidelity when the continuous measurements are sufficiently strong relative to the strength of the time-dependent Hamiltonian. We also show that this continuous quantum error correction protocol can reduce the time-to-solution relative to the value obtained from a classical parallelization scheme. These results suggest that a continuous implementation is suitable for quantum error correction in the presence of encoded time-dependent Hamiltonians, opening the possibility of many applications in quantum simulation and quantum annealing.

arXiv:2003.11248•Physical Review A•Apr 5, 2021•23 citations

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

Access Resources and Stability of Error-Correction Capabilities in Continuous Strategic Codes

He Wang

Continuous quantum error correction depends on which parts of a measurement record remain available to the controller at recovery. We study this temporal access using continuous strategic codes, formulated as open continuous process tensors contracted with causal instruments and conditional recovery. For monitored stabilizer codes, a common-optimal-correction criterion identifies when records can be merged without loss and yields a factorization for separated CSS inference. Terminal decision labels and causal persistent memory carry different costs: five persistent classical states reach the complete-record optimum in a finite-strength counting model, whereas its two-window diffusive counterpart has nine terminal decision labels and requires unbounded memory for exact causal recovery. Uniform lower and constructive upper bounds establish an optimal fidelity deficit of order $m^{-2}$ for $m$ persistent states in the diffusive model. Counting and diffusive stability bounds translate open-process approximation into guarantees for deployed-controller performance and retained access advantages, quantified by explicit quantizers and model-mismatch curves. The same process--instrument framework connects storage with persistent environments and irreversible noise to spacetime interrogation and record-selected paths for a logical $T$ gate. These results specify which record distinctions recovery needs, the memory cost of approximating them, and the logical protection retained under model error.

quant-pharXiv:2611.01592•Nov 3, 2026•0 citations
We revisit a scenario of continuous quantum error detection proposed by Ahn, Doherty and Landahl [Phys. Rev. A 65, 042301 (2002)] and construct optimal filters for tracking accumulative errors. These filters turn out to be of a canonical form from hybrid control theory; we numerically assess their performance for the bit-flip and five-qubit codes. We show that a tight upper bound on the stochastic decay of encoded fidelity can be computed from the measurement records. Our results provide an informative case study in decoherence suppression with finite-strength measurement.
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.
The standard formulation of quantum error correction (QEC) comprises repeated cycles of error estimation and corrective intervention in the free dynamics of a qubit register. QEC can thus be seen as a form of feedback control, and it is of interest to seek a deeper understanding of the connection between the associated theories. Here we present a focused case study within this broad program, connecting continuous QEC with elements of hybrid control theory. We show that canonical methods of the latter engineering discipline, such as recursive filtering and dynamic programming approaches to solving the optimal control problem, can be applied fruitfully in the design of separated controller structures for quantum memories based on coding and continuous syndrome measurement.
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 develop a protocol for continuous operation of a quantum error correcting code for protection of coherent evolution due to an encoded Hamiltonian against environmental errors, using the three-qubit bit-flip code and bit-flip errors as a canonical example. To detect errors in real time, we filter the output signals from continuous measurement of the error syndrome operators and use a double thresholding protocol for error diagnosis, while correction of errors is done as in the conventional operation. We optimize our continuous operation protocol for evolution under quantum memory and under quantum annealing, by maximizing the fidelity between the target and actual logical states at a specified final time. In the case of quantum memory, we show that our continuous operation protocol yields a logical error rate that is slightly larger than the one obtained from using the optimal Wonham filter for error diagnosis while being simpler to implement. For quantum annealing, we show that our continuous quantum error correction protocol can significantly reduce the final logical state infidelity when the continuous measurements are sufficiently strong relative to the strength of the time-dependent Hamiltonian. We also show that this continuous quantum error correction protocol can reduce the time-to-solution relative to the value obtained from a classical parallelization scheme. These results suggest that a continuous implementation is suitable for quantum error correction in the presence of encoded time-dependent Hamiltonians, opening the possibility of many applications in quantum simulation and quantum annealing.
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.
Continuous quantum error correction depends on which parts of a measurement record remain available to the controller at recovery. We study this temporal access using continuous strategic codes, formulated as open continuous process tensors contracted with causal instruments and conditional recovery. For monitored stabilizer codes, a common-optimal-correction criterion identifies when records can be merged without loss and yields a factorization for separated CSS inference. Terminal decision labels and causal persistent memory carry different costs: five persistent classical states reach the complete-record optimum in a finite-strength counting model, whereas its two-window diffusive counterpart has nine terminal decision labels and requires unbounded memory for exact causal recovery. Uniform lower and constructive upper bounds establish an optimal fidelity deficit of order m−2m^{-2}m−2 for mmm persistent states in the diffusive model. Counting and diffusive stability bounds translate open-process approximation into guarantees for deployed-controller performance and retained access advantages, quantified by explicit quantizers and model-mismatch curves. The same process--instrument framework connects storage with persistent environments and irreversible noise to spacetime interrogation and record-selected paths for a logical TTT gate. These results specify which record distinctions recovery needs, the memory cost of approximating them, and the logical protection retained under model error.