Results 21 to 30 of about 8,255 (178)
Strong converse for the quantum capacity of the erasure channel for almost all codes [PDF]
, 2014 A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel's capacity.
Wilde, Mark M., Winter, Andreas
core +4 more sources
All the entropies on the light-cone
Journal of High Energy Physics, 2018 We determine the explicit universal form of the entanglement and Renyi entropies, for regions with arbitrary boundary on a null plane or the light-cone. All the entropies are shown to saturate the strong subadditive inequality. This Renyi Markov property
Horacio Casini +2 more
doaj +1 more source
Catalytic quantum randomness as a correlational resource
Physical Review Research, 2021 Catalysts are substances that assist transformation of other resourceful objects without being consumed in the process. However, the fact that their “catalytic power” is limited and can be depleted is often overlooked, especially in the recently ...
Seok Hyung Lie, Hyunseok Jeong
doaj +1 more source
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. [PDF]
PLoS ONE, 2018 Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. All of these results assume some kind of regularity in the corresponding degree sequences.
Péter L Erdős +3 more
doaj +1 more source
Unconstraining Graph-Constrained Group Testing [PDF]
, 2018 In network tomography, one goal is to identify a small set of failed links in a network using as little information as possible. One way of setting up this problem is called graph-constrained group testing. Graph-constrained group testing is a variant of
Spang, Bruce, Wootters, Mary
core +2 more sources
On the Accuracy of the Exponential Approximation to Random Sums of Alternating Random Variables
Mathematics, 2020 Using the generalized stationary renewal distribution (also called the equilibrium transform) for arbitrary distributions with a finite non-zero first moment, we prove moment-type error-bounds in the Kantorovich distance for the exponential approximation
Irina Shevtsova, Mikhail Tselishchev
doaj +1 more source
On empirical cumulant generating functions of code lengths for individual sequences
, 2016 We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the ...
Merhav, Neri
core +1 more source
On a Dynamical Approach to Some Prime Number Sequences
Entropy, 2018 We show how the cross-disciplinary transfer of techniques from dynamical systems theory to number theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns ...
Lucas Lacasa +3 more
doaj +1 more source
Entropic trade-off relations for quantum operations
, 2013 Spectral properties of an arbitrary matrix can be characterized by the entropy of its rescaled singular values. Any quantum operation can be described by the associated dynamical matrix or by the corresponding superoperator.
C. Beck +11 more
core +1 more source
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization [PDF]
, 2019 We study the r-complex contagion influence maximization problem. In the influence maximization problem, one chooses a fixed number of initial seeds in a social network to maximize the spread of their influence.
Schoenebeck, Grant +2 more
core +2 more sources