.png){kind=icon}
返回
A scalable photonic computer solving the subset sum problem
.png){kind=icon}
OA
AI
DOI：10.1126/sciadv.aay5853.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The subset sum problem (SSP) is a typical nondeterministic-polynomial-time (NP)-complete problem that is hard to solve efficiently in time with conventional computers. Photons have the unique features of high propagation speed, strong robustness, and low detectable energy level and therefore can be promising candidates to meet the challenge. Here, we present a scalable chip built-in photonic computer to efficiently solve the SSP. We map the problem into a three-dimensional waveguide network through a femtosecond laser direct writing technique. We show that the photons sufficiently dissipate into the networks and search for solutions in parallel. In the case of successive primes, our approach exhibits a dominant superiority in time consumption even compared with supercomputers. Our results confirm the ability of light to realize computations intractable for conventional computers, and suggest the SSP as a good benchmarking platform for the race between photonic and conventional computers on the way toward photonic supremacy.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.5
论文数:
2.1W
被引数:
18.1W
机构
引用论文
分享收藏On the experimental verification of quantum complexity in linear optics关于线性光学中量子复杂性的实验验证.png)
NATURE PHOTONICSOAAI
NATURE PHOTONICSIF32.9
OAAI分享收藏Memcomputing NP-complete problems in polynomial time using polynomial resources and collective statesSCIENCE ADVANCESOAAI
SCIENCE ADVANCESIF12.5
OAAI分享收藏
查看更多内容