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
4 papers · 2 filters
On physical problems that are slightly more difficult than QMA
Andris Ambainis
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural comp…
Spatial Search on Grids with Minimum Memory
Andris Ambainis, Renato Portugal, Nikolay Nahimov
We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different op…
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games
Andris Ambainis, Jānis Iraids
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local…
Exact quantum query complexity of EXACT and THRESHOLD
Andris Ambainis, Jānis Iraids, Juris Smotrovs
A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algori…