71 citations
- Université Paris-SudFR12 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Université Paris CitéFR4 papers
- Centre for Quantum TechnologiesSG3 papers
- Hungarian Academy of SciencesHU3 papers
- Université Paris-SaclayFR3 papers
- HUN-REN Institute for Computer Science and ControlHU2 papers
- National University of SingaporeSG2 papers
- Budapest University of Technology and EconomicsHU1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Développement Adaptation et VieillissementFR1 paper
- Gestion de l'Eau, Acteurs, UsagesFR1 paper
11 papers · 1 filter
Optimal quantum strong coin flipping
André Chailloux, Iordanis Kerenidis
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for p…
Quantum walk based search algorithms
Miklos Santha
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba…
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…
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
Gábor Ivanyos, Luc Sanselme, Miklos Santha
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomia…
Approaches to Quantum Error Correction
Julia Kempe
The purpose of this little survey is to give a simple description of the main approaches to quantum error correction and quantum fault-tolerance. Our goal is to convey the necessar…
Enhanced algorithms for Local Search
Yves F. Verhoeven
Let G=(V,E) be a finite graph, and f:V->N be any function. The Local Search problem consists in finding a local minimum of the function f on G, that is a vertex v such that f(v) is…