Suboptimal quantum-error-correcting procedure based on semidefinite programming

Abstract

In this paper, we consider a simplified error-correcting problem: for a fixed encoding process, to find a cascade connected quantum channel such that the worst fidelity between the input and the output becomes maximum. With the use of the one-to-one parametrization of quantum channels, a procedure finding a suboptimal error-correcting channel based on a semidefinite programming is proposed. The effectiveness of our method is verified by an example of the bit-flip channel decoding.

6 pages, no figure, Some notations differ from those in the PRA version

References in corpus (1)

• A complete family of separability criteria

Cited by in corpus (9)

• Optimum Quantum Error Recovery using Semidefinite Programming
• Alternative fidelity measure for quantum states
• Robust Quantum Error Correction via Convex Optimization
• Structured Near-Optimal Channel-Adapted Quantum Error Correction
• Quantum Error Correction via Convex Optimization
• Operator quantum error correction for continuous dynamics
• Optimized Entanglement-Assisted Quantum Error Correction
• Optimal tracking for pairs of qubit states
• The Vector representation of the Standard Quantum Process Tomography