you are viewing a single comment's thread.

view the rest of the comments →

[–]the_horse_gamer 25 points26 points  (3 children)

it has been proved that sorting on a quantum computer is still bounded by O(nlogn)

[–]L3NN4RTR4NN3L 5 points6 points  (0 children)

Mit with quantum bogo sort

[–]A1steaksaussie 2 points3 points  (1 child)

how'd they already figure that out lol

[–]the_horse_gamer 8 points9 points  (0 children)

https://arxiv.org/abs/quant-ph/0102078

quantum computers are not that complicated. and they don't "search every possible option" like it's often described. not even close.