2 citations
- National University of SingaporeSG2 papers
- Budapest University of Technology and EconomicsHU1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Hungarian Academy of SciencesHU1 paper
- HUN-REN Institute for Computer Science and ControlHU1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- Université Paris-SudFR1 paper
Showing quant-phShow all
2 papers · 1 filter
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…
quant-ph2005★ 2 cited
Holonomic Quantum Computation
Angelo C. M. Carollo, Vlatko Vedral
In this brief review we describe the idea of holonomic quantum computation. The idea of geometric phase and holonomy is introduced in a general way and we provide few examples that…