Hidden Symmetry Subgroup Problems

DOI10.1137/120864416zbMath1286.68151arXiv1107.2189OpenAlexW2119437895MaRDI QIDQ5396953

Miklos Santha, Gábor Ivanyos, Thomas Decker, Paweł Wocjan

Publication date: 4 February 2014

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

Full work available at URL: https://arxiv.org/abs/1107.2189

zbMATH Keywords

quantum algorithmshidden subgroup problemhidden polynomial problem

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ Sample complexity of hidden subgroup problem ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ Solving systems of diagonal polynomial equations over finite fields ⋮ Deterministic algorithms for the hidden subgroup problem

This page was built for publication: Hidden Symmetry Subgroup Problems