Optimal Nonadditive Quantum Error-Detecting Code

Simple item page
dc.creatorYen, Wen-Tai
dc.creatorHsu, Li-Yi
dc.date2009-01-10
dc.date.accessioned2026-07-07T12:28:16Z
dc.date.available2026-07-07T12:28:16Z
dc.descriptionIn 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.
dc.description6 pages, 22 figures
dc.identifierhttps://arxiv.org/abs/0901.1353
dc.identifierhttp://arxiv.org/abs/0901.1353
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215481
dc.subjectQuantum Physics
dc.titleOptimal Nonadditive Quantum Error-Detecting Code
dc.typetext

Files

Collections

arXiv