English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A multiple access channel (MAC) consists of multiple senders simultaneouslytransmitting their messages to a single receiver. For the classical-quantumcase (cq-MAC), achievable rates are known assuming that all the messages aredecoded, a common assumption in quantum network design. However, such aconventional design approach ignores the global network structure, i.e., thenetwork topology. When a cq-MAC is given as a part of quantum networkcommunication, this work shows that computation properties can be used to boostcommunication speeds with code design dependently on the network topology. Wequantify achievable quantum communication rates of codes with computationproperty for a two-sender cq-MAC. When the two-sender cq-MAC is a bosoncoherent channel with binary discrete modulation, we show that it achieves themaximum possible communication rate (the single-user capacity), which cannot beachieved with conventional design. Further, such a rate can be achieved bydifferent detection methods: quantum (with and without quantum memory), on-offphoton counting and homodyne (each at different photon power). Finally, wedescribe two practical applications, one of which cryptographic.

Computation-aided classical-quantum multiple access to boost network communication speeds