qiskit-camp-europe-19
qiskit-camp-europe-19 copied to clipboard
qiskit-community
A Quantum Approach to the Rendezvous Problem
Abstract
The Rendezvous Problem is a combinatorics problem where throwing two people into a maze with n rooms one wishes to establish strategies for them to meet with some definite probability. This problem is typically visualised as a complete bipartite graph and no one has tried to give the people the ability to quantum random walk on this graph!
Description
The goal will be to establish definite probabilities for these people to meet in the maze using our quantum strategy, for cases where we can encode the graph into an adjacency matrix which a quantum computer can deal with.
Members
- @jqed-xuereb
- @standaskoupy
- @rowanshah
- @QuantumKey
- @armandaoq
- IBM Coach: @anedumla
Deliverable
Probabilities!
GitHub repo
https://github.com/rowanshah/Qiskit-Quantum-Approach-To-Rendezvous-Probelem https://github.com/rowanshah/Quantum-Approach-To-Rendezvous-Problem-Using-Qiskit
#Resources weber-k3.pdf
