Improved quantum circuits for elliptic curve discrete logarithms

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible integer and modular arithmetic through windowing techniques and more adaptive placement of uncomputing steps, and improve over previous quantum circuits for modular inversion by reformulating the binary Euclidean algorithm. Overall, we obtain an affine Weierstrass point addition circuit that has lower depth and uses fewer $T$ gates than previous circuits. While previous work mostly focuses on minimizing the total number of qubits, we present various trade-offs between different cost metrics including the number of qubits, circuit depth and $T$-gate count. Finally, we provide a full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components.

[1]  Isaac Chuang,et al.  High Performance Quantum Modular Multipliers , 2018, ArXiv.

[2]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[3]  Burton S. Kaliski,et al.  The Montgomery Inverse and Its Applications , 1995, IEEE Trans. Computers.

[4]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[5]  Giovanni De Micheli,et al.  Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications , 2019, 2019 56th ACM/IEEE Design Automation Conference (DAC).

[6]  Thomas G. Draper,et al.  A logarithmic-depth quantum carry-lookahead adder , 2006, Quantum Inf. Comput..

[7]  Peter Selinger,et al.  Quantum circuits of T-depth one , 2012, ArXiv.

[8]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

[9]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[10]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[11]  Yasuhiro Takahashi,et al.  Quantum addition circuits and unbounded fan-out , 2009, Quantum Inf. Comput..

[12]  Martin Rötteler,et al.  Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms , 2017, ASIACRYPT.

[13]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Craig Gidney,et al.  Windowed quantum arithmetic , 2019, 1905.07682.

[16]  Griffiths,et al.  Semiclassical Fourier transform for quantum computation. , 1995, Physical review letters.

[17]  Craig Gidney,et al.  How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits , 2019, Quantum.

[18]  Michele Mosca,et al.  Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes , 2019, 1902.02332.

[19]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[20]  Cody Jones,et al.  Low-overhead constructions for the fault-tolerant Toffoli gate , 2012, 1212.5069.

[21]  尚弘 島影.  National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[22]  Craig Gidney,et al.  Halving the cost of quantum addition , 2017, Quantum.

[23]  Cristopher Moore.  Quantum Circuits: Fanout, Parity, and Counting , 1999, Electron. Colloquium Comput. Complex..

[24]  Giovanni De Micheli,et al.  The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits , 2019, 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[25]  Giovanni De Micheli,et al.  Reversible Pebbling Game for Quantum Memory Management , 2019, 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[26]  Christof Zalka,et al.  Shor's discrete logarithm quantum algorithm for elliptic curves , 2003, Quantum Inf. Comput..

[27]  Thomas G. Draper,et al.  A new quantum ripple-carry addition circuit , 2004, quant-ph/0410184.

[28]  Bo-Yin Yang,et al.  Fast constant-time gcd computation and modular inversion , 2019, IACR Cryptol. ePrint Arch..

[29]  Alexandru Paler,et al.  Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity , 2018, Physical Review X.

[30]  Martin Rötteler,et al.  Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL , 2018, RWDSL2018.

[31]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.