Related papers: Building Multiple Access Channels with a Single Pa…

Quantum channel, as the information transmitter, is an indispensable tool in quantum information theory. In this paper, we study a class of special quantum channels named the mixed-permutation channels. The properties of these channels are…

We investigate the transmission of classical and quantum information between three observers in a general globally hyperbolic spacetime using a quantum scalar field as a communication channel. We build a model for a quantum broadcast…

We investigate the quantum channel consisting of two localized quantum systems that communicate through a scalar quantum field. We choose a scalar field rather than a tensor or vector field, such as the electromagnetic field, in order to…

The pure-interference bosonic multiple access channel has two senders and one receiver, such that the senders each communicate with multiple temporal modes of a single spatial mode of light. The channel mixes the input modes from the two…

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second…

In this paper, an achievable error exponent for the multiple-access channel with two independent sources is derived. For each user, the source messages are partitioned into two classes and codebooks are generated by drawing codewords from…

In this paper we consider a multiple access channel (MAC) with partial cribbing encoders. This means that each of two encoders obtains a deterministic function of the other encoder output with or without delay. The partial cribbing scheme…

Quantum technologies rely on the ability to coherently manipulate, process and transfer information, encoded in quantum states, along quantum channels. Decoherence induced by the environment introduces errors, thus setting limits on the…

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…

The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity…

We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's pre-shared ancilla. Instead of a pure state, we…

Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated…

A controlled quantum dense coding scheme is investigated with a four-particle non-maximal quantum channel. The amount of classical information is shown to be capable of being controlled by the controllers through adjustments of the local…

We prove a necessary condition that a quantum channel on a multipartite system may be approximated arbitrarily closely using local operations and classical communication (LOCC). We then extend those arguments to obtain a condition that…

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…

This paper considers the Gaussian multiple-access channel (MAC) in the asymptotic regime where the number of users grows linearly with the code length. We propose efficient coding schemes based on random linear models with approximate…

We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…

This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the capacity limits as well as properties of the optimal (capacity-achieving) input distributions for such channels.…