Numerical method for finding decoherence-free subspaces and its applications
Author(s)
Wang, Xiaoting; Byrd, Mark; Jacobs, Kurt
DownloadWang-2013-Numerical method for finding decoherence-free subspaces and its applications.pdf (133.1Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability 1, and it is more efficient than the algorithm proposed by J. A. Holbrook, D. W. Kribs and R. Laflamme Quantum. Inf. Proc. 80 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.
Date issued
2013-01Department
Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
Physical Review A
Publisher
American Physical Society
Citation
Wang, Xiaoting, Mark Byrd, and Kurt Jacobs. “Numerical Method for Finding Decoherence-free Subspaces and Its Applications.” Physical Review A 87.1 (2013). ©2013 American Physical Society
Version: Final published version
ISSN
1050-2947
1094-1622