Search All Patents in Quantum Computing
Patent US10430162
Issued 2019-10-01
Quantum Resource Estimates For Computing Elliptic Curve Discrete Logarithms
In this application, example methods for performing quantum Montgomery arithmetic are disclosed. Additionally, circuit implementations are disclosed for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. This application also shows that elliptic curve discrete logarithms on an elliptic curve defined over an n-bit prime field can be computed on a quantum computer with at most 9n+2┌log2(n)┐+10 qubits using a quantum circuit of at most 512n3 log2(n)+3572n3 Toffoli gates.
Much More than Average Length Specification
View the Patent Matrix® Diagram to Explore the Claim Relationships
USPTO Full Text Publication >
- 1. A computer-implemented method, comprising:
inputting a prime number; generating reversible circuit designs for performing a modular arithmetic operation on the prime number, the modular arithmetic operation being one of addition, subtraction, multiplication, or division; and storing the reversible circuit designs as quantum-computer executable instructions.
- 9. A quantum computing device configured to implement a sequence of reversible circuits that in combination, perform a modular arithmetic operation on a prime number, the modular arithmetic operation being one of addition, subtraction, multiplication, or division.
