1 citations · 1 across the 4 of their papers we have counts for
6 papers · 1 filter
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Hartmut Klauck, Robert Spalek, Ronald de Wolf
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overa…
Quantum Time-Space Tradeoffs for Sorting
Hartmut Klauck
We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outper…
On quantum and approximate privacy
Hartmut Klauck
This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy…
Lower bounds for quantum communication complexity
Hartmut Klauck
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a meth…
Quantum Communication Complexity
Hartmut Klauck
This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods…
On rounds in quantum communication
Hartmut Klauck
We investigate the power of interaction in two player quantum communication protocols. Our main result is a rounds-communication hierarchy for the pointer jumping function . W…