Quantum Fourier Transform Over Galois Rings

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Galois 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.
Latex, 11 pages

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/227388

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0904.2560
 http://arxiv.org/abs/0904.2560

Collections

arXiv