>>13684450>the limits of a quantum computerunironically this is computer science research. it's pretty difficult.
The basic gist is this:
1) Lots of classically hard problems related to optimization and chemistry have interesting speed ups. Crudely, you can think of this as being due to the fact that quantum states can manipulate classically exponentially large state spaces, but there are a few nonclassical effects / phenomena you have to deal with. The basic tools we have are relating quantum circuits, which describe the dynamics of a quantum system, to descriptions of the energies of the ground states of Hamiltonians, which is ultimately a statics problem.
2) NP-hard problems are not expected to be efficiently solvable by a quantum computer. You don't get the speedup you quite need to break that barrier. I know the naive question would be to ask
>if you can efficiently encode and manipulate exponentially large state spaces into a quantum state, can't you just exhaustively enumerate an NP-hard problemthe answer is no, and it's not no due to engineering constraints. It's no because of hardline quantum information theorems.
I'll continue this in another post.
