pith. sign in

arxiv: quant-ph/0109004 · v1 · submitted 2001-09-02 · 🪐 quant-ph · hep-th· math-ph· math.MP

Quantum Computing and Shor`s Factoring Algorithm

classification 🪐 quant-ph hep-thmath-phmath.MP
keywords quantumalgorithmcomputingfactoringshoralgorithmscircuitscomplexity
0
0 comments X
read the original abstract

Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm. Factoring integers. NP-complete problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.