3 ms·
Graph coloring, SAT problems, eigenvalue minimization. Almost any binary problem where you can write down a cost function.
by reikonomusha 9y ago
Graph coloring, SAT problems, eigenvalue minimization. Almost any binary problem where you can write down a cost function.
- MichaelBurge 9y agoAgain, you're thinking of an NTM not a quantum computer. There are some number theoretic problems, only: https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bqp https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bqp
- moyix 9y agoAre you thinking of the adiabatic QC approach (i.e., the dwave machine)? I think they still haven't been able to show that it's faster than a classical approach for any problem.