Related papers: Capacity Estimates via comparison with TRO channel…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
In this paper, we study the multiplicative behaviour of quantum channels, mathematically described by trace preserving, completely positive maps on matrix algebras. It turns out that the multiplicative domain of a unital quantum channel has…
Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to…
The efficiency of time dependent density matrix renormalization group methods is intrinsically connected with the rate of entanglement growth. We introduce a new measure of entanglement in the space of operators and show, for transverse…
We investigate state estimation of linear systems over channels having a finite state not known by the transmitter or receiver. We show that similar to memoryless channels, zero-error capacity is the right figure of merit for achieving…
We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the…
In this paper, the problem of determining the capacity of a communication channel is formulated as a cooperative game, between a generator and a discriminator, that is solved via deep learning techniques. The task of the generator is to…
In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations.…
Synchronization channels, such as the well-known deletion channel, are surprisingly harder to analyze than memoryless channels, and they are a source of many fundamental problems in information theory and theoretical computer science. One…
We provide several perturbation theorems regarding closable operators on a real or complex Hilbert space. In particular we extend some classical results due to Hess--Kato, Kato--Rellich and W\"ust. Our approach involves ranges of matrix…
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…
We introduce an approach to compute reduced density matrices for local quantum unitary circuits of finite depth and infinite width. Suppose the time-evolved state under the circuit is a matrix-product state with bond dimension $D$; then the…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
MIMO capacity with a joint total and per-antenna average power constraint is considered in this work. The problem arises when, besides having a limited available power at the transmitter, also the individual antennas cannot radiate power…
Entanglement breaking (EB) channels, as completely positive and trace-preserving linear operators, sever the entanglement between the input system and other systems. In the realm of infinite-dimensional systems, a related concept known as…
The difficulty to simulate the dynamics of open quantum systems resides in their coupling to many-body reservoirs with exponentially large Hilbert space. Applying a tensor network approach in the time domain, we demonstrate that effective…
We define and investigate a notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme…
For a partially degradable (PD) channel, the channel output state can be used to simulate the degraded environment state. The quantum capacity of a PD channel has been proven to be additive. Here, we show that the private classical capacity…
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…
In this paper, a deterministic equivalent of ergodic sum rate and an algorithm for evaluating the capacity-achieving input covariance matrices for the uplink large-scale multiple-input multiple-output (MIMO) antenna channels are proposed.…