Computation-Aided Classical-Quantum Multiple Access to Boost Network Communication Speeds
نویسندگان
چکیده
A multiple access channel (MAC) consists of senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (CQ MAC), achievable rates are known assuming that all decoded, common assumption in quantum network design. However, such conventional design approach ignores global structure, i.e., topology. When CQ MAC is given as part communication, this work shows computation properties can be used boost communication speeds with code dependent on We quantify codes property for two-sender MAC. boson coherent binary discrete modulation, we show it achieves maximum possible rate (the single-user capacity), which cannot achieved Further, by different detection methods: (with and without memory), on-off photon counting, homodyne (each at power). Finally, describe two practical applications, one cryptographic.
منابع مشابه
Exponent for classical-quantum multiple access channel
Multiple-user information theory, or network information theory, was started by C. E. Shannon, the founder of Information Theory [1]. The only multiple-user channel in classical information theory whose single-letter capacity region is completely known, is the multiple access channel (MAC). MAC is a channel with a single output and two (or more) inputs. Its capacity region was determined by R. ...
متن کاملTwo Problems in Multiple Access Quantum Communication
Two prior results on the use of quantum resources to increase classical information-transmission capacity are generalized from single-link to multiple-access scenarios. The first is the use of superdense coding over qudit channels. The second is the use of joint measurements over successive uses of the pure-loss Bosonic channel.
متن کاملClassical Capacity of A Quantum Multiple Access Channel
In quantum information theory, a basic question often presented is how efficiently can one transmit classical information over a quantum channel.[1, 2, 3] Because of the non-orthogonality of quantum states, the channel capacity is different from that of the classical channel discussed in [4, 5] . Recently, this question has attracted new attention due to the rapid progress in quantum informatio...
متن کاملEmbedding classical into quantum computation
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits (Valiant’s theorem) appear as two special cases. Viewing these simulatable classes as subsets of the space of all quantum computations, we may consider minimal extens...
متن کاملClassical Computation by Quantum Bits
Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review applied
سال: 2021
ISSN: ['2331-7043', '2331-7019']
DOI: https://doi.org/10.1103/physrevapplied.16.054021