Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets

by   Debbie Leung, et al.

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 communication. For an arbitrary protocol with n messages, designed for a noiseless qudit channel over a poly(n) size alphabet, our main result is a simulation method that fails with probability less than 2^-Θ(nϵ) and uses a qudit channel over the same alphabet n(1+Θ(√(ϵ))) times, of which an ϵ fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √(ϵ) term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS'14] for low ϵ.



There are no comments yet.


page 33


Interactive coding resilient to an unknown number of erasures

We consider distributed computations between two parties carried out ove...

Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy

We consider a model of communication via a fully quantum jammer channel ...

Private Aggregation from Fewer Anonymous Messages

Consider the setup where n parties are each given a number x_i ∈F_q and ...

Reliable Simulation of Quantum Channels

The Quantum Reverse Shannon Theorem has been a milestone in quantum info...

Contextuality in entanglement-assisted one-shot classical communication

We consider the problem of entanglement-assisted one-shot classical comm...

Entanglement cost and quantum channel simulation

This paper proposes a revised definition for the entanglement cost of a ...

Remote Sampling with Applications to General Entanglement Simulation

We show how to sample exactly discrete probability distributions whose d...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.