История

DmitryVasilevsky 483b6984c8 Updated to QDK version 0.25.228311 (August 2022) (#834 ) Co-authored-by: Dmitry Vasilevsky <dmitryv@microsoft.com>		2022-09-08 11:52:39 -07:00
..
.vscode	Add DevSkim scanning and resolve initial alerts (#778 )	2022-04-22 16:47:21 -07:00
README.md	Update format for Binder links (#656 )	2021-09-10 17:19:16 -07:00
ReferenceImplementation.qs	Updates to new array creation syntax, part 2 (#739 )	2022-01-26 16:12:29 -08:00
SolveSATWithGrover.csproj	Updated to QDK version 0.25.228311 (August 2022) (#834 )	2022-09-08 11:52:39 -07:00
SolveSATWithGrover.ipynb	Updates to new array creation syntax, part 3 (#762 )	2022-03-14 10:31:37 -07:00
SolveSATWithGrover.sln	Add "Solving SAT problems using Grover's search algorithm" kata (#79 )	2019-03-08 13:01:19 -08:00
Tasks.qs	Update to new array creation syntax (#709 )	2021-12-14 13:55:41 -08:00
Tests.qs	Update to new array creation syntax (#709 )	2021-12-14 13:55:41 -08:00
Workbook_SolveSATWithGrover.ipynb	Updates to new array creation syntax, part 3 (#762 )	2022-03-14 10:31:37 -07:00

README.md

Welcome!

This kata continues the exploration of the Grover's search algorithm started in the Grover's Algorithm kata. It teaches writing oracles for the algorithm which describe the problem instead of the solution, using SAT problem as an example. Then it takes the implementation of the Grover's search to the next level, covering the problems with unknown number of solutions.

You can run the SolveSATWithGrover kata as a Jupyter Notebook!

It is strongly recommended to complete the Grover's Algorithm kata before proceeding to this one. You can also refer to its README.md for the list of resources on Grover's algorithm.