In general, are there better ways to encode combinatorial optimization problems, e.g. TSP, than using O(n^2) Qubits and still find optimal solutions (with high probability via Grover)?
Asked
Active
Viewed 36 times
4
Nepomuk Hirsch
- 495
- 2
- 4