mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-29 10:33:42 +00:00
parent a616dc90ab
commit 656c6b512e
1 changed files with 19 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
quantum/shor_algorithm.py
View File

@ -10,6 +10,8 @@ In this implementation, I have used a very simple construct without
the use of qiskit or cirq to help understand how Shor algorithm's
idea actually works.
"""
class Shor:
def period_find(self, num: int, number: int) -> int:
"""
@ -21,12 +23,12 @@ class Shor:
>>> shor.period_find(3, 7)
6
"""
start:int = 1
start: int = 1
while pow(num, start, number) != 1:
start += 1
return start
def shor_algorithm(self, number:int) -> list[int]:
def shor_algorithm(self, number: int) -> list[int]:
"""
Run Shor's algorithm to factor a number.
>>> shor = Shor()
@ -37,28 +39,24 @@ class Shor:
>>> factors
(3, 5)
"""
if number%2 == 0:
return 2, number//2
if number % 2 == 0:
return 2, number // 2
while True:
random.seed(0)
num:int = random.randint(2, number-1)
gcd_number_num:int = math.gcd(number, num)
num: int = random.randint(2, number - 1)
gcd_number_num: int = math.gcd(number, num)
if gcd_number_num > 1:
return gcd_number_num, number//gcd_number_num
return gcd_number_num, number // gcd_number_num
result:int = self.period_find(num, number)
if not result%2:
start:int = pow(num, result//2, number)
if start != number-1:
p_value:int = math.gcd(start-1, number)
q_value:int = math.gcd(start+1, number)
result: int = self.period_find(num, number)
if not result % 2:
start: int = pow(num, result // 2, number)
if start != number - 1:
p_value: int = math.gcd(start - 1, number)
q_value: int = math.gcd(start + 1, number)
if p_value > 1 and q_value > 1:
return p_value, q_value
shor = Shor()
print(shor.shor_algorithm(15))