Related papers: Elliptic Curves in Continuous-Variable Quantum Sys…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of…
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…
Elliptic curve cryptography (ECC) is a remarkable mathematical tool that offers the same level of security as traditional public-key cryptography (PKC) with a significantly smaller key size and lower computational requirements. The use of…
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be…
The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system…
The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic…
Multiplication is one of the most important operation in Elliptic Curve Cryptography (ECC) arithmetic. For point addition and point doubling in ECC scalar (integer) multiplication is required. In higher order classical (standard)…
Using lower bounds for linear forms in elliptic logarithms we determine the integral points of the modular curve associated to the normalizer of a non-split Cartan group of level 11. As an application we obtain a new solution of the class…
Quantum linear system algorithms (QLSAs) for gate-based quantum computing can provide exponential speedups for solving linear systems but face challenges when applied to finite element problems due to the growth of the condition number with…
In this paper, we develop a new and efficient approach to the computation of envelope surfaces. We interpret one-parameter systems of surfaces as curves in the homogeneous spaces of suitable Lie groups. Using the formalism of Lie groups and…
We study differential operators on an elliptic curve of order higher than 2 which are algebraically integrable (i.e., finite gap). We discuss classification of such operators of order 3 with one pole, discovering exotic operators on special…
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
Importance of Elliptic Curves in Cryptography was independently proposed by Neal Koblitz and Victor Miller in 1985.Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC…
We formulate a problem called \emph{Generalized Root Extraction} in finite Abelian groups that have more than one generator. We then study this problem for the specific case of the torsion subgroups of elliptic curves. We give a necessary…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…
This paper studies fine Selmer groups of elliptic curves in abelian $p$-adic Lie extensions. A class of elliptic curves are provided where both the Selmer group and the fine Selmer group are trivial in the cyclotomic…
An abelian variety admits only a finite number of isomorphism classes of principal polarizations. The paper gives an interpretation of this number in terms of class numbers of definite Hermitian forms in the case of a product of elliptic…