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 2011 · quant-phShow all
3 papers · 2 filters
quant-ph2011★ 5 cited
Search by quantum walks on two-dimensional grid without amplitude amplification
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs +2
We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh (quant-ph/0402107) takes O(\sqrt{N log N}) steps and finds a marked locat…
quant-ph2011
Quantum strategies are better than classical in almost any XOR game
Andris Ambainis, Arturs Backurs, Kaspars Balodis +4
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n,…
quant-ph2011★ 1 cited
Worst case analysis of non-local games
Andris Ambainis, Arturs Backurs, Kaspars Balodis +3
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game…