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
8 papers · 2 filters
Superlinear advantage for exact quantum algorithms
Andris Ambainis
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algor…
Quantum algorithms for search with wildcards and combinatorial group testing
Andris Ambainis, Ashley Montanaro
We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is…
Optimal quantum query bounds for almost all Boolean functions
Andris Ambainis, Arturs Backurs, Juris Smotrovs +1
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of…
Adversary Lower Bound for the k-sum Problem
Aleksandrs Belovs, Robert Spalek
We prove a tight quantum query lower bound for the problem of deciding whether there exist numbers among that sum up to a prescribed number, provided that…
How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
Andris Ambainis, Ronald de Wolf
It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achiev…
Learning-Graph-Based Quantum Algorithm for k-distinctness
Aleksandrs Belovs
We present a quantum algorithm solving the -distinctness problem in queries with a bounded error. This improves the previous -query al…