6533b829fe1ef96bd128a4c4

RESEARCH PRODUCT

Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities

Dmitry KravchenkoAnubhav ChaturvediAndris AmbainisManik BanikAshutosh Rai

subject

FOS: Computer and information sciencesExistential quantificationComputer Science - Information TheoryFOS: Physical sciences01 natural sciences010305 fluids & plasmasTheoretical Computer ScienceQuantum state0103 physical sciencesElectrical and Electronic Engineering010306 general physicsQuantumMathematicsQuantum computerDiscrete mathematicsQuantum PhysicsInformation Theory (cs.IT)Statistical and Nonlinear PhysicsParity (physics)Electronic Optical and Magnetic MaterialsKochen–Specker theoremModeling and SimulationSignal ProcessingOnticQuantum Physics (quant-ph)Random access

description

One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such tasks in any preparation noncontextual theory. These bounds constitute noncontextuality inequalities for any value of d. For d=3, using a set of mutually asymmetric biased bases we show that the corresponding noncontextual bound is violated by quantum theory. We also show quantum violation of the inequalities for some other higher values of d. This reveals operational usefulness of preparation contextuality of higher level quantum systems.

yearjournalcountryeditionlanguage
2016-07-19
http://arxiv.org/abs/1607.05490