Quantum Fourier Transform Over Galois Rings

Simple item page
dc.creatorZhang, Yong
dc.date2009-04-16
dc.date.accessioned2026-07-07T13:05:06Z
dc.date.available2026-07-07T13:05:06Z
dc.descriptionGalois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently preformed on a quantum computer. The properties of the QFT over Galois rings lead to the quantum algorithm for hidden linear structures over Galois rings.
dc.descriptionLatex, 11 pages
dc.identifierhttps://arxiv.org/abs/0904.2560
dc.identifierhttp://arxiv.org/abs/0904.2560
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227388
dc.subjectQuantum Physics
dc.titleQuantum Fourier Transform Over Galois Rings
dc.typetext

Files

Collections

arXiv