Quantum error correction via convex optimization
From MaRDI portal
Abstract: 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.
Recommendations
- An optimal quantum error-correcting procedure using quantifier elimination
- Optimal quantum error correction from Hamiltonian models or process tomography
- Quantum error correction via codes over GF(4)
- Optimal correction of independent and correlated errors
- Quantum error correcting codes from the compression formalism
Cites work
Cited in
(11)- On convex optimization problems in quantum information theory
- Quantum error correction: noise-adapted techniques and applications
- An improved robust ADMM algorithm for quantum state tomography
- Semidefinite programming hierarchies for constrained bilinear optimization
- Non-commutative graphs and quantum error correction for a two-mode quantum oscillator
- Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
- Optimal quantum error correction from Hamiltonian models or process tomography
- Highly Robust Error Correction byConvex Programming
- Evolving quantum circuits
- An optimal quantum error-correcting procedure using quantifier elimination
- The multiplicative domain in quantum error correction
This page was built for publication: Quantum error correction via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034812)
