Communication tasks in operational theories
From MaRDI portal
Publication:5871091
DOI10.1088/1751-8121/ABB5DCOpenAlexW3083960813WikidataQ117834976 ScholiaQ117834976MaRDI QIDQ5871091FDOQ5871091
Authors: Teiko Heinosaari, Oskari Kerppo, Leevi Leppäjärvi
Publication date: 25 January 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.05264
Recommendations
Cites Work
- On the complexity of nonnegative matrix factorization
- Weak matrix majorization
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Lifts of Convex Sets and Cone Factorizations
- Classical information storage in an \(n\)-level quantum system
- Quantum processes, systems and information
- Matrix majorization
- Some upper and lower bounds on PSD-rank
- The complexity of positive semidefinite matrix factorization
- Title not available (Why is that?)
- Resource theory of contextuality for arbitrary prepare-and-measure experiments
- Operational restrictions in general probabilistic theories
- Noise-disturbance relation and the Galois connection of quantum measurements
- Communication of partial ignorance with qubits
- A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario
Cited In (2)
This page was built for publication: Communication tasks in operational theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871091)