-
Notifications
You must be signed in to change notification settings - Fork 5
/
grover.py
68 lines (52 loc) · 1.64 KB
/
grover.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#!/usr/bin/python
#
# qclib - Quantum Computing library for Python
# Copyright (C) 2006 Robert Nowotniak <[email protected]>
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
from qclib import *
import sys
N = 2 ** 3
n = N - 3
steps = int(floor(math.pi * 1.0/(math.asin(sqrt(1.0 / N))) / 4))
print 'Total numer of steps: ' + str(steps)
print
# identity gate
I = Identity(3)
w0 = Ket(n)
# initial state of quantum register
phi0 = QRegister([ones(N) / sqrt(N)])
# computation gates
A = I - 2 * w0.outer(w0)
B = 2 * phi0.outer(phi0) - I
phi = phi0
step = 0
print A*B
while step <= steps:
print 'Step number: ' + str(step)
print '----------------'
print 'Probability of search success: ',
print '%0.4f' % abs(float(phi.matrix[n]))**2
print
if step < steps:
phi = B(A(phi))
step += 1
print 'Final quantum register |phi> state: '
print phi
print
print 'Probability of search success: ',
print '%0.4f' % abs(float(phi.matrix[n]))**2
print
print 'Correct element: ', n
print 'State after measurement: ', phi.measure().dirac(binary = False)