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

IEEE Conference on Decision and Control (CDC)

Exact solution for the max-min quantum error recovery problem

Naoki Yamamoto

Published Dec 1, 2009• 4 citations
Publisher

Abstract

This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel, while the minimum is taken over all possible pure input states. In general, this kind of max-min problem is cast as a non-convex optimization problem and is thus very hard to solve even with the aid of high-quality computational tools. Nevertheless, it is shown that, when the input takes a qubit, the problem is exactly convex for any size of error process. The Sum of Squares (SOS) characterization of a specific class of polynomial functions plays a crucial role in deriving this result.

DOI
10.1109/cdc.2009.5400142

Related papers

Optimum quantum error recovery using semidefinite programming

Andrew S. Fletcher, Peter W. Shor, Moe Z. Win

Quantum error correction (QEC) is an essential element of physical quantum information processing systems. Most QEC efforts focus on extending classical error correction schemes to the quantum regime. The input to a noisy system is embedded in a coded subspace, and error recovery is performed via an operation designed to perfectly correct for a set of errors, presumably a large subset of the physical noise process. In this paper, we examine the choice of recovery operation. Rather than seeking perfect correction on a subset of errors, we seek a recovery operation to maximize the entanglement fidelity for a given input state and noise model. In this way, the recovery operation is optimal for the given encoding and noise process. This optimization is shown to be calculable via a semidefinite program, a well-established form of convex optimization with efficient algorithms for its solution. The error recovery operation may also be interpreted as a combining operation following a quantum spreading channel, thus providing a quantum analogy to the classical diversity combining operation.

arXiv:quant-ph/0606035•Physical Review A•Jan 31, 2007•124 citations

Computational approach to quantum encoder design for purity optimization

Naoki Yamamoto, Maryam Fazel

In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace of dimension 2. Moreover, this algorithm is easily extended to cover the general class of codespaces, in which case the solution is suboptimal in the sense that the suboptimized output purity serves as a lower bound of the exact optimal purity. The algorithm consists of a sequence of semidefinite programmings and can be performed easily. Two typical quantum error channels are investigated to illustrate the effectiveness of our method.

arXiv:quant-ph/0606106•Physical Review A•Jul 26, 2007•10 citations

Quantum error precompensation for quantum noisy channels

Chengjie Zhang, Liangsheng Li, Guodong Lu +2 more

Most previous efforts on quantum error correction focused on either extending classical error-correction schemes to the quantum regime by performing a perfect correction on a subset of errors or seeking a recovery operation to maximize the fidelity between an input state and its corresponding output state of a noisy channel. There are few results concerning quantum error precompensation. Here we design an error-precompensated input state for an arbitrary quantum noisy channel and a given target output state. By following a procedure, the required input state, if it exists, can be analytically obtained in single-partite systems. Furthermore, we also present semidefinite programs to numerically obtain the error-precompensated input states with maximal fidelities between the target state and the output state. The numerical results coincide with the analytical results.

arXiv:2309.01434•Physical Review A•Oct 25, 2022•3 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

Fidelity Determines the Minimum Error of Quantum Recovery

Dario Picozzi

Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor $0<ε<1$, the operational optimizers' sensitivity to residual unitary errors of size $s$ is at worst of order $s^{4/3}$, while the canonical polar correction has quadratic sensitivity.

arXiv:2611.07344•Nov 5, 2026•0 citations

Optimal recovery for quantum error correction

Sun Woo P. Kim

The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds $p_\mathrm{th}^\mathrm{opt}$. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining $p_\mathrm{th}^\mathrm{opt}$ without explicit optimisation. In contrast, previous works give a lower bound on $p_\mathrm{th}^\mathrm{opt}$ by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound $p^\mathrm{opt}_\mathrm{th}$. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is $p_\mathrm{th}^\mathrm{opt}$. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams.

quant-pharXiv:2603.06520•Mar 6, 2026•6 citations
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel, while the minimum is taken over all possible pure input states. In general, this kind of max-min problem is cast as a non-convex optimization problem and is thus very hard to solve even with the aid of high-quality computational tools. Nevertheless, it is shown that, when the input takes a qubit, the problem is exactly convex for any size of error process. The Sum of Squares (SOS) characterization of a specific class of polynomial functions plays a crucial role in deriving this result.
Quantum error correction (QEC) is an essential element of physical quantum information processing systems. Most QEC efforts focus on extending classical error correction schemes to the quantum regime. The input to a noisy system is embedded in a coded subspace, and error recovery is performed via an operation designed to perfectly correct for a set of errors, presumably a large subset of the physical noise process. In this paper, we examine the choice of recovery operation. Rather than seeking perfect correction on a subset of errors, we seek a recovery operation to maximize the entanglement fidelity for a given input state and noise model. In this way, the recovery operation is optimal for the given encoding and noise process. This optimization is shown to be calculable via a semidefinite program, a well-established form of convex optimization with efficient algorithms for its solution. The error recovery operation may also be interpreted as a combining operation following a quantum spreading channel, thus providing a quantum analogy to the classical diversity combining operation.
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace of dimension 2. Moreover, this algorithm is easily extended to cover the general class of codespaces, in which case the solution is suboptimal in the sense that the suboptimized output purity serves as a lower bound of the exact optimal purity. The algorithm consists of a sequence of semidefinite programmings and can be performed easily. Two typical quantum error channels are investigated to illustrate the effectiveness of our method.
Most previous efforts on quantum error correction focused on either extending classical error-correction schemes to the quantum regime by performing a perfect correction on a subset of errors or seeking a recovery operation to maximize the fidelity between an input state and its corresponding output state of a noisy channel. There are few results concerning quantum error precompensation. Here we design an error-precompensated input state for an arbitrary quantum noisy channel and a given target output state. By following a procedure, the required input state, if it exists, can be analytically obtained in single-partite systems. Furthermore, we also present semidefinite programs to numerically obtain the error-precompensated input states with maximal fidelities between the target state and the output state. The numerical results coincide with the analytical results.
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.
Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor 0<ε<10<ε<10<ε<1, the operational optimizers' sensitivity to residual unitary errors of size sss is at worst of order s4/3s^{4/3}s4/3, while the canonical polar correction has quadratic sensitivity.
The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds pthoptp_\mathrm{th}^\mathrm{opt}pthopt​. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining pthoptp_\mathrm{th}^\mathrm{opt}pthopt​ without explicit optimisation. In contrast, previous works give a lower bound on pthoptp_\mathrm{th}^\mathrm{opt}pthopt​ by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound pthoptp^\mathrm{opt}_\mathrm{th}pthopt​. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is pthoptp_\mathrm{th}^\mathrm{opt}pthopt​. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams.