This adds implementation for creating a QAOA circuit for Polynomial Unconstrained Binary Optimization (PUBO) problems, as well as for calculating the corresponding penalty for arbitrary SAT instances in conjunctive form.
The new qaoa_mincost_k_sat notebook contains explanations for creating the cost hamiltonian, how to implement the quantum circuit, how to quadratize PUBOs in order to use the corresponding QUBO problem instead and how PUBO models can be used for configuration prioritization.
Furthermore, this adds a new folder for the different files associated with QAOA.
Graphs for the instance evaluated in the notebook:
Cost landscape
QAOA results for PUBO form using StatevectorSimulator
QAOA results for quadratized QUBO form using StatevectorSimulator
This closes #19 and closes #8.
This adds implementation for creating a QAOA circuit for Polynomial Unconstrained Binary Optimization (PUBO) problems, as well as for calculating the corresponding penalty for arbitrary SAT instances in conjunctive form.
The new
qaoa_mincost_k_satnotebook contains explanations for creating the cost hamiltonian, how to implement the quantum circuit, how to quadratize PUBOs in order to use the corresponding QUBO problem instead and how PUBO models can be used for configuration prioritization.Furthermore, this adds a new folder for the different files associated with QAOA.
Graphs for the instance evaluated in the notebook:
Cost landscape
QAOA results for PUBO form using StatevectorSimulator
QAOA results for quadratized QUBO form using StatevectorSimulator