Universal Function Approximation via Diffractive Optical Processors: Physical Limits, Error Bounds, and Learnability

Abstract

We present a unified theoretical framework connecting classical universal approximation theory, Fourier-feature approximation, and diffractive optical processors. We show that phase-encoded diffractive processors implement finite Fourier-feature expansions whose mathematical completeness follows from Fourier/Stone-Weierstrass arguments, while their physical realizability is governed by finite coefficient synthesis through optimized spatially varying coherent point-spread functions (PSFs). Our analyses derive approximation-error bounds that separate Fourier truncation, PSF-synthesis, input phase error, optical hardware, readout, and noise contributions; establish scaling relationships linking approximation complexity to optical degrees of freedom and input/output space-bandwidth products; derive photon-budget and throughput limits imposed by photon statistics; formulate finite-class statistical learnability bounds for phase-quantized diffractive function approximators; and analyze the impact of spatially incoherent illumination. We further analyze coherent optical cascadability and show that quadratic feature expansion through coherent mixing and optical readout provides a mechanism for enhanced representation while remaining fundamentally distinct from the depth-separation results established for digital neural networks. Our analyses provide a rigorous theoretical foundation for diffractive nonlinear function approximation and establish quantitative relationships among mathematical expressivity, optical hardware resources, statistical learning, and physical performance limits, thereby offering general design principles for large-scale analog optical computing systems.