An optical fiber network oracle for NP-complete problems
The modern information society is enabled by photonic fiber networks characterized by huge coverage and great complexity and ranging in size from transcontinental submarine telecommunication cables to fiber to the home and local segments. This world-wide network has yet to match the complexity of th...
Saved in:
Main Authors: | Shum, Perry Ping, García de Abajo, Javier, Soci, Cesare, Wu, Kan, Zheludev, Nikolay I. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2015
|
Online Access: | https://hdl.handle.net/10356/99193 http://hdl.handle.net/10220/38552 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Computing matrix inversion with optical networks
by: Zheludev, Nikolay I., et al.
Published: (2014) -
Optical NP problem solver on laser-written waveguide platform
by: Vázquez, María Ramos, et al.
Published: (2019) -
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
by: Chakraborty, Diptarka, et al.
Published: (2023) -
Using nonlinear optical networks for optimization: primer of the ant colony algorithm
by: Zheludev, Nikolay I., et al.
Published: (2018) -
Quantum superiority for verifying NP-complete problems with linear optics
by: Arrazola, J.M., et al.
Published: (2021)