2006/06/09 by Robert L. Kosut, Daniel A. Lidar · 1 citation
Computer Science · Physics and Astronomy · #Complexity and Algorithms in Graphs #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph
paper · pdf · doi:10.1007/s11128-009-0120-2
published as Quant. Inf. Proc. 8, 443 (2009) · 16 pages
arxiv created 2006/06/09 · openalex publication_date 2009/07/17 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.