Tsirelson's bound from a generalized data processing inequality
From MaRDI portal
Publication:5137664
DOI10.1088/1367-2630/14/6/063024zbMath1448.81101arXiv1108.4549OpenAlexW2026770643MaRDI QIDQ5137664
Renato Renner, Daniel Lercher, Oscar C. O. Dahlsten
Publication date: 2 December 2020
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.4549
Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Entanglement measures, concurrencies, separability criteria (81P42)
Related Items (9)
Thermodynamics and the structure of quantum theory ⋮ Divisible quantum dynamics satisfies temporal Tsirelson’s bound ⋮ The chain rule implies Tsirelson's bound: an approach from generalized mutual information ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ A graph-separation theorem for quantum causal models ⋮ Information transfer in generalized probabilistic theories ⋮ Information transfer in generalized probabilistic theories based on weak repeatability ⋮ Dimension of physical systems, information processing, and thermodynamics ⋮ Perfect discrimination of non-orthogonal separable pure states on bipartite system in general probabilistic theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguishability measures and entropies for general probabilistic theories
- Entropy and information causality in general probabilistic theories
- Entropy in general physical theories
- The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
- Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
- Implications of superstrong non-locality for cryptography
- Quantum cryptography based on Bell’s theorem
- Proposed Experiment to Test Local Hidden-Variable Theories
This page was built for publication: Tsirelson's bound from a generalized data processing inequality
