231 search results - page 2 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
JOC
2000
13 years 5 months ago
2000
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
QCQC
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
CORR
2000
Springer
13 years 5 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...