Related papers: Mutually Unbiased Balanced Functions & Generalized…
We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes $n$ classical bits into $m$ qubits ($m<n$) with a probability of recovering any of the initial $n$ bits of at least $p>\tfrac{1}{2}$. Such a code…
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…
Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its peculiarities with no classical counterpart. Yet, for entanglement-based quantum networks, a key open issue is constituted by the lack of an…
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.…
Unsharp measurements play an increasingly important role in quantum information theory. In this paper, we study a three-party prepare-transform-measure experiment with unsharp measurements based on $ 3 \rightarrow 1 $ sequential random…
We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors for decoding with quantum logic. The quantum logic enables joint quantum measurements over a codeword…
Communication over a quantum multiple access channel (MAC) is considered with classical feedback. Since the no-cloning prohibits universal copying of arbitrary quantum states, classical feedback is generated through measurement. An…
We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide…
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…
This paper considers the problem of transmitting the difference of two jointly Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC). The goal is to recover this difference within an average mean squared…
Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and…
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…
We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
In this work, we present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms using Local Operations and Classical Communication (LOCC). The protocol…
Massive Machine-Type Communications (mMTC) features a massive number of low-cost user equipments (UEs) with sparse activity. Tailor-made for these features, grant-free random access (GF-RA) serves as an efficient access solution for mMTC.…
We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver.…
We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the…