История

Alex Hansen 4e74bcdf70 update QDK version (#892 )		2023-09-19 11:43:09 -07:00
..
BoundedKnapsack.csproj	update QDK version (#892 )	2023-09-19 11:43:09 -07:00
BoundedKnapsack.ipynb	[MarkingOracles] Add Jupyter Notebook frontend (#871 )	2023-02-13 09:35:33 -08:00
BoundedKnapsack.sln	Create new kata: Bounded Knapsack (#457 )	2021-07-15 15:45:42 -07:00
Hints.md	Create new kata: Bounded Knapsack (#457 )	2021-07-15 15:45:42 -07:00
README.md	Create new kata: Bounded Knapsack (#457 )	2021-07-15 15:45:42 -07:00
ReferenceImplementation.qs	Remove parenthesis around the condition in the if block (#851 )	2022-11-03 16:42:36 -07:00
Tasks.qs	Updates to new array creation syntax, part 2 (#739 )	2022-01-26 16:12:29 -08:00
Tests.qs	Remove parenthesis around the condition in the if block (#851 )	2022-11-03 16:42:36 -07:00

README.md

Welcome!

The "BoundedKnapsack" quantum kata is a series of exercises designed to teach you to use Grover's search algorithm to solve the knapsack problem - a prominent computational problem that is very applicable in industries like e-commerce. The overall goal in this kata is to solve the knapsack optimization problem by running Grover's algorithm. You will implement oracles that implement various parts of the knapsack problem, and use these oracles with Grover's algorithm to solve the problem.

More information on the knapsack problem can be found on Wikipedia.
It is strongly recommended to complete the Grover's Algorithm kata before proceeding to this one. You can also refer to its README for the list of resources on Grover's algorithm.
You may find this kata to be more challenging than other Grover search katas, so you might want to complete SolveSATWithGrover or GraphColoring first.
Much of the reference implementation provided in this kata is based on the circuits described in the paper "Quantum-based algorithm and circuit design for bounded knapsack optimization problem" by Wenjun Hou and Marek Perkowski in the journal Quantum Information and Computation.