Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)
[1][1][1][
53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)
I would need .1 additional TB of ram to accomplish that, however when considering Elliptic curves over finite fields one must consider Hasse's theorem on elliptic curves to include the point at infinity
The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example the curve defined by over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.
Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series
where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, Fqn). The zeta function is a rational function in T.
Moreover,
with complex numbers α, β of absolute value . This result is a special case of the Weil conjectures. For example, the zeta function of E : y2 + y = x3 over the field F2 is given by this follows from:
Also while writing this my CPU died. I couldnt keep the temperatures close enough to absolute zero that my CPU melted into a steaming pile of non-Newtonian fluid.... I think it just blinked at me?
100% Your CPU dead not because You use this algo, I thin you CPU has a damaged cooling system !!! I’m sorry, what your CPU dead. Can your code crac for example 100 bit puzzle ?
P.s. Your work is interesting continue your work please.
No quantum algo some time need a TB memory too.
Regard.