Related papers: Quadratic discrete Fourier transform and mutually …
We argue that there should exist a "noncommutative Fourier transform" which should identify functions of noncommutative variables (say, of matrices of indeterminate size) and ordinary functions or measures on the space of paths. Some…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
A new method of quantum state tomography for quantum information processing is described. The method based on two-dimensional Fourier transform technique involves detection of all the off-diagonal elements of the density matrix in a…
We construct a basis of sparse eigenvectors for the N-dimensional discrete Fourier transform. The sparsity differs from the optimal by at most a factor of four. When N is a perfect square, the basis is orthogonal.
In this note, we study the convergence from the discrete to the continuous non-linear Fourier transform. Relations between spectral problems and questions in complex function theory provide a new approach to the study of scattering problems…
We give upper bounds on the size of the gap between a non-zero constant term and the next non-zero Fourier coefficient of an entire level two modular form. We give upper bounds for the minimum positive integer represented by a level two…
Most of the fundamental characteristics of quantum mechanics, such as non-locality and contextuality, are manifest in discrete, finite-dimensional systems. However, many quantum information tasks that exploit these properties cannot be…
Physical quantum systems are commonly composed of more than two levels and offer the capacity to encode information in higher-dimensional spaces beyond the qubit, starting with the three-level qutrit. Here, we encode neutral-atom qutrits in…
This paper derives a new directional uncertainty principle for quaternion valued functions subject to the quaternion Fourier transformation. This can be generalized to establish directional uncertainty principles in Clifford geometric…
In this paper we describe physical properties arising in the vicinity of two coupled quantum phase transitions. We consider a phenomenological model based on two scalar order parameter fields locally coupled biquadratically and having a…
By means of a simple example it is demonstrated that the task of finding and identifying certain patterns in an otherwise (macroscopically) unstructured picture (data set) can be accomplished efficiently by a quantum computer. Employing the…
Entanglement is essential for quantum computation. However, disentanglement is also necessary. It can be achieved without the need of classical operations (measurements). Two examples are analyzed: the discrete Fourier transform and error…
This paper contains two new results: 1. We amend the notion of abstract basis in a dagger symmetric monoidal category, as well as its corresponding graphical representation, in order to accommodate non-self-dual dagger compact structures;…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this…
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by…
Spherical field theory is a new non-perturbative method for studying quantum field theories. It uses the spherical partial wave expansion to reduce a general d-dimensional Euclidean field theory into a set of coupled one-dimensional…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
We present a new template for building oblivious transfer from quantum information that we call the "fixed basis" framework. Our framework departs from prior work (eg., Crepeau and Kilian, FOCS '88) by fixing the correct choice of…