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

Letters in Mathematical Physics

On the Integrability of q-Oscillators Based on Invariants of Discrete Fourier Transforms

Andreas L. Ruffing, Myriam Witt

Published Oct 1, 1997• 7 citations
Publisher
DOI
10.1023/a:1007378122623

Related papers

Integrability of q-oscillator lattice model

С. М. Сергеев

arXiv:nlin/0509043•Physics Letters A•May 6, 2006•6 citations

Geometry and dynamics in the fractional discrete Fourier transform

Kurt Bernardo Wolf, Guillermo Krötzsch

The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.

Journal of the Optical Society of America A•Feb 14, 2007•33 citations

$N$-dimensional discrete Fourier transform via bosonic Hamiltonian

Edgar Barriga, Camila Muñoz, Alejandro Muñoz +4 more

The discrete Fourier transform (DFT) underpins many classical algorithms and is a fundamental unitary operator for quantum information processing. Implementing the $N$-dimensional DFT in photonic integrated circuits (PICs) is limited by the cascades of Mach-Zehnder interferometers that current architectures require. Here we propose bosonic Hamiltonians that realize the $N$-dimensional DFT through a single stage of multimode evolution, complemented only by phase shifters before and after the interaction region, in a geometry suited to 3D waveguides. Modeling the system as a graph, where edges correspond to couplings and the vertices are the waveguides, we obtain analytical solutions for complete graphs up to $N=6$ and numerical solutions up to $N=31$. For non-complete graphs, different propagation constants are required in the Hamiltonian. We report all solutions for $N\leq 8$, partial exploration for $N=9$, and selected cases for $N=10$, together with three conjectures that guide the numerical search for $N \geq 11$. These configurations circumvent the vanishing evanescent coupling strength imposed by the waveguide separation, and a closed-form sensitivity criterion selects those that are admissible as a waveguide layout and least sensitive to fabrication error. We also uncover the missing non-affine parameters of the $6$-dimensional DFT, and show that the scaling law for implementing the $N$-dimensional DFT with our building blocks is $\mathcal{O}(N\log\log{N})$. This allows assembling the $2520$-dimensional DFT with only $2625$ interferometers, in contrast to the $\approx 3\times 10^6$ of Reck and Clements architectures.

quant-pharXiv:2609.05644•Sep 8, 2026•0 citations

Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive

John H. Reif, Akhilesh Tyagi

Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models, the DFT-VLSIO (very-large-scale integrated optics) and the DFT-circuit, to capture this characteristic of optical computing. We also provide two paradigms for developing parallel algorithms in these models. Efficient parallel algorithms for many problems, including polynomial and matrix computations, sorting, and string matching, are presented. The sorting and string-matching algorithms are particularly noteworthy. Almost all these algorithms are within a polylog factor of the optical-computing (VLSIO) lower bounds derived by Barakat and Reif [Appl. Opt. 26, 1015 (1987) and by Tyagi and Reif [Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing (Institute of Electrical and Electronics Engineers, New York, 1990) p. 14].

Applied Optics•Oct 10, 1997•36 citations

An Analog of the Fourier Transformation for A q-Harmonic Oscillator

Richard Askey, Natig M. Atakishiyev, Sergeĭ K. Suslov

arXiv:math/9307205•Springer eBooks•Jan 1, 1993•20 citations

q-Phase Operators of Finite Dimensional Two-Mode q-Oscillator Algebra

Won Sang Chung

International Journal of Theoretical Physics•Oct 1, 2001•0 citations
The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.
NNN-dimensional discrete Fourier transform via bosonic Hamiltonian
The discrete Fourier transform (DFT) underpins many classical algorithms and is a fundamental unitary operator for quantum information processing. Implementing the NNN-dimensional DFT in photonic integrated circuits (PICs) is limited by the cascades of Mach-Zehnder interferometers that current architectures require. Here we propose bosonic Hamiltonians that realize the NNN-dimensional DFT through a single stage of multimode evolution, complemented only by phase shifters before and after the interaction region, in a geometry suited to 3D waveguides. Modeling the system as a graph, where edges correspond to couplings and the vertices are the waveguides, we obtain analytical solutions for complete graphs up to N=6N=6N=6 and numerical solutions up to N=31N=31N=31. For non-complete graphs, different propagation constants are required in the Hamiltonian. We report all solutions for N≤8N\leq 8N≤8, partial exploration for N=9N=9N=9, and selected cases for N=10N=10N=10, together with three conjectures that guide the numerical search for N≥11N \geq 11N≥11. These configurations circumvent the vanishing evanescent coupling strength imposed by the waveguide separation, and a closed-form sensitivity criterion selects those that are admissible as a waveguide layout and least sensitive to fabrication error. We also uncover the missing non-affine parameters of the 666-dimensional DFT, and show that the scaling law for implementing the NNN-dimensional DFT with our building blocks is O(Nlog⁡log⁡N)\mathcal{O}(N\log\log{N})O(NloglogN). This allows assembling the 252025202520-dimensional DFT with only 262526252625 interferometers, in contrast to the ≈3×106\approx 3\times 10^6≈3×106 of Reck and Clements architectures.
Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models, the DFT-VLSIO (very-large-scale integrated optics) and the DFT-circuit, to capture this characteristic of optical computing. We also provide two paradigms for developing parallel algorithms in these models. Efficient parallel algorithms for many problems, including polynomial and matrix computations, sorting, and string matching, are presented. The sorting and string-matching algorithms are particularly noteworthy. Almost all these algorithms are within a polylog factor of the optical-computing (VLSIO) lower bounds derived by Barakat and Reif [Appl. Opt. 26, 1015 (1987) and by Tyagi and Reif [Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing (Institute of Electrical and Electronics Engineers, New York, 1990) p. 14].