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/0606078 · Quantum Information Processing

Quantum error correction via convex optimization

Robert L. Kosut, Daniel A. Lidar

Published Jul 17, 2009• 48 citations
arXivHTMLPDF
DOI
10.1007/s11128-009-0120-2

Related papers

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•33 citations

Quantum Error Correction and Its Application

Masahito Hayashi

Springer eBooks•Oct 31, 2016•0 citations

Quantum Error Correction: Applications and implementations

Daniel A. Lidar, Todd A. Brun

•Jan 1, 2013•0 citations

Optimized entanglement-assisted quantum error correction

Soraya Taghavi, Todd A. Brun, Daniel A. Lidar

Using convex optimization, we propose entanglement-assisted quantum error-correction procedures that are optimized for given noise channels. We demonstrate through numerical examples that such an optimized error-correction method achieves higher channel fidelities than existing methods. This improved performance, which leads to perfect error correction for a larger class of error channels, is interpreted in at least some cases by quantum teleportation, but for general channels this interpretation does not hold.

arXiv:1008.5384•Physical Review A•Oct 20, 2010•9 citations

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•108 citations

Convex optimization of programmable quantum computers

Leonardo Banchi, Jason L. Pereira, Seth Lloyd +1 more

•Jan 1, 2020•27 citations
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
Using convex optimization, we propose entanglement-assisted quantum error-correction procedures that are optimized for given noise channels. We demonstrate through numerical examples that such an optimized error-correction method achieves higher channel fidelities than existing methods. This improved performance, which leads to perfect error correction for a larger class of error channels, is interpreted in at least some cases by quantum teleportation, but for general channels this interpretation does not hold.
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.