Hacker News new | ask | show | jobs
by wopwops 3085 days ago
Breaking Bitcoin With a Quantum Computer

http://fortune.com/2018/01/06/breaking-bitcoin-cybersaturday...

Quantum Resistant Ledger

https://theqrl.org/
1 comments
lostmsu 3085 days ago
It is unknown if BQP >= NP or NP-complete
link
tromp 3085 days ago
NP-completeness is a property of problems, while BQP is a complexity class (set of problems). If any NP-complete problem is in BQP, then NP is a subset of BQP.

But it's not even known whether BQP > P, so we could have P = BQP < NP.

link