Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
arXiv:1209.6348
Abstract
Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this paper we show that changing the curve representation allows a substantial reduction in the number of T-gates needed to implement the curve arithmetic. As a tool, we present a quantum circuit for computing multiplicative inverses in GF(2^n) in depth O(n log n) using a polynomial basis representation, which may be of independent interest.
arXiv comment14 pages
References in corpus (5)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- High threshold universal quantum computation on the surface code
- Quantum Arithmetic on Galois Fields
- Optimized quantum implementation of elliptic curve arithmetic over binary fields