Quantum Arithmetic on Galois Fields
| dc.creator | Beauregard, Stephane | |
| dc.creator | Brassard, Gilles | |
| dc.creator | Fernandez, Jose M. | |
| dc.date | 2003-01-29 | |
| dc.date.accessioned | 2026-07-07T06:06:00Z | |
| dc.date.available | 2026-07-07T06:06:00Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0301163 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0301163 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90830 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Arithmetic on Galois Fields | |
| dc.type | text |