Timeline for Why did Google not use an NP problem for their quantum supremacy experiment?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 30, 2019 at 21:11 | history | mod moved comments to chat | |||
| S Oct 30, 2019 at 21:11 | comment | added | Raphael | Comments are not for extended discussion; this conversation has been moved to chat. | |
| Oct 29, 2019 at 1:58 | comment | added | JoshuaZ | Good answer. Also note that the problem type that is easiest to implement in this sort of quantum supremacy demonstration is a sampling problem. Sampling problems by nature aren't meaningfully in NP since they aren't yes or no questions. | |
| Oct 28, 2019 at 23:42 | comment | added | OmnipotentEntity | Very good answer. To add, the class of problems that Quantum computers are good at are called BQP. | |
| Oct 28, 2019 at 17:27 | history | answered | Tom van der Zanden | CC BY-SA 4.0 |