title: Clean Quantum and Classical Communication Protocols.
abstract: By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the answer) to their initial states at the end of the communication protocol? Protocols that achieve this are referred to as clean and the associated cost as the clean communication complexity. Here we present clean protocols for calculating the inner product of two n-bit strings, showing that (in the absence of preshared entanglement) at most n+3 qubits or n+O(sqrt[n]) bits of communication are required. The quantum protocol provides inspiration for obtaining the optimal method to implement distributed cnot gates in parallel while minimizing the amount of quantum communication. For more general functions, we show that nearly all Boolean functions require close to 2n bits of classical communication to compute and close to n qubits if the parties have access to preshared entanglement. Both of these values are maximal for their respective paradigms.
authors.affiliation: QuSoft, CWI Amsterdam and University of Amsterdam, Science Park 123, 1098 XG Amsterdam, Netherlands.
authors.forename: Harry
authors.initials: H
authors.lastname: Buhrman
authors.affiliation: QMATH, Department of Mathematical Sciences, University of Copenhagen, Universitetsparken 5, 2100 Copenhagen, Denmark.
authors.forename: Matthias
authors.initials: M
authors.lastname: Christandl
authors.affiliation: QMATH, Department of Mathematical Sciences, University of Copenhagen, Universitetsparken 5, 2100 Copenhagen, Denmark.
authors.forename: Christopher
authors.initials: C
authors.lastname: Perry
authors.affiliation: QuSoft, CWI Amsterdam and University of Amsterdam, Science Park 123, 1098 XG Amsterdam, Netherlands.
authors.forename: Jeroen
authors.initials: J
authors.lastname: Zuiddam