Applications of position-based coding to classical communication over quantum channels

Qi, Haoyu; Wang, Qingle; Wilde, Mark M.

doi:10.1088/1751-8121/aae290

Cited by 43 publications

(44 citation statements)

References 103 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the perfect quantum strategy for the magic square game detailed in Appendix C.2, for any question pair (r, c) Alice and Bob can produce answers (s, t) such that (r, s, c, t) ∈ W . Hence, with a uniform distribution over the questions R × C they can achieve the maximal sum rate of log 9 ≈ 3.16993 for the magic-square-MAC (39). To bound the sum rate achievable by classical strategies corresponding to product input distributions on (R × S) × (C × T ), our goal is to find the smallest upper bound on I(RSCT ; Z) given by Proposition 3 (we again use capital Latin letters for the random variables corresponding to the question and answer sets, as well as Z for the channel output random variable):…”

Section: C2 a Perfect Quantum Strategymentioning

confidence: 99%

“…This communication scenario was discussed by Hsieh et al [26] for quantum multiple access channels N : A B → C mapping quantum systems A in Alice's possession and B in Bob's possession to a quantum system C in possession of the receiver Charlie. In addition to entanglement assistance, quantum MACs have been studied in various other scenarios [36,37,38,39,40].…”

Section: C2 a Perfect Quantum Strategymentioning

confidence: 99%

See 1 more Smart Citation

Playing games with multiple access channels

et al. 2020

View full text Add to dashboard Cite

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with boundedsize inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.

show abstract

Section: C2 a Perfect Quantum Strategymentioning

confidence: 99%

Section: C2 a Perfect Quantum Strategymentioning

confidence: 99%

Playing games with multiple access channels

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Hayashi proved an achievability bound with a sub-optimal auxiliary function [88,76]. Recently, Qi et al extended Hayashi's expression to entanglement-assisted classical communications over quantum channels [89]. The sphere-packing bound (i.e.…”

Section: Introductionmentioning

confidence: 99%

Properties of Scaled Noncommutative Rényi and Augustin Information

Cheng

Gao

Hsieh

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The scaled Rényi information plays a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error exponent analysis. In quantum information theory, there are three generalizations of the classical Rényi divergence-the Petz's, sandwiched, and log-Euclidean versions, that possess meaningful operational interpretation. However, these scaled noncommutative Rényi informations are much less explored compared with their classical counterpart, and lacking crucial properties hinders applications of these quantities to refined performance analysis. The goal of this paper is thus to analyze fundamental properties of scaled Rényi information from a noncommutative measure-theoretic perspective. Firstly, we prove the uniform equicontinuity for all three quantum versions of Rényi information, hence it yields the joint continuity of these quantities in the orders and priors. Secondly, we establish the concavity in the region of s ∈ (−1, 0) for both Petz's and the sandwiched versions. This completes the open questions raised by Holevo [IEEE Trans. Inf. Theory, 46(6):2256-2261, 2000], Mosonyi and Ogawa [Commun. Math. Phys, 355 (1): 2017]. For the applications, we show that the strong converse exponent in classical-quantum channel coding satisfies a minimax identity. The established concavity is further employed to prove an entropic duality between classical data compression with quantum side information and classical-quantum channel coding, and a Fenchel duality in joint source-channel coding with quantum side information in the forthcoming papers.

show abstract

“…More recent encoding protocols in Refs. [35][36][37][38] use mode permutations or mode selections to encode classical information. Despite being convenient for theoretical analysis, these protocols require large quantum memories to store all quantum states and are thus difficult to implement with available technology.…”

mentioning

confidence: 99%

Practical Route to Entanglement-Assisted Communication Over Noisy Bosonic Channels

2020

View full text Add to dashboard Cite

Entanglement can offer substantial advantages in quantum information processing, but loss and noise hinder its applications in practical scenarios. Although it has been well known for decades that the classical communication capacity over lossy and noisy bosonic channels can be significantly enhanced by entanglement, no practical encoding and decoding schemes are available to realize any entanglement-enabled advantage. Here, we report structured encoding and decoding schemes for such an entanglement-assisted communication scenario. Specifically, we show that phase encoding on the entangled two-mode squeezed vacuum state saturates the entanglement-assisted classical communication capacity and overcomes the fundamental limit of covert communication without entanglement assistance. We then construct receivers for optimum hypothesis testing protocols under discrete phase modulation and for optimum noisy phase estimation protocols under continuous phase modulation. Our results pave the way for entanglement-assisted communication and sensing in the radiofrequency and microwave spectral ranges. I. INTRODUCTIONEntanglement's benefit for quantum information processing has been revealed by pioneer works in communication [1], sensing [2-4], and computation [5]. Notably, the entanglement-enabled advantages even survive loss and noise in certain scenarios, as predicted [6][7][8] and experimentally demonstrated [9][10][11] in the entanglementenhanced sensing protocol called quantum illumination.It is also known, in theory, that pre-shared entanglement increases the classical communication capacity, i.e., the maximum rate of reliable communication of classical bits (cbits), over a quantum channel Φ. In an ideal case, the superdense-coding [12] protocol allows for sending two cbits on a single qubit, with the assistance of one entanglement bit (ebit). Formally, one characterizes the rate limit of such EA communication by the classical capacity with unlimited entanglement-assistance [1,[13][14][15], C E (Φ) [16]. Compared with the classical capacity without entanglement-assistance, i.e., the Holevo-Schumacher-Westmoreland capacity, C (Φ) [17][18][19], the improvement enabled by entanglement can be drastic even over a noisy channel Φ. In particular, it is known [1] that the ratio of C E (Φ) /C (Φ) can diverge logarithmically with the inverse of signal power over a noisy and lossy bosonic channel [20]. Such an EA scenario is widely applicable to radiofrequency communication, deep space communication [21], and covert communication [22,23].Despite the large advantage of EA capacity, a practical EA encoding and decoding scheme that achieves any advantage over the classical capacity is unknown in the high noise regime. Previous experiments [24,25] focused on ideal scenarios with qubits; Although the EA capac- * zhuangquntao@email.arizona.edu ity formula for bosonic Gaussian channel is well established [26,27], the achievability proof in Ref.[1] relies on approximating an infinite dimensional channel as a channel with finite but large d...

show abstract

Applications of position-based coding to classical communication over quantum channels

Cited by 43 publications

References 103 publications

Playing games with multiple access channels

Playing games with multiple access channels

Properties of Scaled Noncommutative Rényi and Augustin Information

Practical Route to Entanglement-Assisted Communication Over Noisy Bosonic Channels

Contact Info

Product

Resources

About