aiqbench analysis
This research proposes a novel photonic architecture using bosonic Hamiltonians to implement N-dimensional discrete Fourier transforms in a single stage, significantly reducing hardware complexity compared to traditional cascaded interferometer designs. By achieving scaling laws of O(N log log N), the method drastically lowers the interferometer count required for high-dimensional operations, offering a promising path toward scalable quantum information processing on integrated circuits.
$N$-dimensional discrete Fourier transform via bosonic Hamiltonian
arXiv:2609.05644v1 Announce Type: new Abstract: 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.
Abstract: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.
arXiv:2609.05644 [quant-ph]
(or arXiv:2609.05644v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.05644 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 322 words
Related coverage

Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
Quantum Journal · Sep 1, 2026
Symmetry-driven correlation patterns in one-dimensional periodic fermionic systems: closed-form expressions and exact selection rules for correlation functions, entanglement entropies and mutual information
arXiv · Sep 18, 2026
From Simple Sources to Quantum Advantage: Homomorphic Polynomial Transduction via Relative Decoding
arXiv · Sep 30, 2026
Self-adjoint extensions of $k$-photon light-matter Hamiltonians
arXiv · Jul 27, 2026