The Entropy Accumulation Theorem (EAT) was introduced to significantly improve the finite-size rates for device-independent quantum information processing tasks such as device-independent quantum key distribution (QKD). A natural question would be whether it also improves the rates for device-dependent QKD. In this work, we provide an affirmative answer to this question. We present new tools for applying the EAT in the device-dependent setting. We present sufficient conditions for the Markov chain conditions to hold as well as general algorithms for constructing the needed min-tradeoff function. Utilizing Dupuis' recent privacy amplification without smoothing result, we improve the key rate by optimizing the sandwiched Rényi entropy directly rather than considering the traditional smooth min-entropy. We exemplify these new tools by considering several examples including the BB84 protocol with the qubit-based version and with a realistic parametric downconversion source, the six-state four-state protocol and a high-dimensional analog of the BB84 protocol.
Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation
Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo（滑铁卢大学量子计算研究所和物理与天文学系）；The Center for Quantum Science and Technology, Department of Complex Systems, Weizmann Institute of Science（魏茨曼科学研究所复杂系统系量子科学与技术中心）
The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are sublinear in $n$. This theorem is particularly suited to proving the security of quantum cryptographic protocols, and in particular so-called device-independent protocols for randomness expansion and key distribution, where the devices can be built and preprogrammed by a malicious supplier. However, while the bounds provided by this theorem are optimal in th…
We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic Equipartition Property implies that this is indeed the case to first order in $n$, under the assumption that the parts $A_i$ are identical and independent of each other. Here we show that entropy accumulation occurs more generally, i.e., without an independence assumption, provided one quantifies the uncertainty about the individual systems $A_i$ by the von N…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an information theoretic tool called entropy accumulation theorem we derive an upper and a lower bound for the maximal and minimal Lyapunov exponent, respectively. The bounds assume independence of the random matrices, are analytical, and are tight in the commutative case as well as in other scenarios. They can be expressed in terms of an optimization problem th…
Consider a sequential process in which each step outputs a system $A_i$ and updates a side information register $E$. We prove that if this process satisfies a natural "non-signalling" condition between past outputs and future side information, the min-entropy of the outputs $A_1, \dots, A_n$ conditioned on the side information $E$ at the end of the process can be bounded from below by a sum of von Neumann entropies associated with the individual steps. This is a generalisation of the entropy accumulation theorem (EAT), which deals with a more restrictive model of side information: there, past …
Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Institut für Theoretische Physik, Leibniz Universität Hannover（汉诺威莱布尼茨大学理论物理研究所）
We addressed the question of optimality of private quantum channels. We have shown that the Shannon entropy of the classical key necessary to securely transfer the quantum information is lower bounded by the entropy exchange of the private quantum channel $\cal E$ and von Neumann entropy of the ciphertext state $\varrho^{(0)}$. Based on these bounds we have shown that decomposition of private quantum channels into orthogonal unitaries (if exists) is optimizing the entropy. For non-ancillary single qubit PQC we have derived the optimal entropy for arbitrary set of plaintexts. In particular, we …
The expression for the density operator of the damped harmonic oscillator is derived from the master equation in the framework of the Lindblad theory for open quantum systems. Then the von Neumann entropy and effective temperature of the system are obtained. The entropy for a state characterized by a Wigner distribution function which is Gaussian in form is found to depend only on the variance of the distribution function.
The content of phase information of an arbitrary phase--sensitive measurement is evaluated using the maximum likelihood estimation. The phase distribution is characterized by the relative entropy--a nonlinear functional of input quantum state. As an explicit example the multiple measurement of quadrature operator is interpreted as quantum phase detection achieving the ultimate resolution predicted by the Fisher information.
According to the entropy accumulation theorem, proving the unconditional security of a device-independent quantum key distribution protocol reduces to deriving tradeoff functions, i.e., bounds on the single-round von Neumann entropy of the raw key as a function of Bell linear functionals, conditioned on an eavesdropper's quantum side information. In this work, we describe how the conditional entropy can be bounded in the 2-input/2-output setting, where the analysis can be reduced to qubit systems, by combining entropy bounds for variants of the well-known BB84 protocol with quantum constraints…
We study the behavior of bipartite entanglement at fixed von Neumann entropy. We look at the distribution of the entanglement spectrum, that is the eigenvalues of the reduced density matrix of a quantum system in a pure state. We report the presence of two continuous phase transitions, characterized by different entanglement spectra, which are deformations of classical eigenvalue distributions.
The fidelity and entanglement entropy in an antiferromagnetic-ferromagnetic alternating Heisenberg chain are investigated by using the method of density-matrix renormalization-group. The effect of anisotropy on fidelity and entanglement entropy are investigated. The relations between fidelity, entanglement entropy and quantum phase transition are analyzed. It is found that the quantum phase transition point can be well characterized by both the ground-state entropy and fidelity for large system.
Any tripartite state which saturates the strong subadditivity relation for the quantum entropy is defined as the Markov state.A tripartite pure state describing an open system, its environment and their purifying system isa pure Markov state iff the bipartite marginal state of purifying system and environment is a product state. It has been shown that as long as the purification of the input system-environment state is a pure Markov state the reduced dynamics of the open system can be described, on the support of initial system state, by a quantum channel for every joint unitary evolution of t…
Dynamics of a periodically time dependent quantum system is reflected in the features of the eigenstates of the Floquet operator. Of the special importance are their localization properties quantitatively characterized by the eigenvector entropy, the inverse participation ratio or the eigenvector statistics. Since these quantities depend on the choice of the eigenbasis, we suggest to use the overcomplete basis of coherent states, uniquely determined by the classical phase space. In this way we define the mean Wehrl entropy of eigenvectors of the Floquet operator and demonstrate that this quant…
The entanglement entropy of a subsystem $A$ of a quantum system is expressed, in the replica method, through analytic continuation with respect to n of the trace of the n-th power of the reduced density matrix $\trρ_A^n$. We study the analytic properties of this quantity as a function of n in some quantum critical Ising-like models in 1+1 and 2+1 dimensions. Although we find no true singularities for n>0, there is a threshold value of n close to 2 which separates two very different `phases'. The region with larger n is characterized by rapidly convergent Taylor expansions and is very smooth. T…
A Bayesian functorial characterization of the classical relative entropy (KL divergence) of finite probabilities was recently obtained by Baez and Fritz. This was then generalized to standard Borel spaces by Gagné and Panangaden. Here, we provide preliminary calculations suggesting that the finite-dimensional quantum (Umegaki) relative entropy might be characterized in a similar way. Namely, we explicitly prove that it defines an affine functor in the special case where the relative entropy is finite. A recent non-commutative disintegration theorem provides a key ingredient in this proof.
