- Architektura i urbanistyka (Dziedzina nauk inżynieryjno-technicznych)
- Informatyka techniczna i telekomunikacja (Dziedzina nauk inżynieryjno-technicznych)
- Inżynieria biomedyczna (Dziedzina nauk inżynieryjno-technicznych)
- Nauki o komunikacji społecznej i mediach (Dziedzina nauk społecznych)
- Nauki o zarządzaniu i jakości (Dziedzina nauk społecznych)
- Informatyka (Dziedzina nauk ścisłych i przyrodniczych)
Punkty Ministerialne: Pomoc
Prace opublikowane w tym czasopiśmie
The problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...
The method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to one-dimensional Markov processes, and it has not been thoroughly studied for general Markov ﬁelds. Markov ﬁelds over a ﬁnite alphabet of size m ≥ 2 can be viewed as models for multi-dimensional systems with local interactions. The locality of these interactions is represented...
We study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
It is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...
In this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
In this paper, we develop a formalism for distilling aclassical key from a quantum state in a systematic way, expandingon our previous work on a secure key from bound entanglement(Horodecki et al., 2005). More detailed proofs, discussion, andexamples are provided of the main results. Namely, we demonstratethat all quantum cryptographic protocols can be recast in away which looks like entanglement theory, with the only changebeing...
Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roofPublikacja
New measures of multipartite entanglement are constructedbased on two definitions of multipartite information anddifferent methods of optimizing over extensions of the states. Oneis a generalization of the squashed entanglement where one takesthe mutual information of parties conditioned on the state's extensionand takes the infimum over such extensions. Additivity ofthe multipartite squashed entanglement is proved for both versionsof...
In this paper, we provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is 4 circle times 4, which shows that peculiar security contained in bound entangled states does not need high-dimensional systems. We show that for these states a positive key rate can be obtained by one-way Devetak-Winter (DW) protocol. Subsequently, the volume of bound entangled key-distillable...
Quantum key distribution based on private states: Unconditional security over untrusted channels with zero quantum capacityPublikacja
In this paper, we prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication-via parameter estimation of the given untrusted state. The technique applies even to bound-entangled states, thus extending QKD to the regime...
wyświetlono 90 razy