Quadratic discrete Fourier transform and mutually unbiased bases
Maurice Robert Kibler (IPNL)

TL;DR
This paper introduces a quadratic discrete Fourier transform, extending the classical transform with quadratic parameters, and explores its application in generating mutually unbiased bases in quantum information, especially in prime dimensions.
Contribution
It presents the quadratic discrete Fourier transform as a novel extension of the classical Fourier transform and demonstrates its utility in quantum information for constructing mutually unbiased bases.
Findings
Quadratic discrete Fourier transform generalizes the classical transform.
In prime dimensions, it helps generate complete sets of mutually unbiased bases.
The transform reduces to the usual Fourier transform when parameters are zero.
Abstract
The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier transform. This Fourier transform can be considered as a two-parameter extension, with a quadratic term, of the usual discrete Fourier transform. In the case where the two parameters are taken to be equal to zero, the quadratic discrete Fourier transform is nothing but the usual discrete Fourier transform. The quantum quadratic discrete Fourier transform plays an important role in the field of quantum information. In particular, such a transformation in prime dimension can be used for obtaining a complete set of mutually unbiased bases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Mathematical Analysis and Transform Methods · Neural Networks and Applications
