Maximal noiseless code rates for collective rotation channels on qudits
arXiv:1306.0981
Abstract
We study noiseless subsystems on collective rotation channels of qudits, i.e., quantum channels with operators in the set This is done by analyzing the decomposition of the algebra generated by . We summarize the results for the channels on qubits (), and obtain the maximum dimension of the noiseless subsystem that can be used as the quantum error correction code for the channel. Then we extend our results to general . In particular, it is shown that the code rate, i.e., the number of protected qudits over the number of physical qudits, always approaches 1 for a suitable noiseless subsystem. Moreover, one can determine the maximum dimension of the noiseless subsystem by solving a non-trivial discrete optimization problem. The maximum dimension of the noiseless subsystem for (qutrits) is explicitly determined by a combination of mathematical analysis and the symbolic software Mathematica.
arXiv comment16 pages, proofs are put in Appendix for clearer presentation. Title has been changed and some related materials, such as quantum secret sharing and erasure errors, are mentioned
References in corpus (8)
- Decoherence Free Subspaces for Quantum Computation
- How to share a quantum secret
- A Theory of Quantum Error-Correcting Codes
- Reference frames, superselection rules, and quantum information
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Loss tolerance in one-way quantum computation via counterfactual error correction
- Classical and quantum communication without a shared reference frame
- Fault tolerant quantum computation with very high threshold for loss errors