Towards the Information-Theoretic Limit of Programmable Photonics
Ryan Hamerly, Jasvith Raj Basani, Alexander Sludds, Sri Krishna Vadlamani, Dirk Englund
TL;DR
This work establishes an information-theoretic limit on the average phase shift required for universal programmable photonic circuits, showing a fundamental $O(1/\sqrt{N})$ scaling with circuit size. It then demonstrates that a 3-MZI mesh can approach this limit within a factor of about 2, achieving a practical $\sim$10× reduction in average phase shift compared to traditional MZI meshes, and proves that non-unitary (Gaussian) targets can saturate the bound using crossbar architectures. The authors also show that optical neural networks can be trained with all phase shifters constrained to $\lesssim 0.2$ radians without accuracy loss, highlighting the method’s potential for scalable photonic computing. Collectively, the results provide near-optimal, phase-efficient designs for large-scale photonic circuits and new routes for phase-constrained photonic learning and processing.
Abstract
The scalability of many programmable photonic circuits is limited by the $2π$ tuning range needed for the constituent phase shifters. To address this problem, we introduce the concept of a phase-efficient circuit architecture, where the average phase shift is $\ll 2π$. We derive a universal information-theoretic limit to the phase-shift efficiency of universal multiport interferometers, and propose a "3-MZI" architecture that approaches this limit to within a factor of $2\times$, approximately a $10\times$ reduction in average phase shift over the prior art, where the average phase shift scales inversely with system size as $O(1/\sqrt{N})$. For non-unitary circuits, we show that the 3-MZI saturates the theoretical bound for Gaussian-distributed target matrices. Using this architecture, we show optical neural network training with all phase shifters constrained to $\lesssim 0.2$ radians without loss of accuracy.
