A scalable photonic computer solving the subset sum problem

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Xu, Xiao-Yun, Huang, Xuan-Lun, Li, Zhan-Ming, Gao, Jun, Jiao, Zhi-Qiang, Wang, Yao, Ren, Ruo-Jing, Zhang, H. P., Jin, Xian-Min
Formato: Online Artículo Texto
Lenguaje:English
Publicado: American Association for the Advancement of Science 2020
Materias:
Research Articles
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6994215/
https://www.ncbi.nlm.nih.gov/pubmed/32064352
http://dx.doi.org/10.1126/sciadv.aay5853

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6994215/
https://www.ncbi.nlm.nih.gov/pubmed/32064352
http://dx.doi.org/10.1126/sciadv.aay5853

Ejemplares similares