English
Related papers

Related papers: One-shot Marton inner bound for classical-quantum …

200 papers

We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…

Quantum Physics · Physics 2014-11-25 Mario Berta , Joseph M. Renes , Mark M. Wilde

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…

Quantum Physics · Physics 2013-01-29 Ligong Wang , Renato Renner

We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and…

Quantum Physics · Physics 2022-06-01 Eyuri Wakakuwa , Yoshifumi Nakata , Min-Hsiu Hsieh

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's inner bound achieves the capacity of the vector Gaussian…

Information Theory · Computer Science 2012-02-02 Yanlin Geng , Chandra Nair

We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a…

Information Theory · Computer Science 2025-03-14 Fatma Gouiaa , Arun Padakandla

The best known inner bound on the two-receiver general broadcast channel without a common message is due to Marton [3]. This result was subsequently generalized in [p. 391, Problem 10(c) 2] and [4] to broadcast channels with a common…

Information Theory · Computer Science 2011-05-31 Amin Aminzadeh Gohari , Venkat Anantharam

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is…

Quantum Physics · Physics 2017-01-12 Salman Beigi , Amin Gohari

We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some…

Quantum Physics · Physics 2009-10-31 Minxin Huang , Yongde Zhang , Guang Hou

We consider a secret sharing setting with a monotone access structure involving a control node and $L$ users, connected via a classical-quantum broadcast channel whose input is controlled by the control node, referred to as the dealer.…

Information Theory · Computer Science 2026-04-03 Truman Welling , Rémi A. Chou , Aylin Yener

We define classical-quantum multiway channels for transmission of classical information, after recent work by Allahverdyan and Saakian. Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known…

Quantum Physics · Physics 2016-11-15 Andreas Winter

The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The…

Quantum Physics · Physics 2007-05-23 Jon Yard

Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and…

Information Theory · Computer Science 2012-02-07 Amin Gohari , Chandra Nair , Venkat Anantharam

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…

Quantum Physics · Physics 2011-10-25 Jon Yard , Patrick Hayden , Igor Devetak

The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel's entanglement assisted classical capacity. In…

Quantum Physics · Physics 2011-09-22 Mario Berta , Matthias Christandl , Renato Renner

While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the…

Quantum Physics · Physics 2007-05-23 Alberto Barchielli , Giancarlo Lupieri

The task of compressing classical information in the one-shot scenario is studied in the setting where the decompressor additionally has access to some given quantum side information. In this hybrid classical-quantum version of the famous…

Quantum Physics · Physics 2012-03-27 Joseph M. Renes , Renato Renner

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…

Quantum Physics · Physics 2013-10-09 Holger Boche , Janis Noetzel

We establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. We show that unlike the Gaussian case, Marton's coding scheme without superposition coding…

Information Theory · Computer Science 2016-11-18 Amin Aminzadeh Gohari , Abbas El Gamal , Venkat Anantharam