Determining constants in Shor`s discrete log algorithm over Zp
Conference
·
OSTI ID:464483
We compute the number of gates and laser pulses required in Shor`s algorithm for finding {ital r} in the equation {ital g{sup r} = x(mod p)} where {ital p} is a prime, and {ital g} and {ital x} are given elements of the multiplicative group {ital Z{sup *}{sub p}}. Because the discrete logarithm algorithm is similar to the factoring algorithm we may utilize gates designed for use in factoring.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 464483
- Report Number(s):
- LA-UR--96-3793; CONF-9611146--1; ON: DE97002350
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scalability of Shor's algorithm with a limited set of rotation gates
Implementing Shor's algorithm on Josephson charge qubits
Quantum computation and Shor{close_quote}s factoring algorithm
Journal Article
·
Wed Sep 01 00:00:00 EDT 2004
· Physical Review. A
·
OSTI ID:20646034
Implementing Shor's algorithm on Josephson charge qubits
Journal Article
·
Thu Jul 01 00:00:00 EDT 2004
· Physical Review. A
·
OSTI ID:20643891
Quantum computation and Shor{close_quote}s factoring algorithm
Journal Article
·
Mon Jul 01 00:00:00 EDT 1996
· Reviews of Modern Physics
·
OSTI ID:287011