Computational approach to quantum encoder design for purity optimization
- Creators
- Yamamoto, Naoki
- Fazel, Maryam
Abstract
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace of dimension 2. Moreover, this algorithm is easily extended to cover the general class of codespaces, in which case the solution is suboptimal in the sense that the suboptimized output purity serves as a lower bound of the exact optimal purity. The algorithm consists of a sequence of semidefinite programmings and can be performed easily. Two typical quantum error channels are investigated to illustrate the effectiveness of our method.
Additional Information
©2007 The American Physical Society. (Received 28 August 2006; revised 7 May 2007; published 26 July 2007) We wish to thank P. Parrilo for pointing out the SOS characterization. N.Y. would like to acknowledge stimulating discussions with S. Hara and H. Siahaan. M.F. thanks M. Yanagisawa for helpful discussions. This work was supported in part by the JSPS Grant-in-Aid No. 06693.Files
Name | Size | Download all |
---|---|---|
md5:06b695d5a57f4cf3384466aca67cdba5
|
204.0 kB | Preview Download |
Additional details
- Eprint ID
- 8779
- Resolver ID
- CaltechAUTHORS:YAMpra07
- Created
-
2007-09-15Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field