Quantum Arithmetic on Galois Fields

Abstract

In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms for factoring and solving the Discrete Log Problem. We describe how to build quantum circuits for performing this operation on the generic Galois fields GF($p^k$), as well as the boundary cases GF($p$) and GF($2^k$). We give the detailed size, width and depth complexity of such circuits, which ultimately will allow us to obtain detailed upper bounds on the amount of quantum resources needed to solve instances of the DLP on such fields.

29 pages, 12 figures. This is the most recent version, dated 11 April 02. Paper only posted now in reply to quant-ph/0301141, whose results are complementary to ours and were obtained independently

Cited by in corpus (5)

• Reversible addition circuit using one ancillary bit with application to quantum computing
• Cosine series quantum sampling method with applications in signal and image processing
• On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
• Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
• Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves