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:2309.01434 · Physical Review A

Quantum error precompensation for quantum noisy channels

Chengjie Zhang, Liangsheng Li, Guodong Lu, Haidong Yuan, Runyao Duan

Published Oct 25, 2022• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.106.042440

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

Robust Quantum Error Correction via Convex Optimization

Robert L. Kosut, Alireza Shabani, Daniel A. Lidar

We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory numerically for optimized 5-qubit codes, using the standard [5,1,3] code as a benchmark. Our optimized encoding and recovery yields fidelities that are uniformly higher by 1-2 orders of magnitude against random unitary weight-2 errors compared to the [5,1,3] code with standard recovery.

arXiv:quant-ph/0703274•Physical Review Letters•Jan 16, 2008•72 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

Exact solution for the max-min quantum error recovery problem

Naoki Yamamoto

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.

IEEE Conference on Decision and Control (CDC)•Dec 1, 2009•4 citations

QUANTUM ERROR CORRECTION WITHOUT MEASUREMENT AND AN EFFICIENT RECOVERY OPERATION

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon +2 more

1. IntroductionQuantum system is vulnerable to disturbance from the external environment, which leads todecoherence in the system. We have to overcome this difficulty to realize a working quanutumcomputer and a dependable quantum information processing. Quantum error correction (QEC)[1, 2, 3] is one of the most promising candidates for overcoming decoherence.QEC proposals to date are separated roughly into two classes, one employs extra ancilla qubitsfor error syndrome readout while the other, called operator quantum error correction (OQEC)employs a higher rank projection operator. However, the schemes have not been built in actualquantum computing or quantum information processing so far. This is dueto the following obstaclesinherent in these QECs; the syndrome must be read out by introducing ancilla qubits duringcomputing/information processing in the former case, while realization of a high-rank projectionoperator is physically challenging in the latter case.It was shown in [4] that for some quantum channels there exist different QECs in which nosyndrome measurements, no ancillas and no projection operators were required. Recovery operationand decoding operation are combined into a single unitary operation and the output state is a directproductof a decoded qubitstate and an ancilla state. Aqubit state isreproducedwithout recoveringthe codeword and, moreover, the projection operation is automatically built in our output state.The purpose of this paper is to extend the results in [4] to general quantum channels. We showthat for any quantum channel there is a unitary recovery operation, with which the output stateis a tensor product of decoded qubit state and an ancilla state. As a result, a decoding scheme canbe done by a unitary gate followed by a partial trace operation.The rest of the paper is organized as follows. We introduce the basic notions of OQEC andthen prove the main theorem in Section 2. We also give simple examples demonstrating our resultand a simplified proof of a theorem given in [2] illustrating that our recovery channel can be usedto do correction for many other channels related to ours. Section 3 is devoted to summary anddiscussions.

•Feb 8, 2011•1 citation

Quantum Error Correction via Convex Optimization

Robert L. Kosut, Daniel A. Lidar

We show that the problem of designing a quantum information error correcting procedure can be cast as a bi-convex optimization problem, iterating between encoding and recovery, each being a semidefinite program. For a given encoding operator the problem is convex in the recovery operator. For a given method of recovery, the problem is convex in the encoding scheme. This allows us to derive new codes that are locally optimal. We present examples of such codes that can handle errors which are too strong for codes derived by analogy to classical error correction techniques. 1

•Jun 9, 2006•35 citations
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 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.
We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory numerically for optimized 5-qubit codes, using the standard [5,1,3] code as a benchmark. Our optimized encoding and recovery yields fidelities that are uniformly higher by 1-2 orders of magnitude against random unitary weight-2 errors compared to the [5,1,3] code with standard recovery.
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.
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.
1. IntroductionQuantum system is vulnerable to disturbance from the external environment, which leads todecoherence in the system. We have to overcome this difficulty to realize a working quanutumcomputer and a dependable quantum information processing. Quantum error correction (QEC)[1, 2, 3] is one of the most promising candidates for overcoming decoherence.QEC proposals to date are separated roughly into two classes, one employs extra ancilla qubitsfor error syndrome readout while the other, called operator quantum error correction (OQEC)employs a higher rank projection operator. However, the schemes have not been built in actualquantum computing or quantum information processing so far. This is dueto the following obstaclesinherent in these QECs; the syndrome must be read out by introducing ancilla qubits duringcomputing/information processing in the former case, while realization of a high-rank projectionoperator is physically challenging in the latter case.It was shown in [4] that for some quantum channels there exist different QECs in which nosyndrome measurements, no ancillas and no projection operators were required. Recovery operationand decoding operation are combined into a single unitary operation and the output state is a directproductof a decoded qubitstate and an ancilla state. Aqubit state isreproducedwithout recoveringthe codeword and, moreover, the projection operation is automatically built in our output state.The purpose of this paper is to extend the results in [4] to general quantum channels. We showthat for any quantum channel there is a unitary recovery operation, with which the output stateis a tensor product of decoded qubit state and an ancilla state. As a result, a decoding scheme canbe done by a unitary gate followed by a partial trace operation.The rest of the paper is organized as follows. We introduce the basic notions of OQEC andthen prove the main theorem in Section 2. We also give simple examples demonstrating our resultand a simplified proof of a theorem given in [2] illustrating that our recovery channel can be usedto do correction for many other channels related to ours. Section 3 is devoted to summary anddiscussions.
We show that the problem of designing a quantum information error correcting procedure can be cast as a bi-convex optimization problem, iterating between encoding and recovery, each being a semidefinite program. For a given encoding operator the problem is convex in the recovery operator. For a given method of recovery, the problem is convex in the encoding scheme. This allows us to derive new codes that are locally optimal. We present examples of such codes that can handle errors which are too strong for codes derived by analogy to classical error correction techniques. 1