.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
optical computing
subset sum problem
NP-completeproblem
metasurface
期刊
IF:
6.7
论文数:
5.6K
被引数:
2.5W
机构
引用论文
Matrix Diffractive Deep Neural Networks Merging Polarization into Meta-Devices矩阵衍射深度神经网络将偏振融合到元器件中
PREAI
分享收藏
分享收藏Recent Advances in Tunable Metasurfaces: Materials, Design, and Applications可调谐超表面的最新进展: 材料，设计和应用.png)
ACS NANO
OAAI
ACS NANOIF16
OAAI分享收藏
查看更多内容