ﻻ يوجد ملخص باللغة العربية
Quantum networks play a key role in many scenarios of quantum information theory. Here we consider the quantum causal networks in the manner of entropy. First we present a revised smooth max-relative entropy of quantum combs, then we present a lower and upper bound of a type II error of the hypothesis testing. Next we present a lower bound of the smooth max-relative entropy for the quantum combs with asymptotic equipartition. At last, we consider the score to quantify the performance of an operator. We present a quantity equaling to the smooth asymptotic version of the performance of a quantum positive operator.
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not restricted. Alt
It is known that the classical framework of causal models is not general enough to allow for causal reasoning about quantum systems. While the framework has been generalized in a variety of different ways to the quantum case, much of this work leaves
Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory encompassing qu
Large-scale multisource networks have been employed to overcome the practical constraints that entangled systems are difficult to faithfully transmit over large distance or store in long time. However, a full characterization of the multipartite nonl
Since Bells theorem, it is known that the concept of local realism fails to explain quantum phenomena. Indeed, the violation of a Bell inequality has become a synonym of the incompatibility of quantum theory with our classical notion of cause and eff