English
Related papers

Related papers: The Quantum Multiple-Access Channel with Cribbing …

200 papers

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information…

Information Theory · Computer Science 2021-09-28 Uzi Pereg

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

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…

Quantum Physics · Physics 2016-05-30 Hirotada Kobayashi , Francois Le Gall , Harumichi Nishimura , Martin Roetteler

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…

Quantum Physics · Physics 2014-08-26 Tamoghna Das , R. Prabhu , Aditi Sen De , Ujjwal Sen

A general quantum noisy channel is analyzed, wherein the transmitted qubits may experience symmetry-breaking decoherence, along with memory effects. We find the optimal basis not to be fully entangled, but a combination of factorized and…

Quantum Physics · Physics 2015-05-13 Goren Gordon , Gershon Kurizki

A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…

Quantum Physics · Physics 2020-10-23 Chiara Macchiavello , Massimiliano F. Sacchi , Tito Sacchi

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…

Quantum Physics · Physics 2021-05-17 Sristy Agrawal , Rajashik Tarafder , Graeme Smith , Arup Roy , Manik Banik

We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially…

Quantum Physics · Physics 2026-03-24 Arman Sauliere , Guglielmo Lami , Pedro Ribeiro , Andrea De Luca , Jacopo De Nardis

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications…

Quantum Physics · Physics 2025-12-01 Vishal Singh , Theshani Nuradha , Mark M. Wilde

The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…

Quantum Physics · Physics 2007-05-23 Benjamin Levi , Bertrand Georgeot

We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for…

Quantum Physics · Physics 2019-06-12 Gilles Brassard , Ashwin Nayak , Alain Tapp , Dave Touchette , Falk Unger

In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted…

Quantum Physics · Physics 2009-11-10 Jian-Lan Chen , Le-Man Kuang

We make a thorough study of the spreading of quantum coherence (QC), as quantified by the $l_{1}$-norm QC, when a qubit (a two-level quantum system) is subjected to noise quantum channels commonly appearing in quantum information science.…

Quantum Physics · Physics 2017-02-10 Mauro B. Pozzobom , Jonas Maziero

We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a…

Information Theory · Computer Science 2026-04-10 Ioannis Krikidis

We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an "ordinary receiver" and a "robust receiver." The channel to the ordinary receiver is a given (known) discrete memoryless channel…

Information Theory · Computer Science 2017-12-18 Tibor Keresztfalvi , Amos Lapidoth

We show that for the multi-antenna Gaussian multi-access channel (MAC) and broadcast channel (BC) with perfect feedback, the rate regions achieved by linear-feedback coding schemes (called linear-feedback capacity regions) coincide when the…

Information Theory · Computer Science 2014-04-10 Selma Belhadj Amor , Yossef Steinberg , Michèle Wigger
‹ Prev 1 3 4 5 6 7 10 Next ›