Suboptimal quantum-error-correcting procedure based on semidefinite programming
- 28 February 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (2) , 022322
- https://doi.org/10.1103/physreva.71.022322
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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Complete family of separability criteriaPhysical Review A, 2004
- Optimizing completely positive maps using semidefinite programmingPhysical Review A, 2002
- Optimal nonuniversally covariant cloningPhysical Review A, 2001
- One-to-one parametrization of quantum channelsPhysical Review A, 1999
- Theory of quantum error-correcting codesPhysical Review A, 1997
- Sending entanglement through noisy quantum channelsPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Completely positive linear maps on complex matricesLinear Algebra and its Applications, 1975
- Linear transformations which preserve trace and positive semidefiniteness of operatorsReports on Mathematical Physics, 1972