Travelling Salesman Problem Quantum Benchmark
QAOA / Variational Quantum Eigensolver (VQE) · Optimization · 30 qubits · Qiskit, PennyLane, D-Wave Ocean
Benchmark of quantum approaches to the Travelling Salesman Problem, a canonical NP-hard combinatorial optimization task. Instances are encoded as QUBO/Ising Hamiltonians and solved using QAOA or VQE on gate-based hardware, or via quantum annealing. Current NISQ-era implementations handle instances of up to roughly six cities, making TSP a demanding test of quantum optimizer quality.
Benchmark of quantum approaches to the Travelling Salesman Problem, a canonical NP-hard combinatorial optimization task. Instances are encoded as QUBO/Ising Hamiltonians and solved using QAOA or VQE on gate-based hardware, or via quantum annealing. Current NISQ-era implementations handle instances of up to roughly six cities, making TSP a demanding test of quantum optimizer quality.
Exposes the harsh scaling reality of quantum optimization: the most famous NP-hard problem remains limited to toy sizes on current quantum hardware.
Various (IBM Quantum, D-Wave, simulators)
Qiskit, PennyLane, D-Wave Ocean