#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2018

- This year (3)
- Last 5 years (14)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mario Berta, Matthias Christandl, Dave Touchette
- IEEE Transactions on Information Theory
- 2016

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â€¦ (More)

- Kamil Bradler, Patrick M. Hayden, Dave Touchette, Mark M. Wilde
- ArXiv
- 2010

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â€¦ (More)

- Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
- Electronic Colloquium on Computational Complexity
- 2015

- Dave Touchette
- STOC
- 2015

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â€¦ (More)

- Mathieu LauriÃ¨re, Dave Touchette
- ITCS
- 2017

In the context of two-party interactive quantum communication protocols, we study a recently defined notion of quantum information cost (QIC), which possesses most of the important properties of itsâ€¦ (More)

- Ashwin Nayak, Dave Touchette
- Computational Complexity Conference
- 2017

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â€¦ (More)

- Dave Touchette
- 2014

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â€¦ (More)

- Juan Miguel Arrazola, Dave Touchette
- ArXiv
- 2016

We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite lengthâ€¦ (More)

- Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
- STOC
- 2017

We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction wasâ€¦ (More)

- Dave Touchette
- ArXiv
- 2014

We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that weâ€¦ (More)