Related papers: Elliptic Curves in Continuous-Variable Quantum Sys…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…
In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…
We give a generalization of the method of "Elliptic Curve Chabauty" to higher genus curves and their Jacobians. This method can sometimes be used in conjunction with covering techniques and a modified version of the Mordell-Weil sieve to…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…
We expose the elliptic quantum groups in the Drinfeld realization associated with both the affine Lie algebra \g and the toroidal algebra \g_tor. There the level-0 and level \not=0 representations appear in a unified way so that one can…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
By encoding a qudit in a harmonic oscillator and investigating the infinite limit, we give an entirely new realization of continuous-variable quantum computation. The generalized Pauli group is generated by number and phase operators for…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…
We associate a half-integer number, called {\em the quantum index}, to algebraic curves in the real plane satisfying to certain conditions. The area encompassed by the logarithmic image of such curves is equal to $\pi^2$ times the quantum…
Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…
Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
This article gives an elementary computational proof of the group law for Edwards elliptic curves. The associative law is expressed as a polynomial identity over the integers that is directly checked by polynomial division. Unlike other…
This paper gives additional background in algebraic geometry as an accompaniment to the article, ``Formal Groups, Elliptic Curves, and some Theorems of Couveignes'' [arXiv:math.NT/9708215]. Section 1 discusses the addition law on elliptic…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
In order to exploit quantum advantages, quantum algorithms are indispensable for operating machine learning with quantum computers. We here propose an intriguing hybrid approach of quantum information processing for quantum linear…
In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…