Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mass matrix transforms in qubit field theory

M. D. Sheppeard

Published Nov 1, 2007• 0 citations
OpenAlex

Abstract

Circulant mass matrices for triples of charged and neutral leptons have been studied in the context of qubit quantum field theory. This note describes the discrete Fourier transform behind such matrices, and discusses a category theoretic interpretation of these operators.

Related papers

Quantum Algorithms for Modulated Circulant Matrix Vector Multiplication

Kimy Agudelo, Aldo Quelopana Cristina Manzaneda

Modulated circulant matrices form a special class of N-parametric circulant matrices, recently introduced in the literature, with a structured spectral decomposition based on a Vandermonde type basis. Motivated by this definition, in this work we define the Modulated Quantum Fourier Transform (MQFT), a quantum primitive tailored to this matrix family.

quant-pharXiv:2606.09618•Jun 9, 2026•0 citations

On Universality of Quantum Fourier Transform

Arpita Maitra, Santanu Sarkar

A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix U n related to QFT, the issue boils down to the problem of characterizing matrices that commute with U n .

arXiv:1109.4462•Chinese Physics Letters•Mar 1, 2012•1 citation

Matrix-based perspective to quantum multiplication

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

The Quantum Fourier Transform (QFT) is a key component in many quantum circuit designs and algorithms. In this paper, a matrix-based approach is used to study the design and outcomes of an ancilla-free, QFT-based quantum circuit for multiplying a pair of 2-qubit strings. Additionally, a graphical method to calculate QFT and IQFT matrices has been proposed.

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations

Fourier transforms from strongly complementary observables

Stefano Gogioso, William J. Zeng

Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general connection in any process theory between the Fourier transform and strongly complementary observables, i.e. Hopf algebras in dagger symmetric monoidal categories. We generalise the necessary tools of representation theory from fdHilb to arbitrary dagger symmetric monoidal categories. We define groups, characters and representations, and we prove their relation to strong complementarity. The Fourier transform is then defined in terms of pairs of strongly complementary observables, in both the abelian and non-abelian case. In the abelian case, we draw the connection with Pontryagin duality and provide categorical proofs of the Fourier Inversion Theorem, the Convolution Theory, and Pontryagin duality. Our work finds application in the novel characterisation of the Fourier transform for the category fRel of finite sets and relations. This is a result of interest for the study of categorical quantum algorithms, as the usual construction of the quantum Fourier transform in terms of Fourier matrices is shown to fail in fRel. Despite this, the process theoretic perspective on the Fourier transform is sensible in this setting. Furthermore, our categorical setting provides a generalisation of the abelian Fourier transform from finite-dimensional Hilbert spaces to finite-dimensional modules over arbitrary semirings, as well as a further generalisation to finite non-abelian groups, including a fully categorical generalisation of the Gelfand-Naimark theorem.

arXiv:1501.04995•Jan 19, 2015•15 citations

The Quantum Fourier Transform for Continuous Variables

Gianfranco Cariolaro, Edi Ruffa, Amir Mohammad Yaghoobianzadeh +1 more

The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two elementary components: the Hadamard gate and the controlled--phase gate. In this paper, the quantum Fourier transform operating with continuous variables (cvQFT) is considered. Thus, the environment becomes the Hilbert space, where the natural definition of the cvQFT will be related to rotation operators, which in the $N$--mode are completely specified by unitary matrices of order $N$. Then the cvQFT is defined as the rotation operator whose rotation matrix is given by the discrete Fourier transform (DFT) matrix. For the implementation of rotation operators with primitive components (single--mode rotations and beam splitters), we follow the well known Murnaghan procedure, with appropriate modifications. Moreover, algorithms related to the fast Fourier transform (FFT) are applied to reduce drastically the implementation complexity. The final part is concerned with the application of the cvQFT to general Gaussian states. In particular, we show that cvQFT has the simple effect of transforming the displacement vector by a one-dimensional DFT, the squeeze matrix by a two-dimensional DFT, and the rotation matrix by a Fourier-like similarity transform.

quant-pharXiv:2512.12771•Dec 16, 2025•0 citations

Some Possibility and Impossibility Results related to Discrete Fourier type transforms in Quantum Information

Arpita Maitra

Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more generalization, we investigate the possibility and impossibility results related to Discrete Fourier Transform (DFT) type of operations for a more general set up of qutrits.

arXiv:quant-ph/0611060•Nov 6, 2006•0 citations
A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix U n related to QFT, the issue boils down to the problem of characterizing matrices that commute with U n .
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general connection in any process theory between the Fourier transform and strongly complementary observables, i.e. Hopf algebras in dagger symmetric monoidal categories. We generalise the necessary tools of representation theory from fdHilb to arbitrary dagger symmetric monoidal categories. We define groups, characters and representations, and we prove their relation to strong complementarity. The Fourier transform is then defined in terms of pairs of strongly complementary observables, in both the abelian and non-abelian case. In the abelian case, we draw the connection with Pontryagin duality and provide categorical proofs of the Fourier Inversion Theorem, the Convolution Theory, and Pontryagin duality. Our work finds application in the novel characterisation of the Fourier transform for the category fRel of finite sets and relations. This is a result of interest for the study of categorical quantum algorithms, as the usual construction of the quantum Fourier transform in terms of Fourier matrices is shown to fail in fRel. Despite this, the process theoretic perspective on the Fourier transform is sensible in this setting. Furthermore, our categorical setting provides a generalisation of the abelian Fourier transform from finite-dimensional Hilbert spaces to finite-dimensional modules over arbitrary semirings, as well as a further generalisation to finite non-abelian groups, including a fully categorical generalisation of the Gelfand-Naimark theorem.
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two elementary components: the Hadamard gate and the controlled--phase gate. In this paper, the quantum Fourier transform operating with continuous variables (cvQFT) is considered. Thus, the environment becomes the Hilbert space, where the natural definition of the cvQFT will be related to rotation operators, which in the NNN--mode are completely specified by unitary matrices of order NNN. Then the cvQFT is defined as the rotation operator whose rotation matrix is given by the discrete Fourier transform (DFT) matrix. For the implementation of rotation operators with primitive components (single--mode rotations and beam splitters), we follow the well known Murnaghan procedure, with appropriate modifications. Moreover, algorithms related to the fast Fourier transform (FFT) are applied to reduce drastically the implementation complexity. The final part is concerned with the application of the cvQFT to general Gaussian states. In particular, we show that cvQFT has the simple effect of transforming the displacement vector by a one-dimensional DFT, the squeeze matrix by a two-dimensional DFT, and the rotation matrix by a Fourier-like similarity transform.