Hacker News new | ask | show | jobs
by snarkconjecture 773 days ago
Quantum computers are generally more powerful in the sense that they can solve a larger set of problems in polynomial time.

i.e. BPP is contained in BQP but the converse is thought to be false.

1 comments

Yep, they're essentially giant brute force machines. You can find the period of a function by passing all the inputs through it at once and destructively interfering the result.

Why is there a speedup in quantum, though? Why can't you just brute force classically? The answer is that whether quantum or classical, you can always build a hard-coded circuit that essentially swaps the time and space complexity - just make it so that for every operation you were doing in time, instead, every operation happens at its own place in space.

Quantum is special because it also takes the "log" of the space complexity b/c n qubits represent 2^n bits. So quantum lets you swap space with time and then take the log of time, lol. Superposition, interference, etc aren't really even needed in the explanation.