Related papers: Accelerating the CM method

The modular degree m_E of an elliptic curve E/Q is the minimal degree of any surjective morphism X_0(N) -> E, where N is the conductor of E. We give a necessarily set of criteria for m_E to be odd. Specializing to N prime our results imply…

We propose an algorithm for computing an isogeny between two elliptic curves $E_1,E_2$ defined over a finite field such that there is an imaginary quadratic order $\mathcal{O}$ satisfying $\mathcal{O}\simeq \operatorname{End}(E_i)$ for $i =…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

We develop a static quantum embedding scheme that utilizes different levels of approximations to coupled cluster (CC) theory for an active fragment region and its environment. To reduce the computational cost, we solve the local fragment…

An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…

Solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) is critical for evaluating the quantum security of widely deployed elliptic-curve cryptosystems. Consequently, minimizing the number of logical qubits required to execute this…

The efficient and accurate QR decomposition for matrices with hierarchical low-rank structures, such as HODLR and hierarchical matrices, has been challenging. Existing structure-exploiting algorithms are prone to numerical instability as…

For a prime number $p$, we study the asymptotic distribution of CM points on the moduli space of elliptic curves over $\mathbb{C}_p$. In stark contrast to the complex case, in the $p$-adic setting there are infinitely many different…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

The Reed-Muller (RM) code encoding $n$-variate degree-$d$ polynomials over ${\mathbb F}_q$ for $d < q$, with its evaluation on ${\mathbb F}_q^n$, has relative distance $1-d/q$ and can be list decoded from a $1-O(\sqrt{d/q})$ fraction of…

Let $\mathbb{F}_q$ denote a finite field of characteristic $p \geq 5$ and let $d = q+1$. Let $E_d$ denote the elliptic curve over the function field $\mathbb{F}_{q^2}(t)$ defined by the equation $y^2 + xy - t^d y = x^3$. Its rank is $q$…

The high-frequency Helmholtz equation on the entire space is truncated into a bounded domain using the perfectly matched layer (PML) technique and subsequently, discretized by the higher-order finite element method (FEM) and the continuous…

Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…

The quantum period-finding (QPF) algorithm can compute the period of a function exponentially faster than the best-known classical algorithm. In standard QPF, the output state has a primary contribution from $r$ high-probability bit…

We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder architecture…

While the proper orthogonal decomposition (POD) is optimal under certain norms it's also expensive to compute. For large matrix sizes, it is well known that the QR decomposition provides a tractable alternative. Under the assumption that it…

In this work, we give a polynomial-time quantum algorithm for solving the ground states of a class of classically hard Hamiltonians. The mechanism of the exponential speedup that appeared in our algorithm comes from dissipation in open…

Consider an ordinary elliptic curve $E_b\!: y^2 = x^3 - b$ (of $j$-invariant $0$) over a finite field $\mathbb{F}_{\!q}$ such that $\sqrt[3]{b} \notin \mathbb{F}_{\!q}$. This article tries to resolve the problem of constructing a rational…

Let $X_0^6(1)/W_6$ be the Atkin-Lehner quotient of the Shimura curve $X_0^6(1)$ associated to a maximal order in an indefinite quaternion algebra of discriminant $6$ over $\mathbb Q$. By realizing modular forms on $X_0^6(1)/W_6$ in two…

The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as…