Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0904.2560

Quantum Fourier Transform Over Galois Rings

Yong Zhang

Published Apr 16, 2009• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.0904.2560

Related papers

Quantum Fourier Transform (QFT) over Galois fields

S. Rodriguez

Galois fields are constantly gaining importance in quantum computing due to their wide usage in quantum error correction algorithms, and so it becomes relevant to define the QFT over Galois fields because of its main role in many of the most important quantum algorithms. The present article illustrates how to generalize the QFT so it can be applied over Galois fields and explains several examples of the application of the QFT over the simplest Galois fields. In particular the QFT will be defined for the Galois fields F2, F4 and GF(9), also the application of the QFT and the operations involved will be made using the Maple mathematical software.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2013•1 citation

Efficient Quantum Fourier Transforms For Semisimple Algebras

Ben Foxman, Barak Nehoran, Yongshan Ding

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we extend the framework for the QFT from finite groups to finite-dimensional semisimple algebras, and give efficient QFTs for the partition algebra $P_n(d)$, Brauer algebra $B_n(d)$, and walled Brauer algebra $B_{r,s}(d)$. These algebras play important roles in generalized Schur-Weyl duality, statistical physics and many-body systems, and have recently found several applications in quantum algorithms. Unlike the group case, the Fourier transform over a semisimple algebra can be non-unitary. Nevertheless, we show that when the parameter $d$ is sufficiently large, the Fourier transform is well approximated by a unitary operator. Furthermore, we show that for each of the algebras $A$ from above, such an approximate Fourier transform can be implemented efficiently: we give a quantum algorithm with gate complexity $\mathrm{poly}(n,\log d,\log(1/\varepsilon))$ for approximating the Fourier transform to error $(d^{-1/2} + \varepsilon) \cdot \mathrm{poly}(|A|)$. Along the way, we establish several properties of the Fourier basis of semisimple algebras that may be of independent interest.

quant-pharXiv:2605.05337•May 8, 2026•1 citation

Quantum error-correcting codes over finite Frobenius rings

Andreas Klappenecker, Sang-Jun Lee, Andrew Nemec

The idealized model of quantum computation promises for certain problems a considerable speed-up over classical computation. However, protecting quantum information requires a considerable effort. We give a brief survey of the construction of quantum error-correcting codes over finite Frobenius rings. We illustrate the construction of families of quantum error-correcting codes that are obtained from quadratic residue codes over finite commutative chain rings.

Contemporary mathematics - American Mathematical Society•Jan 1, 2020•0 citations

Stabilizer codes over Frobenius rings

Sushma Nadella, Andreas Klappenecker

Quantum error-correcting codes over finite fields have been widely studied, but quantum codes over rings have been left largely unexplored. This paper introduces stabilizer codes over finite Frobenius rings and establishes their connection to classical code. Structural properties of stabilizer codes over finite Frobenius rings are established. It is proved that free stabilizer codes over finite commutative chain rings cannot outperform stabilizer codes over finite fields.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•19 citations

Generic Quantum Fourier Transforms

Cristopher Moore, Daniel N. Rockmore, Alexander C. Russell

The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the separation of variables technique that has been so successful in the study of classical Fourier transform computations. Specifically, this framework applies the existence of computable Bratteli diagrams, adapted factorizations, and Gel'fand-Tsetlin bases to offer efficient quantum circuits for the QFT over a wide variety a finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Moreover, the method gives rise to the first subexponential-size quantum circuits for the QFT over the linear groups GL_k(q), SL_k(q), and the finite groups of Lie type, for any fixed prime power q.

arXiv:quant-ph/0304064•Apr 9, 2003•27 citations

A decomposition of quantum Fourier transformation

Cao Huai-xin

Quantum Fourier Transform(QFT) is an important algorithm in quantum computation.Quantum computer can solve the problem using QFT and Quantum Searching Algorithm,which problem need too much resource in classical computer. In this paper,the factorization of QFT is presented and proved so as to it can be well-understanded and used.

Basic Sciences Journal of Textile Universities•Jan 1, 2007•0 citations
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.
Galois fields are constantly gaining importance in quantum computing due to their wide usage in quantum error correction algorithms, and so it becomes relevant to define the QFT over Galois fields because of its main role in many of the most important quantum algorithms. The present article illustrates how to generalize the QFT so it can be applied over Galois fields and explains several examples of the application of the QFT over the simplest Galois fields. In particular the QFT will be defined for the Galois fields F2, F4 and GF(9), also the application of the QFT and the operations involved will be made using the Maple mathematical software.
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we extend the framework for the QFT from finite groups to finite-dimensional semisimple algebras, and give efficient QFTs for the partition algebra Pn(d)P_n(d)Pn​(d), Brauer algebra Bn(d)B_n(d)Bn​(d), and walled Brauer algebra Br,s(d)B_{r,s}(d)Br,s​(d). These algebras play important roles in generalized Schur-Weyl duality, statistical physics and many-body systems, and have recently found several applications in quantum algorithms. Unlike the group case, the Fourier transform over a semisimple algebra can be non-unitary. Nevertheless, we show that when the parameter ddd is sufficiently large, the Fourier transform is well approximated by a unitary operator. Furthermore, we show that for each of the algebras AAA from above, such an approximate Fourier transform can be implemented efficiently: we give a quantum algorithm with gate complexity poly(n,log⁡d,log⁡(1/ε))\mathrm{poly}(n,\log d,\log(1/\varepsilon))poly(n,logd,log(1/ε)) for approximating the Fourier transform to error (d−1/2+ε)⋅poly(∣A∣)(d^{-1/2} + \varepsilon) \cdot \mathrm{poly}(|A|)(d−1/2+ε)⋅poly(∣A∣). Along the way, we establish several properties of the Fourier basis of semisimple algebras that may be of independent interest.
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the separation of variables technique that has been so successful in the study of classical Fourier transform computations. Specifically, this framework applies the existence of computable Bratteli diagrams, adapted factorizations, and Gel'fand-Tsetlin bases to offer efficient quantum circuits for the QFT over a wide variety a finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Moreover, the method gives rise to the first subexponential-size quantum circuits for the QFT over the linear groups GL_k(q), SL_k(q), and the finite groups of Lie type, for any fixed prime power q.