Mutually Unbiased Balanced Functions & Generalized Random Access Codes

Abstract

Quantum resources and protocols are known to outperform their classical counterparts in variety of communication and information processing tasks. Random Access Codes (RACs) are one such cryptographically significant family of bipartite communication tasks, wherein, the sender encodes a data set (typically a string of input bits) onto a physical system of bounded dimension and transmits it to the receiver, who then attempts to guess a randomly chosen part of the sender's data set (typically one of the sender's input bits). In this work, we introduce a generalization of this task wherein the receiver, in addition to the individual input bits, aims to retrieve randomly chosen functions of sender's input string. Specifically, we employ sets of mutually unbiased balanced functions (MUBS), such that perfect knowledge of any one of the constituent functions yields no knowledge about the others. We investigate and bound the performance of (i.) classical, (ii.) quantum prepare and measure, and (iii.) entanglement assisted classical communication (EACC) protocols for the resultant generalized RACs (GRACs). Finally, we detail the case of GRACs with three input bits, find maximal success probabilities for classical, quantum and EACC protocols, along with the effect of noisy quantum channels on the performance of quantum protocols. Moreover, with the help of this case study, we reveal several characteristic properties of the GRACs which deviate from the standard RACs.

arXiv commentComments are welcome

References in corpus (31)

• Information Causality as a Physical Principle
• Non-locality and Communication Complexity
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Probabilistic theories with purification
• A derivation of quantum theory from physical requirements
• Semi-device-independent security of one-way quantum key distribution
• Preparation contextuality powers parity-oblivious multiplexing
• Improving zero-error classical communication with entanglement
• Quantum Random Access Codes using Single $d$-level Systems
• Entanglement assisted random access codes
• Limits on non-local correlations from the structure of the local state space
• Optimal bounds for parity-oblivious random access codes
• Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
• Zero-error channel capacity and simulation assisted by non-local correlations
• Classical information storage in an $n$-level quantum system
• Communication games reveal preparation contextuality
• Preparation contextuality as an essential feature underlying quantum communication advantage
• Information causality from an entropic and a probabilistic perspective
• Optimal quantum preparation contextuality in $n$-bit parity-oblivious multiplexing task
• Characterising and bounding the set of quantum behaviours in contextuality scenarios
• Nonlocality Without Entanglement: Quantum Theory and Beyond
• Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound
• Complementarity between entanglement-assisted and quantum distributed random access code
• Information and communication in polygon theories
• Quantum prescriptions are more ontologically distinct than they are operationally distinguishable
• Quantum Random Access Codes for Boolean Functions
• Reversibility and the structure of the local state space
• The principle of information symmetry constrains the state-space in any physical theory
• Advantage of Quantum Theory Over Non-classical Models of Communication
• Random access codes and non-local resources
• Multiparty quantum random access codes

Cited by in corpus (13)

• A Comprehensive Review of Quantum Random Number Generators: Concepts, Classification and the Origin of Randomness
• Semidefinite programming relaxations for quantum correlations
• Entanglement in prepare-and-measure scenarios: many questions, a few answers
• Quantum Advantage in Information Retrieval
• Exploring super-additivity of coherent information of noisy quantum channels through Genetic algorithms
• Bounds on semi-device-independent quantum random number expansion capabilities
• Adaptive advantage in entanglement-assisted communications
• Certification of qubits in the prepare-and-measure scenario with large input alphabet and connections with the Grothendieck constant
• Quantum Advantages in (n,d)->1 Random Access Codes
• Classical analogue of quantum superdense coding and communication advantage of a single quantum system
• Identifying the value of a random variable unambiguously: Quantum versus classical approaches
• Quantum advantage in a unified scenario and secure detection of resources
• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication