Hidden Translation and Translating Coset in Quantum Computing

DOI10.1137/130907203zbMath1359.68088arXivquant-ph/0211091OpenAlexW3101108974MaRDI QIDQ5419027

Miklos Santha, Gábor Ivanyos, Frédéric Magniez, Katalin Friedl, Pranab Sen

Publication date: 4 June 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum algorithmssolvable groupshidden subgroup problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (7)

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version ⋮ Zero sum subsequences and hidden subgroups ⋮ Quantum Algorithms for a Set of Group Theoretic Problems ⋮ Простейшие надгруппы регулярных представлений неабелевых $2$-групп с циклической подгруппой индекса $2$ ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts ⋮ A fusion algorithm for solving the hidden shift problem in finite abelian groups

This page was built for publication: Hidden Translation and Translating Coset in Quantum Computing