Re:Getting Started with Quantum Computing in Python
by throwaway37585 on Sunday July 22, 2018 @08:11PM
(#17589606)
Also, keep in mind that NP hard ≠ NP complete. By saying 'solve any NP hard problem in polynomial time', you're also saying 'solve any NEXPTIME hard problem in polynomial time', which is known to be false.
[ Parent
| on HN ]
There are no comments on this comment yet.