Optimal bounds for parity-oblivious random access codes

DOI10.1088/1367-2630/18/4/045003zbMath1456.94059OpenAlexW2950240160MaRDI QIDQ5855036

Jamie Sikora, André Chailloux, Srijita Kundu, Iordanis Kerenidis

Publication date: 12 March 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1367-2630/18/4/045003

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Related Items (5)

Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios ⋮ Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square ⋮ Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities ⋮ Quantum formalism on the plane: POVM-Toeplitz quantization, Naimark theorem and linear polarization of the light ⋮ Mutually unbiased special entangled bases with Schmidt number 2d in ℂ2d+1 ⊗ ℂ4d

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect parallel repetition theorem for quantum XOR proof systems
• Quantum analogues of the Bell inequalities. The case of two spatially separated domains
• Quantum symmetrically-private information retrieval
• Exponential separation of quantum and classical communication complexity
• Dense quantum coding and a lower bound for 1-way quantum automata
• Near-optimal extractors against quantum storage
• The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
• Near-Optimal and Explicit Bell Inequality Violations
• Dense quantum coding and quantum finite automata
• Exponential separation of quantum and classical one-way communication complexity
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• Proposed Experiment to Test Local Hidden-Variable Theories
• Quantum one-way communication can be exponentially stronger than classical communication
• Unbounded-Error One-Way Classical and Quantum Communication Complexity
• Mean Deviation of the Binomial Distribution

This page was built for publication: Optimal bounds for parity-oblivious random access codes