$N$-dimensional discrete Fourier transform via bosonic Hamiltonian

• URL: http://arxiv.org/abs/2609.05644v1
• Date: Fri, 04 Sep 2026 18:27:26 GMT
• Title: $N$-dimensional discrete Fourier transform via bosonic Hamiltonian
• Abstract summary: We propose bosonic Hamiltonians that realize the $N$-dimensional DFT through a single stage of multimode evolution.<n>We show that the scaling law for implementing the $N$-dimensional DFT with our building blocks is $mathcalO(NloglogN)$.
• Score: 33.72751145910978
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Flash EQ-Linear: Accelerating Equivariant Linear Layers via Group-wise Discrete Fourier Transform [65.89510337046077]
  Equivariant networks embed geometric symmetries as structural priors through weight sharing.<n>Existing implementations unroll the structured weights into dense matrices and dispatch them to generic dense kernels.<n>This is the first time equivariant networks strictly dominate their non-equivariant counterparts along all three axes simultaneously.
  arXiv  Detail & Related papers  (2026-07-23T12:45:21Z)
• Physics-Informed Neural Networks for Computing the Morse Index of the Critical Catenoid [0.0]
  A Morse index of a free boundary minimal surface is encoded in its Jacobi-Steklov spectrum.<n>We show how a physics-informed neural network reproduces that spectrum on a problem whose answer is already known in closed form.<n>We close by explaining how the same pipeline, with its one-dimensional solver replaced by a two-dimensional one, is poised to address genuinely geometric families in ellipsoidal balls.
  arXiv  Detail & Related papers  (2026-06-19T20:23:17Z)
• Asymptotically Optimal Depth Fermionic Permutation on 2D Grid Quantum Architecture without Ancillas [1.0712892191688657]
  Simulating fermionic systems on qubit hardware involves many nonlocal interactions.<n>Recent works reduce this Jordan-Wigner routing overhead to polylogarithmic depth under all-to-all connectivity.<n>We present a fermionic permutation protocol tailored to 2D grid architectures that achieves the optimal $O(sqrtN)$ depth.
  arXiv  Detail & Related papers  (2026-05-25T17:07:47Z)
• OAM-Induced Lattice Rotation Reveals a Fractional Optimum in Fault-Tolerant GKP Quantum Sensing [0.0]
  We establish that orbital-angular-momentum encoding and Gottesman-Kitaev-Preskill (GKP) lattice geometry are structurally coupled.<n>Using an end-to-end differentiable Strawberry Fields--TensorFlow circuit, we jointly optimise $ell$, the lattice aspect ratio $r$, and the finite-energy envelope $$ to maximise quantum Fisher information.
  arXiv  Detail & Related papers  (2026-05-13T09:49:16Z)
• Learning the Intrinsic Dimensionality of Fermi-Pasta-Ulam-Tsingou Trajectories: A Nonlinear Approach using a Deep Autoencoder Model [0.0]
  We find that the trajectories lie on a nonlinear manifold of dimension $mast = 2$ embedded in a $64$-dimensional phase space.<n>This dimensionality increases to $mast = 3$ at $= 1.1$, coinciding with a symmetry breaking transition.
  arXiv  Detail & Related papers  (2026-01-27T12:59:29Z)
• INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
  We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
  arXiv  Detail & Related papers  (2025-11-16T20:14:28Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Field digitization scaling in a $\mathbb{Z}_N \subset U(1)$ symmetric model [0.0]
  We propose to analyze field digitization by interpreting the parameter $N$ as a coupling in the renormalization group sense.<n>Using effective field theory, we derive generalized scaling hypotheses involving the FD parameter $N$.<n>We analytically prove that our calculations for the 2D classical-statistical $mathbbZ_N$ clock model are directly related to the quantum physics in the ground state of a (2+1)D $mathbbZ_N$ lattice gauge theory.
  arXiv  Detail & Related papers  (2025-07-30T18:00:02Z)
• Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories [70.90012822736988]
  Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to intrinsic data structures. This paper introduces a relaxed assumption that input data are concentrated around a subset of $mathbbRd$ denoted by $mathcalS$, and the intrinsic dimension $mathcalS$ can be characterized by a new complexity notation -- effective Minkowski dimension.
  arXiv  Detail & Related papers  (2023-06-26T17:13:31Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Minimum optical depth multiport interferometers for approximating arbitrary unitary operations and pure states [37.69303106863453]
  We address the problem of, using multiport interferometers, approximating with a given infidelity any pure state preparation and any unitary operation.<n>By means of numerical calculations, we show that pure states, in any dimension $d$, can be prepared with infidelity.
  arXiv  Detail & Related papers  (2020-02-04T15:40:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.