Related papers: A one-to-two dimensional mapping using a partial f…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
We construct a phenomenological conformal field theory (CFT) model of the three-dimensional Hawking-Page transition. We find that free fermion CFT models on the boundary torus give a description of the three-dimensional Hawking-Page…
We consider the well-studied Sparse Fourier transform problem, where one aims to quickly recover an approximately Fourier $k$-sparse vector $\widehat{x} \in \mathbb{C}^{n^d}$ from observing its time domain representation $x$. In the exact…
The reason why Cooley-Tukey Fast Fourier Transform (FFT) over $\mathbb{Q}$ can be efficiently implemented using complex roots of unity is that the cyclotomic extensions of the completion $\mathbb{R}$ of $\mathbb{Q}$ are at most quadratic,…
Motivated by the recent experimental determination of the three-dimensional Fermi surface of overdoped La-based cuprate superconductors [Horio et al., Phys. Rev. Lett. 2018, 121, 077004], we revisit the tight-binding parameterization of…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
We show the existence of the fractional topological phase (FTP) in a one-dimensional interacting fermion model using exact diagonalization, in which the non-interacting part has flatbands with nontrivial topology. In the presence of the…
The one dimensional Kondo lattice model is investigated using Quantum Monte Carlo and transfer matrix techniques. In the strong coupling region ferromagnetic ordering is found even at large band fillings. In the weak coupling region the…
We present a unified framework for the quantization of a family of discrete dynamical systems of varying degrees of "chaoticity". The systems to be quantized are piecewise affine maps on the two-torus, viewed as phase space, and include the…
The algorithm behind the Fast Fourier Transform has a simple yet beautiful geometric interpretation that is often lost in translation in a classroom. This article provides a visual perspective which aims to capture the essence of it.
Multi-dimensional Fourier transforms are key mathematical building blocks that appear in a wide range of applications from materials science, physics, chemistry and even machine learning. Over the past years, a multitude of software…
Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…
Transmission matrix (TM) linearly maps the incident and transmitted complex fields, and has been used widely due to its ability to characterize scattering media. It is computationally demanding to reconstruct the TM from intensity images…
This paper provides a double encryption algorithm that uses the lack of invertibility of the fractional Fourier transform (FRFT) on $L^{1}$. One encryption key is a function, which maps a ``good" $L^{2}$-signal to a ``bad" $L^{1}$-signal.…
Inspired by the concept of coherent frozen waves, this paper introduces one possible theoretical framework of its partially coherent version, a frozen spatial coherence, in which a desired two-point correlation structure of an optical field…
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…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
In recent years twisted bi-layers of 2D materials became very popular in the field due to the possibility to totally change their electronic properties by simple rotation. At the same time, in the wide field of photonic crystals, this idea…
An efficient algorithm is constructed for contracting two-dimensional tensor networks under periodic boundary conditions. The central ingredient is a novel renormalization step that scales linearly with system size, i.e. from $L \to L+1$.…