Related papers: Elliptic Curves in Continuous-Variable Quantum Sys…
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
We compute quantum cohomology ring of elliptic $\mathbb{P}^1$ orbifolds via orbi-curve counting. The main technique is the classification theorem which relates holomorphic orbi-curves with certain orbifold coverings. The countings of…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the $\mathbb{Z}_2$ surface code. Logical qubits can be encoded in a variety of ways in the surface…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
We study the elliptic modular surface attached to the commutator subgroup of the modular group. This has an elliptic curve as base and only one singular fibre. We employ an algebraic approach and then consider some arithmetic questions.
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…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
Quispel-Roberts-Thompson (QRT) maps are a family of birational maps of the plane which provide the simplest discrete analogue of an integrable Hamiltonian system, and are associated with elliptic fibrations in terms of biquadratic curves.…
Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations focus on two-level qubits, the underlying physics used in most…
For any quadratic extension $L/K$ of number fields, we prove that there are infinitely many elliptic curves $E$ over $K$ so that the abelian groups $E(K)$ and $E(L)$ both have rank $1$. In particular, there are infinitely many elliptic…
Quantum splines are curves in a Hilbert space or, equivalently, in the corresponding Hilbert projective space, which generalize the notion of Riemannian cubic splines to the quantum domain. In this paper, we present a generalization of this…
Elliptic curve cryptography (ECC) is a widely established cryptographic technique, recognized for its effectiveness and reliability across a broad range of applications such as securing telecommunications or safeguarding cryptocurrency…
NOTE: PAPER WITHDRAWN (See Comments) The Clifford and Local Clifford groups for $d > 2$ dimensional systems have been topics of recent interest due to their applications in graph states, quantum codes, and possible applications in fast…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
This note for the Proceedings of the International Congress of Mathematical Physics gives an account of a construction of an ``elliptic quantum group'' associated with each simple classical Lie algebra. It is closely related to elliptic…
We introduce quantum walks on Cayley graphs of non-Abelian groups. We focus on the easiest case of virtually Abelian groups, and introduce a technique to reduce the quantum walk to an equivalent one on an Abelian group with coin system…
An elliptic curve-based signcryption scheme is introduced in this paper that effectively combines the functionalities of digital signature and encryption, and decreases the computational costs and communication overheads in comparison with…
We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…