Is Grover's algorithm a quantum hidden subgroup algorithm?

DOI10.1007/s11128-007-0066-1zbMath1137.81006arXivquant-ph/0603140OpenAlexW1981560782MaRDI QIDQ2467208

Louis H. Kauffman, S. J. jun. Lomonaco

Publication date: 21 January 2008

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

quantum algorithmsGrover's algorithmhidden subgroup problemsShor's algorithmhidden subgroup algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99)

Related Items (3)

Zero sum subsequences and hidden subgroups ⋮ Multiparty controlled quantum secure direct communication based on quantum search algorithm ⋮ On the role of dealing with quantum coherence in amplitude amplification

Cites Work

• Normal subgroup reconstruction and quantum computation using group representations
• Quantum algorithms and the Fourier transform
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Is Grover's algorithm a quantum hidden subgroup algorithm?