New optimization tutorial: Drone Route Optimization with QAOA #182
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary
This PR introduces a new tutorial: Drone Route Optimization using QAOA, added to the
optimizationfolder.The tutorial demonstrates how to map a real-world drone delivery routing problem into the combinatorial optimization problem Traveling Salesman Problem (TSP), formulate it as a QUBO/Ising Hamiltonian, and solve it using the Quantum Approximate Optimization Algorithm (QAOA) in Qiskit.
Objectives
Prerequisites
Details and comments
Changelog
optimization/.Checklist