Work

Determining constants in Shor`s discrete log algorithm over Zp

Year: 1996

Type: conference-paper

Abstract: 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.

Source: University of North Texas Digital Library (University of North Texas)

Authors: Jean Ettinger, M. Neergaard

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W73929454

FWCI:

Cites:

Cited by:

Related to: 10