88 citations
- University of AmsterdamNL13 papers
- College of Western IdahoUS3 papers
- Vrije Universiteit AmsterdamNL3 papers
- Universidad Pública de Navarra (UPNA)ES2 papers
- University of CambridgeGB2 papers
- University of TwenteNL2 papers
- Berkeley CollegeUS1 paper
- Eindhoven University of TechnologyNL1 paper
- Goethe University FrankfurtDE1 paper
- Institute for Advanced StudyUS1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- Lomonosov Moscow State UniversityRU1 paper
4 papers · 2 filters
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
M. de Graaf, P. Valiant
We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the deg…
Quantum Zero-Error Algorithms Cannot be Composed
Harry Buhrman, Ronald de Wolf
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-e…
Combinatorics and Quantum Nonlocality
Harry Buhrman, Peter Hoyer, Serge Massar +1
We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of super-luminal communication) for being able to repr…
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
Iordanis Kerenidis, Ronald de Wolf
A locally decodable code encodes n-bit strings x in m-bit codewords C(x), in such a way that one can recover any bit x_i from a corrupted codeword by querying only a few bits of th…