Optimal Nonadditive Quantum Error-Detecting Code Export

@article{citeulike:3886057, abstract = {In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with maximal number of codewords can be found. Therein, except the n=7 case, the n-vertex loop graphs help find the optimal quantum codes.}, archivePrefix = {arXiv}, author = {Yen, Wen-Tai and Hsu, Li-Yi}, citeulike-article-id = {3886057}, citeulike-linkout-0 = {http://arxiv.org/abs/0901.1353}, citeulike-linkout-1 = {http://arxiv.org/pdf/0901.1353}, day = {10}, eprint = {0901.1353}, keywords = {error\_correction}, month = {Jan}, posted-at = {2009-01-14 17:20:49}, priority = {2}, title = {Optimal Nonadditive Quantum Error-Detecting Code}, url = {http://arxiv.org/abs/0901.1353}, year = {2009} }

TY - JOUR ID - citeulike:3886057 L3 - citeulike-article-id:3886057 N2 - In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with maximal number of codewords can be found. Therein, except the n=7 case, the n-vertex loop graphs help find the optimal quantum codes. TI - Optimal Nonadditive Quantum Error-Detecting Code KW - error_correction AU - Yen, Wen-Tai AU - Hsu, Li-Yi PY - 2009/Jan/10/ UR - http://arxiv.org/abs/0901.1353 ER -