Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 27 min ago
PreprintCC BY 4.0arXiv

Nonlinear Spectral Computing

Abstract

Many machine learning algorithms rely on the Fourier transform, which is also the inner core of many analog computing devices and, specifically, of optical computing. The square of the modulus of the Fourier spectrum naturally maps onto pairwise interactions, as in the renowned Ising model, making it applicable to combinatorial optimization. Here we show how the nonlinear Fourier transform, related to integrable nonlinear partial differential equations, significantly widens the computational capability and also enables a wide variety of computing gates. We study specifically the case of the nonlinear Schrödinger equation; we introduce an input composed by ``tokens'', i.e., batches of information encoded in a multi-step potential, and we show how the nonlinear spectral computing arising in the wave propagation not only generalizes combinatorial optimization to higher order problems, but also realizes boolean gates. In the weakly nonlinear regime, nonlinearity generates higher-order interactions as perturbative corrections to the pairwise terms. In the solitonic regime, the discrete nonlinear spectrum performs digital computation through soliton generation. By using four input tokens, we demonstrate the programmability of all 256 Boolean functions of three variables, including 3-SAT instances. Our results show that integrable nonlinear propagation provides an unprecedented single physical platform for higher-order and logical computation, opening the way to a rich variety of new algorithms for analog computing, machine learning, and classical and quantum information processing.

Related

  1. Convergence and acceleration of a nonlinear fixed-point iteration for computing the Fitness Centrality of general graphs
    Nikita Deniskin, Michele Benzi
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Computing Spectral Properties of Differential Operators on Surfaces
    Gustav Conradie, Matthew J. Colbrook, Daniel Fortunato
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. A Fast and High-Accuracy Finite-Time Sliding-Mode Algorithm for Computing Local Stackelberg Equilibria in Nonlinear Bilevel Games
    Abdelhafid Zenati, Dave D Muir, Kamal Youcef-Toumi
    arXivPreprintarXiv licenceFull textDynamical systemsOptimisation & controlarXiv
  4. A spectral-element method for computing many eigenvalues and their asymptotics of the Schrödinger operator with Robin boundary condition
    Weizhu Bao, Fukeng Huang
    arXivPreprintCC BY 4.0Full textMathematical physicsNumerical analysis & scientific computingarXiv
  5. Fully Coupled Nonlinear Forward-Backward Stochastic Difference Equations: Spectral Contraction and Infinite-Horizon Maximum Principle
    Rui Chen, Qi Zhang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{falsi2026nonlinear,
  title = {{Nonlinear Spectral Computing}},
  author = {Ludovica Falsi and Francesco Coppini and Claudio Conti},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09081},
  eprint = {2610.09081},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09081},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Nonlinear Spectral Computing
AU  - Ludovica Falsi
AU  - Francesco Coppini
AU  - Claudio Conti
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2610.09081
UR  - https://arxiv.org/abs/2610.09081
AB  - Many machine learning algorithms rely on the Fourier transform, which is also the inner core of many analog computing devices and, specifically, of optical computing. The square of the modulus of the Fourier spectrum naturally maps onto pairwise interactions, as in the renowned Ising model, making it applicable to combinatorial optimization. Here we show how the nonlinear Fourier transform, related to integrable nonlinear partial differential equations, significantly widens the computational capability and also enables a wide variety of computing gates. We study specifically the case of the nonlinear Schrödinger equation; we introduce an input composed by ``tokens'', i.e., batches of information encoded in a multi-step potential, and we show how the nonlinear spectral computing arising in the wave propagation not only generalizes combinatorial optimization to higher order problems, but also realizes boolean gates. In the weakly nonlinear regime, nonlinearity generates higher-order interactions as perturbative corrections to the pairwise terms. In the solitonic regime, the discrete nonlinear spectrum performs digital computation through soliton generation. By using four input tokens, we demonstrate the programmability of all 256 Boolean functions of three variables, including 3-SAT instances. Our results show that integrable nonlinear propagation provides an unprecedented single physical platform for higher-order and logical computation, opening the way to a rich variety of new algorithms for analog computing, machine learning, and classical and quantum information processing.
ER  -