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
Symmetry-assisted adversaries for quantum state generation
Andris Ambainis, Loïck Magnin, Martin Roetteler +1
We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of…
Quantum property testing for bounded-degree graphs
Andris Ambainis, Andrew M. Childs, Yi-Kai Liu
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the O…
New Developments in Quantum Algorithms
Andris Ambainis
In this survey, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and O…
Quantum algorithms for formula evaluation
Andris Ambainis
We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.