Random access test as an identifier of nonclassicality
From MaRDI portal
Abstract: Random access codes are an intriguing class of communication tasks that reveal an operational and quantitative difference between classical and quantum information processing. We formulate a natural generalization of random access codes and call them random access tests, defined for any finite collection of measurements in an arbitrary finite dimensional general probabilistic theory. These tests can be used to examine collective properties of collections of measurements. We show that the violation of a classical bound in a random access test is a signature of either measurement incompatibility or super information storability. The polygon theories are exhaustively analyzed and a critical difference between even and odd polygon theories is revealed.
Recommendations
- Optimal bounds for parity-oblivious random access codes
- scientific article; zbMATH DE number 6694244
- The randomness in 2 1 quantum random access code without a shared reference frame
- Parity oblivious d-level random access codes and class of noncontextuality inequalities
- \(n\rightarrow 1\) quantum random access codes using single 3-level systems
Cites work
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Compatibility of any pair of 2-outcome measurements characterizes the Choquet simplex
- Distinguishability measures and entropies for general probabilistic theories
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- Limits on nonlocal correlations from the structure of the local state space
- Maximally incompatible quantum observables
- Measurement incompatibility and Schrödinger-Einstein-Podolsky-Rosen steering in a class of probabilistic theories
- Operational framework for quantum measurement simulability
- Operational restrictions in general probabilistic theories
- Parity oblivious d-level random access codes and class of noncontextuality inequalities
- Quantum nonlocality and beyond: limits from nonlocal computation
- The mathematical language of quantum theory. From uncertainty to entanglement
Cited in
(2)
This page was built for publication: Random access test as an identifier of nonclassicality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049924)