Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring)

From Algorithm Wiki

Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ qubits (https://quantum-computing.ibm.com/composer/docs/iqx/guide/shors-algorithm) == Description == Quantum algorithm == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Quantum == Year == 1994 == Reference == https://ieeexplore.ieee.org/document/365700/")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$ qubits

(https://quantum-computing.ibm.com/composer/docs/iqx/guide/shors-algorithm)

Description

Quantum algorithm

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Quantum

Year

1994

Reference

https://ieeexplore.ieee.org/document/365700/

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shor%27s_algorithm_Quantum_Implementation_(Second_Category_Integer_Factoring_Integer_Factoring)&oldid=45234"