daniel/quantum
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

few grover's hints

Browse Source
This commit is contained in:
Daniel Tsvetkov 2020-03-29 12:53:34 +02:00
parent 08bce98b6d
commit 67cd000f5a
1 changed files with 12 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
grover.py
View File

@ -1,3 +1,5 @@
# Full circuit + example: https://cstheory.stackexchange.com/questions/38538/oracle-construction-for-grovers-algorithm
# X-Axis control: https://algassert.com/post/1706
# http://twistedoakstudios.com/blog/Post2644_grovers-quantum-search-algorithm
import itertools
import random
@ -32,8 +34,7 @@ def classical_func_search_single_rv(func, input_range):
return rv
def _3sat(params):
# https://cstheory.stackexchange.com/questions/38538/oracle-construction-for-grovers-algorithm
def _3sat_old(params):
# 3-SAT from here: https://qiskit.org/textbook/ch-applications/satisfiability-grover.html
x1, x2, x3 = params
return (not x1 or not x2 or not x3) and \
@ -42,10 +43,18 @@ def _3sat(params):
(x1 or not x2 or not x3) and \
(not x1 or x2 or x3)
def _3sat(params):
# 3-SAT from here: https://cstheory.stackexchange.com/questions/38538/oracle-construction-for-grovers-algorithm
x1, x2, x3, x4 = params
return (not x1 or not x3 or not x4) and \
(x2 or x3 or not x4) and \
(x1 or not x2 or x4) and \
(x1 or x3 or x4) and \
(not x1 or x2 or not x3)
def classical_3sat(func):
# Generate all possible true/false tupples for the 3-sat problem
input_range = list(itertools.product([True, False], repeat=3))
input_range = list(itertools.product([True, False], repeat=4))
random.shuffle(input_range)
return classical_func_search_multi_rv(func, input_range)