Graph state basis for Pauli Channels
Quantum Physics
2011-07-12 v1
Abstract
We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes, providing us a practical constructive way of approaching the quantum capacity of a Pauli channel. The calculation of the coherent information of non-additive quantum code can also be greatly simplified in graph state basis.
Cite
@article{arxiv.1007.4611,
title = {Graph state basis for Pauli Channels},
author = {Xiao-yu Chen and Li-zhen Jiang},
journal= {arXiv preprint arXiv:1007.4611},
year = {2011}
}
Comments
5 pages