English
Related papers

Related papers: On the additivity conjecture for channels with arb…

200 papers

We compute the capacity region of the s-sender Multiple Access Adder Channel in information theory and obtain an explicit description of this region as only one polyhedron, instead of a convex hull of infinitely many polyhedrons. We obtain…

Classical Analysis and ODEs · Mathematics 2007-05-23 Shaohui Zhai

Recent research has demonstrated significant achievable performance gains by exploiting circularity/non-circularity or propeness/improperness of complex-valued signals. In this paper, we investigate the influence of these properties on…

Information Theory · Computer Science 2016-11-17 Georg Tauboeck

The minimum entropy output is computed for rotationally invariant quantum channels acting on spin-1/2 and spin-1 systems. For the case of two parallel such channels and initial entangled (singlet) state the entropy of the output is higher…

Quantum Physics · Physics 2007-05-23 Robert Alicki

Can quantum entanglement increase the capacity of (classical) covert channels? To one familiar with Holevo's Theorem it is tempting to think that the answer is obviously no. However, in this work we show: quantum entanglement can in fact…

Cryptography and Security · Computer Science 2022-02-07 David Mestel

In this paper, we present new families of quantum channels for which corresponding minimum output R\'enyi $p$-entropy is not additive. Our manuscript is motivated by the results of Grudka et al., J. Phys. A: Math. Theor. 43 425304 and we…

Quantum Physics · Physics 2025-09-08 Krzysztof Szczygielski , Michał Studziński

In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a…

Optimization and Control · Mathematics 2016-01-19 Hiroshi Hirai

We propose a new approach to the Fourier restriction conjectures. It is based on a discretization of the Fourier extension operators in terms of quadratically modulated wave packets. Using this new point of view, and by combining natural…

Classical Analysis and ODEs · Mathematics 2024-10-16 Camil Muscalu , Itamar Oliveira

A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz…

Quantum Physics · Physics 2016-09-08 Mary Beth Ruskai

We conclude a sequence of work by giving near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves on prior results that obtain…

Data Structures and Algorithms · Computer Science 2008-12-18 Nicholas J. A. Harvey , Jelani Nelson , Krzysztof Onak

This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity…

Quantum Physics · Physics 2014-07-16 Masahiro Takeoka , Saikat Guha , Mark M. Wilde

A coding theorem and converse are proved for a large class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuous-time real-valued channels as special cases. As main contribution…

Information Theory · Computer Science 2018-04-18 Martin Mittelbach , Eduard A. Jorswieck

Lubrication theory is broadly applicable to the flow characterization of thin fluid films and the motion of particles near surfaces. We offer an extension to lubrication theory by starting with Stokes equations and considering higher-order…

Fluid Dynamics · Physics 2017-01-30 Behrouz Tavakol , Guillaume Froehlicher , Douglas P. Holmes , Howard A. Stone

For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…

Metric Geometry · Mathematics 2024-07-18 Mark Meyer

In a quantum mechanical model, Diosi, Feldmann and Kosloff arrived at a conjecture stating that the limit of the entropy of certain mixtures is the relative entropy as system size goes to infinity. The conjecture is proven in this paper for…

Quantum Physics · Physics 2009-11-13 I. Csiszar , F. Hiai , D. Petz

We introduce an axiomatic approach for channel divergences and channel relative entropies that is based on three information-theoretic axioms of monotonicity under superchannels (i.e. generalized data processing inequality), additivity…

Quantum Physics · Physics 2021-01-25 Gilad Gour

Additivity violation of minimum output entropy, which shows non-classical properties in quantum communication, had been proved in most cases for random quantum channels defined by Haar-distributed unitary matrices. In this paper, we…

Mathematical Physics · Physics 2021-05-03 Motohisa Fukuda , Takahiro Hasebe , Shinya Sato

After recalling definition, monotonicity, concavity, and continuity of a channel's entropy with respect to a state (finite dimensional cases only), I introduce the roof property, a convex analytic tool, and show its use in treating an…

Quantum Physics · Physics 2007-05-23 Armin Uhlmann

In this paper we show how \emph{the metric theory of tensor products} developed by Grothendieck perfectly fits in the study of channel capacities, a central topic in \emph{Shannon's information theory}. Furthermore, in the last years…

Functional Analysis · Mathematics 2015-02-10 Marius Junge , Carlos Palazuelos

This note reviews the authors' approach to Fujino's conjecture, i.e. the injectivity theorem for lc pairs on compact K\"ahler manifolds, via the use of adjoint ideal sheaves coupled with the associated residue computations in their previous…

Complex Variables · Mathematics 2024-11-12 Tsz On Mario Chan , Young-Jun Choi

Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate generating functions. We study information-theoretic questions…

Information Theory · Computer Science 2025-07-16 Andreas Lenz , Stephen Melczer , Cyrus Rashtchian , Paul H. Siegel
‹ Prev 1 4 5 6 7 8 10 Next ›