Qiskit technical challenge 1 - Exploring Knapsack problem with VQE, QAOA using Qiskit

[0sophy1]

Abstract

The knapsack problem is a problem in combinatorial optimization: Given a set of items, find a subset of items such that the total weight is within the capacity and the total value is maximized.

Description

Qiskit has the Application Classes for Knapsack problem, but let’s solve it by VQE and QAOA with Qiskit Terra. You can learn how it works and improve the solution by changing your original variational forms (ansatz) and exploring the new qiskit functions.

Basic Task

• Compare the solution of the knapsack problem between VQE, QAOA with Qiskit Terra, and qiskit application class.
• Explore the solution by modifying the variational forms, using mixer function, etc.
• Try the qiskit runtime function of VQE if you can use it.
• Try the qiskit warm start function of QAOA.

Advanced Task

• Try to solve using the real quantum device with small problem set.

Reference:https://qiskit.org/documentation/optimization/tutorials/09_application_classes.html

Members

• @githubhandle
• @githubhandle - Slack: @slackhandle email: example@example.com
• Qiskit Coach: @kifumi

Deliverable

GitHub repo

[kifumi]

Here is a good reference: https://arxiv.org/pdf/1302.5843.pdf. There is the Hamiltonian on page 14-15.