Dave Touchette

Learn More
Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels(More)
In quantum state redistribution as introduced by Luo and Devetak and Devetak and Yard, there are four systems of interest: the A system held by Alice; the B system held by Bob; the C system that is to be transmitted from Alice to Bob; and the R system that holds a purification of the state in the ABC registers. We give upper and lower bounds on the amount(More)
BACKGROUND Pancreatic carcinoma is a major health issue and financial burden to society. To improve the quality and efficiency of care delivered, it is essential for health care providers to have a good understanding of the cost of treatment. METHODS The authors examined the facility-based costs and survival of 103 patients with pancreatic carcinoma who(More)
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and will be of importance for eventual real-world applications of interactive quantum protocols, which can be proved to have exponentially lower(More)
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum tasks. These are the fully quantum generalizations of the analogous quantities for bipartite classical tasks that have found many applications recently, in particular for proving communication complexity lower(More)
We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with r rounds, we prove a lower bound of Omega(n/r) on the communication required for computing disjointness of input size n, which is optimal up to logarithmic factors. The previous best lower bound was(More)
We show how two recently developed quantum information theoretic tools can be applied to obtain lower bounds on quantum information complexity. We also develop new tools with potential for broader applicability, and use them to establish a lower bound on the quantum information complexity for the Augmented Index function on an easy distribution. This(More)
Direct Sum for Bounded Round Quantum Communication Complexity Dave Touchette 1 We present the first general direct sum theorem for quantum communication complexity that holds for more than a single round of communication. A direct sum theorem states that to compute n tasks simultaneously requires as much resources as the amount of the given resource(More)