The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms

DOI10.1016/S0022-247X(02)00227-5zbMath1017.65109arXivquant-ph/0007122MaRDI QIDQ1856841

Zijian Diao, Charles M. Bowden, Andreas Klappenecker, Goong Chen

Publication date: 11 February 2003

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0007122

zbMATH Keywords

algorithmunitary groupquantum computingquantum Fourier transformWalsh-Hadamard transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Computational methods for problems pertaining to quantum theory (81-08) Finite-dimensional groups and algebras motivated by physics and their representations (81R05)

Related Items (1)

Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians

Cites Work

• Quantum algorithms revisited
• Unnamed Item
• Unnamed Item

This page was built for publication: The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms