Numerical method for finding decoherence-free subspaces and its applications
Name
Wang-2013-Numerical method for finding decoherence-free subspaces and its applications.pdf
Size
133.16 KB
Format
Adobe PDF
Checksum (MD5)
0fd83d2a24c1df60880dded68a626238
Author(s)
Wang, Xiaoting
Byrd, Mark
Jacobs, Kurt
Date Issued
January 2013
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevA.87.012338
