- The University of Western AustraliaAU2 papers
- Budapest University of Technology and EconomicsHU1 paper
- Centre for Quantum TechnologiesSG1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Hungarian Academy of SciencesHU1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- National University of SingaporeSG1 paper
- Université Paris-SudFR1 paper
Showing quant-phShow all
3 papers · 1 filter
quant-ph2007★ 1 cited
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Gábor Ivanyos, Luc Sanselme, Miklos Santha
In this paper we extend the algorithm for extraspecial groups in \cite{iss07}, and show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at m…
quant-ph2007★ 1 cited
On solving systems of random linear disequations
Gabor Ivanyos
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building bl…
quant-ph2005
On the black-box complexity of Sperner's Lemma
Katalin Friedl, Gabor Ivanyos, Miklos Santha +1
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ps…