Related papers: Counting Points on Genus 2 Curves with Real Multip…
Higher order cumulants of point processes, such as skew and kurtosis, require significant computational effort to calculate. The traditional counts-in-cells method implicitly requires a large amount of computation since, for each sampling…
Consider the Jacobian of a hyperelliptic genus two curve defined over a prime field of characteristic p and with complex multiplication. In this paper we show that the p-Sylow subgroup of the Jacobian is either trivial or of order p.
We present a differentiable joint pruning and quantization (DJPQ) scheme. We frame neural network compression as a joint gradient-based optimization problem, trading off between model pruning and quantization automatically for hardware…
We describe an algorithm to compute the zeta function of any non-hyperelliptic genus 3 plane curve $C$ over a finite field with automorphism group $G = \mathbb{Z} / 2 \mathbb{Z}$. This algorithm computes in the Monsky-Washnitzer cohomology…
We determine the rational Chow ring of the universal moduli space of rank $2$ semistable bundles over smooth curves of genus $2$, and show that it is generated by certain tautological classes. In the process, we obtain Chow rings of…
There is presented a method for computing the number of branches of a real analytic curve germ from $R^n$ to $R^m$, where m is greater or equal to n, having a singular point at the origin, and the number of half--branches of the set of…
We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point…
This paper is devoted to constructing an explicit efficient representation for the Jacobian variety of a nonsingular curve of genus greater than 1, and its group law. We describe an algorithm for executing the group law on the Jacobian…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…
We make cohomological computations related to the moduli space of genus three curves with symplectic level two structure by means of counting points over finite fields. In particular, we determine the cohomology groups of the quartic locus…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…
We study the singular locus on the algebraic surface $\S_n$ of genus 2 curves with a $(n, n)$-split Jacobian. Such surface was computed by Shaska in \cite{deg3} for $n=3$, and Shaska at al. in \cite{deg5} for $n=5$. We show that the…
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be…
For the hyperelliptic curve C_p with equation y^2=x(x-2p)(x-p)(x+p)(x+2p) with p a prime number, we discuss bounds for the rank of its Jacobian over Q, find many cases having 2-torsion in the associated Shafarevich-Tate group, and we…
We present efficient algorithms to decide whether two given counting functions on non-abelian free groups or monoids are at bounded distance from each other and to decide whether two given counting quasimorphisms on non-abelian free groups…
In this paper, we give an explicit formula as well as a practical algorithm for computing the Cassels-Tate pairing on $\text{Sel}^{2}(J) \times \text{Sel}^{2}(J)$ where $J$ is the Jacobian variety of a genus two curve under the assumption…
We study stable curves of arithmetic genus 2 which admit two morphisms of finite degree $p$, resp. $d$, onto smooth elliptic curves, with particular attention to the case $p$ prime.
We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.
We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier…
A polynomial map $F=(P,Q)\in \Z [x,y]^2$ with Jacobian $JF:=P_xQ_y-P_yQ_x\equiv 1$ has a polynomial inverse of integer coefficients if the complex plane curve P=0 has infinitely many integer points.