313 citations
- University of AmsterdamNL41 papers
- Eindhoven University of TechnologyNL36 papers
- College of Western IdahoUS9 papers
- Radboud University NijmegenNL9 papers
- Leiden UniversityNL7 papers
- Vrije Universiteit AmsterdamNL7 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- University of CambridgeGB6 papers
- University of WaterlooCA6 papers
- Universidad Pública de Navarra (UPNA)ES5 papers
- University of California, BerkeleyUS5 papers
- Delft University of TechnologyNL4 papers
5 papers · 2 filters
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…
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…
New bounds on the classical and quantum communication complexity of some graph properties
Gabor Ivanyos, Hartmut Klauck, Troy Lee +2
We study the communication complexity of a number of graph properties where the edges of the graph are distributed between Alice and Bob (i.e., each receives some of the edges…
Fooling One-Sided Quantum Protocols
Hartmut Klauck, Ronald de Wolf
We use the venerable "fooling set" method to prove new lower bounds on the quantum communication complexity of various functions. Let f:X x Y-->{0,1} be a Boolean function, fool^1(…
Classical simulation of entanglement swapping with bounded communication
Cyril Branciard, Nicolas Brunner, Harry Buhrman +5
Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements…