7 citations · 10 across the 4 of their papers we have counts for
7 papers
Optical quantum communication complexity in the simultaneous message passing model
Ashutosh Marwah, Dave Touchette
The communication cost of a classical protocol is typically measured in terms of the number of bits communicated for this determines the time required for communication during the…
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets
Debbie Leung, Ashwin Nayak, Ala Shayeghi +3
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for commun…
Erasable Bit Commitment from Temporary Quantum Trust
Norbert Lütkenhaus, Ashutosh S Marwah, Dave Touchette
We introduce a new setting for two-party cryptography with temporarily trusted third parties. In addition to Alice and Bob in this setting, there are additional third parties, whic…
Quantum Insertion-Deletion Channels
Janet Leahy, Dave Touchette, Penghui Yao
We introduce a model of quantum insertion-deletion (insdel) channels. Insdel channels are meant to represent, for example, synchronization errors arising in data transmission. In t…
Quantum Log-Approximate-Rank Conjecture is also False
Anurag Anshu, Naresh Goud Boddu, Dave Touchette
In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication compl…
Near-optimal bounds on bounded-round quantum communication complexity of disjointness
Mark Braverman, Ankit Garg, Young Kun Ko +2
We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with rounds, we prove a lower bound of $\…