Random access test as an identifier of nonclassicality
arXiv:2112.03781 · doi:10.1088/1751-8121/ac5b91
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.
arXiv commentMinor corrections; submitted version
References in corpus (31)
- Guess your neighbour's input: a multipartite non-local game with no quantum advantage
- No quantum advantage for nonlocal computation
- Quantum Random Access Codes using Single -level Systems
- Entanglement assisted random access codes
- Limits on non-local correlations from the structure of the local state space
- General probabilistic theories: An introduction
- Robustness of Measurement, discrimination games and accessible information
- Self-testing mutually unbiased bases in the prepare-and-measure scenario
- Operational relevance of resource theories of quantum measurements
- Comparing the degrees of incompatibility inherent in probabilistic physical theories
- Incompatibility robustness of quantum measurements: a unified framework
- Degree of Complementarity Determines the Nonlocality in Quantum Mechanics
- Operational framework for quantum measurement simulability
- Distinguishability Measures and Entropies for General Probabilistic Theories
- Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
- Steering, incompatibility, and Bell inequality violations in a class of probabilistic theories
- Quantum random access codes and incompatibility of measurements
- Maximally incompatible quantum observables
- All measurements in a probabilistic theory are compatible if and only if the state space is a simplex
- Simulability of observables in general probabilistic theories
- Measurement incompatibility and Schrödinger-EPR steering in a class of probabilistic theories
- Conditions on the existence of maximally incompatible two-outcome measurements in General Probabilistic Theory
- A necessary condition for incompatibility of observables in general probabilistic theories
- Quantum correlations are stronger than all nonsignaling correlations produced by n-outcome measurements
- Observation of stronger-than-binary correlations with entangled photonic qutrits
- No-free-information principle in general probabilistic theories
- Quantum Random Access Codes for Boolean Functions
- Operational restrictions in general probabilistic theories
- Information storing yields a point-asymmetry of state space in general probabilistic theories
- Compatibility of any pair of 2-outcome measurements characterizes the Choquet simplex
- Compact convex structure of measurements and its applications to simulability, incompatibility, and convex resource theory of continuous-outcome measurements