Related papers: Accelerating the CM method

In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic…

In this work, we propose a high-order multiscale method for an elliptic model problem with rough and possibly highly oscillatory coefficients. Convergence rates of higher order are obtained using the regularity of the right-hand side only.…

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in \mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor…

We analyse some QR decomposition algorithms, and show that the I/O complexity of the tile based algorithm is asymptotically the same as that of matrix multiplication. This algorithm, we show, performs the best when the tile size is chosen…

Let $\mathcal{E}$ be an elliptic curve defined over a number field $K$. Let $m$ be a positive integer. We denote by ${\mathcal{E}}[m]$ the $m$-torsion subgroup of $\mathcal{E}$ and by $K_m:=K({\mathcal{E}}[m])$ the number field obtained by…

The computation of \(\operatorname{tr}(AB)\) is essential in quantum science and artificial intelligence, yet classical methods for \( d \)-dimensional matrices \( A \) and \( B \) require \( O(d^2) \) complexity, which becomes infeasible…

For all infinite rings $R$ that are finitely generated over $\mathbb{Z}$, we show that Hilbert's tenth problem has a negative answer. This is accomplished by constructing elliptic curves $E$ without rank growth in certain quadratic…

In this article we perform an extensive study of the spaces of automorphic forms for GL(2) of weight two and level N, for N an ideal in the ring of integers of the quartic CM field generated by the twelfth roots of unity. This study is…

We study congruences of the form F(j(z)) | U(p) = G(j(z)) mod p, where U(p) is the p-th Hecke operator, j is the basic modular invariant 1/q+744+196884q+... for SL2(Z), and F,G are polynomials with integer coefficients. Using the interplay…

For an elliptic curve with CM by $K$ defined over its Hilbert class field, $E/H$, we extend Lenstra's finite fields test to generators of norms of certain ideals in $\mathcal{O}_H$, yielding a sufficient $\widetilde{O}(\log^3 N)$ primality…

Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows…

As quantum computing progresses towards the early fault-tolerant regime, quantum error correction will play a crucial role in protecting qubits and enabling logical Clifford operations. However, the number of logical qubits will initially…

Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…

Let \( E \) be a complex elliptic curve with conductor \( N \) and modular invariant \( j(E) \in \mathbb{Q} \). We construct a class of modular polynomials $F_N(x,j)$ that relate the modular function $x$ on $X_0(N)$ to the $j$-invariant…

Given an elliptic curve $E$ over $\mathbb{Q}$ and non-zero integer $r$, the Lang--Trotter conjecture predicts a striking asymptotic formula for the number of good primes $p\leqslant x$, denoted by $\pi_{E,r}(x)$, such that the Frobenius…

We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid $\mathcal{A}(\text{CM}_n)$ associated to the Cayley-Menger ideal CM$_n$ for $n$ points in 2D. It relies on combinatorial resultants, a new operation…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

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…

Model order reduction (MOR) has long been a mainstream strategy to accelerate large-scale transient circuit simulation. Dynamic Mode Decomposition (DMD) represents a novel data-driven characterization method, extracting dominant dynamical…