Solve secret santa with Grover

This repo contains the code which was used by this and this blog post. It shows how to solve a secret sant raffle using the Grover Search algorithm. When executed the program will try to find a solution for 3 and 4 players, then prints the results to the terminal. The output should look like this:

  |A    |B    |C    |D
A |  X  |false|true |false|
B |false|  X  |false|true |
C |true |false|  X  |false|
D |false|true |false|  X  |

This means that player C should get a small git for player A, player D for B, etc.

How to use

• Make sure you have .net core 3.X and the QDK (Quantum development kit from Microsoft) installed.
• Command line:
  • Inside the root folder of this project execute the project with dotnet run --num-players 3 (you can also simulate for 4 players), or open the solution in visual studio and run it from there.
• Python web app
  • Install the dependencies using pip install -r requirements.txt
  • in the root folder run uvicorn host:app --reload
• Docker, there is a Docker file which you can use to build a container.

Screen shot of web app