Graph state basis for Pauli Channels
arXiv:1007.4611 · doi:10.1103/PhysRevA.83.052316
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.
5 pages
References in corpus (11)
- Mixed State Entanglement and Quantum Error Correction
- Multi-party entanglement in graph states
- The capacity of the noisy quantum channel
- Quantum error-correcting codes associated with graphs
- Information transmission through a noisy quantum channel
- Quantum Channel Capacity of Very Noisy Channels
- On Quantum Fidelities and Channel Capacities
- Degenerate Quantum Codes for Pauli Channels
- New lower bounds on the non-zero capacity of Pauli Channels
- Open-system dynamics of graph-state entanglement
- Noisy entanglement evolution for graph states
Cited by in corpus (6)
- Effective noise channels for encoded quantum systems
- Error Thresholds for Arbitrary Pauli Noise
- Precise detection of multipartite entanglement in four-qubit Greenberger--Horne--Zeilinger diagonal states
- Necessary and sufficient criterion for k-separability of N-qubit noisy GHZ states
- Construction of optimal resources for concatenated quantum protocols
- A hierarchy of entanglement criteria for four qubit symmetric Greenberger-Horne-Zeilinger diagonal states