Combinatorial optimization using Quantum Approximate Optimization Algorithm(QAOA). The Maximum cut problem is known to be NP-hard, QAOA is a general technique that harnesses the power of quantum computing to find a solution(approximate) to the combinatorial optimization problem.
-
Notifications
You must be signed in to change notification settings - Fork 1
ayush-vatsal/QML_Maxcut_using_QAOA
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Combinatorial optimization using Quantum Approximate Optimization Algorithm(QAOA).
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published