#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1996

2017

- This year (1)
- Last 5 years (17)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hartmut Klauck
- SIAM J. Comput.
- 2001

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 method for proving classical communication complexity lower bounds developed by Raz [30] to the quantum case. Applying this method we give an exponential separation between bounded… (More)

- Hartmut Klauck, Robert Spalek, Ronald de Wolf
- 45th Annual IEEE Symposium on Foundations of…
- 2004

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 overall success probability is exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly… (More)

- Hartmut Klauck
- STOC
- 2000

We investigate the power of quantum communication protocols compared to classical probabilistic protocols. In our first result we describe a total Boolean function that has a quantum Las Vegas protocol communicating at most O(N 1°/11+~) qubits for all e > 0, while any classical probabilistic protocol (with bounded error) needs ~(N/log N) bits. Then we… (More)

- Rahul Jain, Hartmut Klauck
- 2010 IEEE 25th Annual Conference on Computational…
- 2010

We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the partition bound is stronger than both the rectangle/corruption bound and the γ2/generalized discrepancy bounds. In the… (More)

- Hartmut Klauck
- STOC
- 2010

A strong direct product theorem states that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success probability will be exponentially small in k. We establish such a theorem for the randomized communication complexity of the Disjointness problem, i.e., with… (More)

- Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
- Inf. Comput.
- 2002

While deterministic finite automata seem to be well understood, surprisingly many important problems concerning nondeterministic finite automata (nfa’s) remain open. One such problem area is the study of different measures of nondeterminism in finite automata and the estimation of the sizes of minimal nondeterministic finite automata. In this paper the… (More)

- Hartmut Klauck
- ICALP Satellite Workshops
- 2000

This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods, one-way communication, and applications of quantum communication complexity.

- Hartmut Klauck
- STOC
- 2003

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 outperform classical sorting algorithms by more than a constant factor in time complexity, this is wrong in a space bounded setting. We observe that for all storage bounds <i>n</i>/log… (More)

Motivated by the increasing need for fast distributed processing of large-scale graphs such as the Web graph and various social networks, we study a number of fundamental graph problems in the message-passing model, where we have k machines that jointly perform a computation on an arbitrary n-node (typically, n ≫ k) input graph. The graph is assumed to be… (More)

- Hartmut Klauck, Ved Prakash
- ITCS
- 2013

We define a new model of data streaming algorithms that employ a prover/helper to outsource difficult computations in a verifiable way. While for the verifier the usual time (per symbol read) and space constraints of the data streaming model are in place, the prover has unbounded space. Both parties cannot look into the future (i.e., do not know data… (More)