.png){kind=icon}
Return
Photonic NP-Complete Problem Solver Enabled by Local Spatial Frequency Encoding
.png){kind=icon}
PRE
AI
DOI：10.1021/acsphotonics.4c01795.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the absence of known polynomial-time algorithms, NP-complete (NPC) problems, such as the subset sum problem (SSP), pose a significant challenge for electronic computers. Optical approaches, known for their inherent parallelism, low latency, and reduced power consumption, present a promising alternative. However, existing diffractive networks (DNNs) are limited to achieving only polynomial-level parallelism. In this work, we introduce an SSP solver that achieves exponential parallelism, allowing the SSP problem to be solved within polynomial time (volume). By using beam splitting in a synthetic polarization dimension to maintain a single localized optical spot and encoding spatial frequencies onto this spot, the solutions can be successfully searched in parallel. Moreover, unlike other spatial optical computing systems that require substantial thickness due to overlapping nonlocality (ONL), our system can remain remarkably thin. This thinness enables the addition of more layers without increasing the overall size, facilitating efficient 3D stacking. We have conducted a proof-of-principle experimental demonstration and discussed the advantages of our method over other state-of-the-art solutions. This work lays a strong foundation for the exploration of novel paradigms to fully utilize the parallelism of optical computing.
Keywords:
optical computing
subset sum problem
NP-completeproblem
metasurface
Journal
IF:
6.7
Papers:
5.6K
Citations:
2.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more