Quantum superiority for verifying NP-complete problems with linear optics
10.1038/s41534-018-0103-1
Saved in:
Main Authors: | Arrazola, J.M., Diamanti, E., Kerenidis, I. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Article |
Published: |
Nature Partner Journals
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/210077 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
An optical fiber network oracle for NP-complete problems
by: Shum, Perry Ping, et al.
Published: (2015) -
The Time Dependent Machine Makespan Problem Is Strongly Np-Complete
by: Cheng, T. C. E., et al.
Published: (1999) -
Optical NP problem solver on laser-written waveguide platform
by: Vázquez, María Ramos, et al.
Published: (2019) -
Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
by: Kyriienko, O., et al.
Published: (2019) -
Unconditionally verifiable blind quantum computation
by: Fitzsimons, J.F, et al.
Published: (2020)