EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS

DOI10.1142/S0219749904000109zbMath1067.81017arXivquant-ph/0301093OpenAlexW2065276051MaRDI QIDQ4674243

Christof Zalka, Michele Mosca

Publication date: 9 May 2005

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0301093

zbMATH Keywords

quantum algorithmsdiscrete logarithm problemexact algorithmsquantum Fourier transformation

Mathematics Subject Classification ID

Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (11)

Quantum Fourier transform over symmetric groups -- improved result ⋮ Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle ⋮ An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs ⋮ Zero sum subsequences and hidden subgroups ⋮ Uniformity of quantum circuit families for error-free algorithms ⋮ A quantum computing primer for operator theorists ⋮ Quantum deduction rules ⋮ Quantum algorithms for algebraic problems ⋮ Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families ⋮ Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots

Cites Work

• Quantum algorithms and the Fourier transform
• Quantum algorithms revisited

This page was built for publication: EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS