The entropy of quantum causal networks
arXiv:2103.07591
Abstract
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.
References in corpus (19)
- Advances in Quantum Teleportation
- Robustness of coherence: An operational and observable measure of quantum coherence
- Quantum computations without definite causal structure
- Theoretical framework for quantum networks
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Perfect discrimination of no-signalling channels via quantum superposition of causal structures
- General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks
- The quantum capacity of channels with arbitrarily correlated noise
- Memory effects in quantum channel discrimination
- Second-order asymptotics for quantum hypothesis testing
- Optimal quantum learning of a unitary transformation
- Operational one-to-one mapping between coherence and entanglement measures
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- The quantum mechanics of time travel through post-selected teleportation
- No-Go Theorems for Quantum Resource Purification
- How to quantify a dynamical quantum resource
- Quantifying resource in catalytic resource theory
- Optimal quantum networks and one-shot entropies
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels