Fast Fourier transforms and fast Wigner and Weyl functions in large quantum systems
View/ Open
Lei_&_Vourdas_EPJP (909.3Kb)
Download
Publication date
2024-05Rights
© The Author(s) 2024. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.Peer-Reviewed
YesOpen Access status
openAccessAccepted for publication
2024-04-16
Metadata
Show full item recordAbstract
Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space with d an odd integer, and is inspired by the Cooley-Tukey formalism. The ‘large Fourier transform’ is expressed as a sequence of n ‘small Fourier transforms’ (together with some other transforms) in quantum systems with d-dimensional Hilbert space. Limitations of the method are discussed. In some special cases, the n Fourier transforms can be performed in parallel. The second method is for systems with dimension of the Hilbert space with odd integers coprime to each other. It is inspired by the Good formalism, which in turn is based on the Chinese reminder theorem. In this case also the ‘large Fourier transform’ is expressed as a sequence of n ‘small Fourier transforms’ (that involve some constants related to the number theory that describes the formalism). The ‘small Fourier transforms’ can be performed in a classical computer or in a quantum computer (in which case we have the additional well known advantages of quantum Fourier transform circuits). In the case that the small Fourier transforms are performed with a classical computer, complexity arguments for both methods show the reduction in computational time from to . The second method is also used for the fast calculation of Wigner and Weyl functions, in quantum systems with large finite dimension of the Hilbert space.Version
Published versionCitation
Lei C and Vourdas A (2024) Fast Fourier transforms and fast Wigner and Weyl functions in large quantum systems. The European Physical Journal Plus. 139(394).Link to Version of Record
https://doi.org/10.1140/epjp/s13360-024-05184-1Type
Articleae974a485f413a2113503eed53cd6c53
https://doi.org/10.1140/epjp/s13360-024-05184-1