Quantum Error Correcting Codes Using Qudit Graph States

Simple item page
dc.creatorLooi, Shiang Yong
dc.creatorYu, Li
dc.creatorGheorghiu, Vlad
dc.creatorGriffiths, Robert B.
dc.date2007-12-12
dc.date2008-11-11
dc.date.accessioned2026-07-07T10:16:56Z
dc.date.available2026-07-07T10:16:56Z
dc.descriptionGraph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an additive graph code.
dc.descriptionVersion 4 is almost exactly the same as the published version in Phys. Rev. A
dc.identifierhttps://arxiv.org/abs/0712.1979
dc.identifierhttp://arxiv.org/abs/0712.1979
dc.identifierPhys. Rev. A 78, 042303 (2008)
dc.identifierdoi:10.1103/PhysRevA.78.042303
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173687
dc.subjectQuantum Physics
dc.titleQuantum Error Correcting Codes Using Qudit Graph States
dc.typetext

Files

Collections

arXiv