419 citations
- Massachusetts Institute of TechnologyUS181 papers
- Vilnius UniversityLT180 papers
- Boğaziçi UniversityTR178 papers
- Deutsches Elektronen-Synchrotron DESYDE178 papers
- University of Nebraska–LincolnUS178 papers
- Bulgarian Academy of SciencesBG176 papers
- Sofia University "St. Kliment Ohridski"BG175 papers
- University of BristolGB175 papers
- University of HelsinkiFI175 papers
- University of AntwerpBE174 papers
- University of BelgradeRS174 papers
- University of Notre DameUS174 papers
Showing 2003 · quant-phShow all
3 papers · 2 filters
quant-ph2003★ 23 cited
Quantum walk algorithm for element distinctness
Andris Ambainis
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N…
quant-ph2003
The Complexity of Probabilistic versus Quantum Finite Automata
Gatis Midrijanis
We present a language which is recognizable by a probabilistic finite automaton (PFA) with probability for all with states, with a deterministic fi…
quant-ph2003★ 48 cited
Multiparty Quantum Coin Flipping
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis +1
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum bro…