32 citations · 157 across the 38 of their papers we have counts for
Showing 2005Show 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★ 7 cited
Quantum Computing on Lattices using Global Two-Qubit Gate
G. Ivanyos, S. Massar, A. B. Nagy
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if…