More Like this

1. Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels

   https://doi.org/10.1038/s41534-021-00412-3  

   Shi, Haowei; Hsieh, Min-Hsiu; Guha, Saikat; Zhang, Zheshen; Zhuang, Quntao (December 2021, npj Quantum Information)

   null (Ed.)

   Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial. 

   more » « less
2. Fundamental Limits of Thermal-noise Lossy Bosonic Multiple Access Channel

   Anderson, Evan; Bash, Boulat A. (December 2022, 2022 IEEE Globecom Workshops (GC Wkshps))

   Bosonic channels describe quantum-mechanically many practical communication links such as optical, microwave, and radiofrequency. We investigate the maximum rates for the bosonic multiple access channel (MAC) in the presence of thermal noise added by the environment and when the transmitters utilize Gaussian state inputs. We develop an outer bound for the capacity region for the thermal-noise lossy bosonic MAC. We additionally find that the use of coherent states at the transmitters is capacity-achieving in the limits of high and low mean input photon numbers. Furthermore, we verify that coherent states are capacity-achieving for the sum rate of the channel. In the non-asymptotic regime, when a global mean photon-number constraint is imposed on the transmitters, coherent states are the optimal Gaussian state. Surprisingly however, the use of single-mode squeezed states can increase the capacity over that afforded by coherent state encoding when each transmitter is photon number constrained individually. 

   more » « less
3. Building Multiple Access Channels with a Single Particle

   https://doi.org/10.22331/q-2022-02-16-653  

   Zhang, Yujie; Chen, Xinan; Chitambar, Eric (February 2022, Quantum)

   A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an $N$-port interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle.We provide a full characterization of the $N$-party classical MACs that can be built from a single particle, and we show that every non-classical particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of $1<K\le N$parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a generalized fingerprinting inequality'' as a valid facet for this polytope, and we verify that a quantum particle distributed among $N$separated parties can violate this inequality even when $K=N-1$. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with $K$-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number. 

   more » « less
4. Rate-limited Quantum-to-Classical Optimal Transport: A Lossy Source Coding Perspective

   https://doi.org/10.1109/ISIT54713.2023.10206947  

   Garmaroudi, Hafez M.; Pradhan, S. Sandeep; Chen, Jun (June 2023, IEEE)

   We consider the rate-limited quantum-to-classical optimal transport in terms of output-constrained rate-distortion coding for discrete quantum measurement systems with limited classical common randomness. The main coding theorem provides the achievable rate region of a lossy measurement source coding for an exact construction of the destination distribution (or the equivalent quantum state) while maintaining a threshold of distortion from the source state according to a generally defined distortion observable. The constraint on the output space fixes the output distribution to an i.i.d. predefined probability mass function. Therefore, this problem can also be viewed as information-constrained optimal transport which finds the optimal cost of transporting the source quantum state to the destination state via an entanglement-breaking channel with limited communication rate and common randomness. 

   more » « less
5. Group Evacuation on a Line by Agents with Different Communication Abilities

   Czyzowicz, J; Killick R.; Kranakis, E.; Krizanc, D.; Narayanan, L.; Opatrny, J.; Pankratov, D.; Shende, S. (January 2021, 32nd International Symposium on Algorithms and Computation (ISAAC 2021))

   We consider evacuation of a group of n ≥ 2 autonomous mobile agents (or robots) from an unknown exit on an infinite line. The agents are initially placed at the origin of the line and can move with any speed up to the maximum speed 1 in any direction they wish and they all can communicate when they are co-located. However, the agents have different wireless communication abilities: while some are fully wireless and can send and receive messages at any distance, a subset of the agents are senders, they can only transmit messages wirelessly, and the rest are receivers, they can only receive messages wirelessly. The agents start at the same time and their communication abilities are known to each other from the start. Starting at the origin of the line, the goal of the agents is to collectively find a target/exit at an unknown location on the line while minimizing the evacuation time, defined as the time when the last agent reaches the target. We investigate the impact of such a mixed communication model on evacuation time on an infinite line for a group of cooperating agents. In particular, we provide evacuation algorithms and analyze the resulting competitive ratio (CR) of the evacuation time for such a group of agents. If the group has two agents of two different types, we give an optimal evacuation algorithm with competitive ratio CR = 3+2√2. If there is a single sender or fully wireless agent, and multiple receivers we prove that CR ∈ [2+√5,5], and if there are multiple senders and a single receiver or fully wireless agent, we show that CR ∈ [3,5.681319]. Any group consisting of only senders or only receivers requires competitive ratio 9, and any other combination of agents has competitive ratio 3. 

   more » « less