Results 11 to 20 of about 33 (33)
The dihedral hidden subgroup problem
The hidden subgroup problem (HSP) is a cornerstone problem in quantum computing, which captures many problems of interest and provides a standard framework algorithm for their study based on Fourier sampling, one class of techniques known to provide ...
Chen Imin, Sun David
doaj +1 more source
In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source
Pöschl-Teller potentials based solution to Hilbert's tenth problem
Los hipercomputadores computan funciones o números, o en general solucionan problemas que no pueden ser computados o solucionados por una máquina de Turing. Se presenta una adaptación del algoritmo cuántico hipercomputacional propuesto por Tien D.
Andrés Sicard, Juan Ospina
doaj
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Theory of Quantum Subspace Diagonalization
SIAM Journal on Matrix Analysis and Applications, 2022Ethan N Epperly +2 more
exaly

