Related papers: ECM factorization with QRT maps

As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing…

Let $\mathcal{E}$ be a CM elliptic curve defined over a number field $K$, with Weiestrass form $y^3=x^3+bx$ or $y^2=x^3+c$. For every positive integer $m$, we denote by ${\mathcal{E}}[m]$ the $m$-torsion subgroup of ${\mathcal{E}}$ and by…

We employ an algebraic procedure based on quantum mechanics to propose a `quantum number theory' (QNT) as a possible extension of the `classical number theory'. We built our QNT by defining pure quantum number operators ($q$-numbers) of a…

In the past years, research on Shor's algorithm for solving elliptic curves for discrete logarithm problems (Shor's ECDLP), the basis for cracking elliptic curve-based cryptosystems (ECC), has started to garner more significant interest. To…

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…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. In this article, we classify all groups that can arise as $E(\mathbb{Q}(\zeta_p))_{\text{tors}}$ up to isomorphism for any prime $p$. When $p - 1$ is not divisible by small integers…

We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model…

We show that elliptic curves with complex multiplication (CM) naturally emerge in the spectral geometry of Hermitian one-matrix models in the two-cut phase. Focusing on a symmetric quartic potential, we derive the corresponding genus-one…

A fundamental problem when adding column pivoting to the Householder QR factorization is that only about half of the computation can be cast in terms of high performing matrix-matrix multiplications, which greatly limits the benefits that…

Assume $X$ is a variety for which the elliptic stable envelope exists. In this note we construct natural $q$-difference equations from the elliptic stable envelope of $X$. In examples, these equations coincide with the quantum difference…

Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…

Factorizing large matrices by QR with column pivoting (QRCP) is substantially more expensive than QR without pivoting, owing to communication costs required for pivoting decisions. In contrast, randomized QRCP (RQRCP) algorithms have proven…

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…

Quantum random access memory (QRAM) enables efficient classical data access for quantum computers -- a prerequisite for many quantum algorithms to achieve quantum speedup. Despite various proposals, the experimental realization of QRAM…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our…

Given a matrix $A$ of size $m\times n$, the manuscript describes a algorithm for computing a QR factorization $AP=QR$ where $P$ is a permutation matrix, $Q$ is orthonormal, and $R$ is upper triangular. The algorithm is blocked, to allow it…

Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…

Alternatively to the full reconstruction of an unknown quantum process, the so-called selective and efficient quantum process tomography (SEQPT) allows estimating, individually and up to the required accuracy, a given element of the matrix…

Recent advancements in quantum hardware have enabled the realization of high-dimensional quantum states. This work investigates the potential of qutrits in quantum machine learning, leveraging their larger state space for enhanced…