Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities

DOI10.1007/s11128-019-2228-3zbMath1417.81020arXiv1607.05490OpenAlexW2963576685WikidataQ128302025 ScholiaQ128302025MaRDI QIDQ670063

Dmitry Kravchenko, Manik Banik, Andris Ambainis, Ashutosh Rai, Anubhav Chaturvedi

Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.05490

zbMATH Keywords

preparation contextualityparity oblivious random access codessee-saw SDP

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum coding (general) (81P70) Contextuality in quantum theory (81P13)

Related Items (3)

Random access test as an identifier of nonclassicality* ⋮ Advantage of Quantum Theory over Nonclassical Models of Communication ⋮ Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios

Cites Work

• Unnamed Item
• Unnamed Item
• Ontological models, preparation contextuality and nonlocality
• Belief-invariant and quantum equilibria in games of incomplete information
• Dense quantum coding and a lower bound for 1-way quantum automata
• Testing the Dimension of Hilbert Spaces
• From Bell’s Theorem to Secure Quantum Key Distribution
• Dense quantum coding and quantum finite automata
• Simple unified form for the major no-hidden-variables theorems
• Limits on nonlocal correlations from the structure of the local state space
• Optimal bounds for parity-oblivious random access codes
• Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square

This page was built for publication: Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities