top | item 44675398

(no title)

djsavvy | 7 months ago

Very hot take but this result made me believe that BQP and P might be equivalent computational classes (in other words, quantum computers might not offer any computational complexity speedups at all). I found out about this result in college and implemented the algorithm described in the paper for a class project, though I don't remember the code working very well haha

discuss

order

No comments yet.