2000 character limit reached
Decoherence-Free Communication over Multiaccess Quantum Channels (1209.0120v3)
Published 1 Sep 2012 in quant-ph, math-ph, and math.MP
Abstract: In this paper we consider decoherence-free communication over multiple access and $k$-user quantum channels. First, we concentrate on a hermitian unitary noise model $U$ for a two-access bi-unitary channel and show that in this case a decoherence-free code exists if the space of Schmidt matrices of an eigensubspace of $U$ exhibits certain properties of decomposability. Then, we show that our technique is also applicable for generic random unitary two-access channels. Finally, we consider the applicability of the result to the case of a larger number of senders and general Kraus operators.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.