Related papers: Two-sided Clifford Fourier transform with two squa…

We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter $k$ that we call the twist. For a field of characteristic not equal to $2$, we provide a basis for our quantized Clifford…

In this paper we consider the problem of constructing graph Fourier transforms (GFTs) for directed graphs (digraphs), with a focus on developing multiple GFT designs that can capture different types of variation over the digraph…

The graph fractional Fourier transform (GFRFT) applies a single global fractional order to all graph frequencies, which restricts its adaptability to diverse signal characteristics across the spectral domain. To address this limitation, in…

In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…

Classical Segal-Bargmann theory studies three Hilbert space unitary isomorphisms that describe the wave-particle duality and the configuration space-phase space. In this work, we generalized these concepts to Clifford algebra-valued…

In this paper, we mainly establish the uncertainty principle (UP) for a function and its quaternion Fractional Fourier transform (QFrFT), as well as the UP for two QFrFTs. Using the polar representation of quaternion-valued signals, we give…

A brief survey of the theory of soliton perturbations is presented. The focus is on the usefulness of the so-called Generalised Fourier Transform (GFT). This is a method that involves expansions over the complete basis of `squared olutions`…

The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…

We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer. This is the first completeness result for any fragment of quantum circuits in odd prime dimensions. We first generalize…

A variety of universal similarity factorization equalities over real Clifford algebras ${\cal R}_{p,q}$ are established. On the basis of these equalities, real, complex and quaternion matrix representations of elements in ${\cal R}_{p,q}$…

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…

We show that any $n$-qubit Clifford unitary can be implemented using at most $2n$ multi-qubit joint measurements. All the multi-qubit joint measurements used for implementing the Clifford unitary can be chosen to form at most two sets of…

We functorially identify similarity classes of line-bundle-valued quadratic forms on rank two vector bundles with isomorphism classes of pairs consisting of the degree zero and the degree one parts of the associated generalized Clifford…

In this paper, we study a specific system of Clifford-Appell polynomials and in particular their product. Moreover, we introduce a new family of quaternionic reproducing kernel Hilbert spaces in the framework of Fueter regular functions.…

In quantum information processing (QIP), the quantum Fourier transform (QFT) has a plethora of applications [1] [2] [3]: Shor's algorithm and phase estimation are just a few well-known examples. Shor's quantum factorization algorithm, one…

In this paper, we extend the quadratic phase Fourier transform of a complex valued functions to that of the quaternion valued functions of two variables. We call it the quaternion quadratic phase Fourier transform (QQPFT). Based on the…

Many media are divided into elementary units with irregular shape and size, as exemplified by domains in magnetic materials, bubbles in foams, or cells in biological tissues. Such media are essentially characterized by geometrical disorder…

The Quantum Fourier Transformation ($QFT$) is a key building block for a whole wealth of quantum algorithms. Despite its proven efficiency, only a few proof-of-principle demonstrations have been reported. Here we utilize $QFT$ to enhance…