2000 character limit reached
General Monogamy Relation between Information-Theoretic Contextuality Inequalities
Published 4 Feb 2015 in quant-ph | (1502.01098v1)
Abstract: We show that the perfect commutation graph is the sufficient tight condition for admitting the noncontextual description of each observable set satisfying it in the yes-no question scenario. With this condition, we propose a method for proving the monogamy relation between two informationtheoretic contextuality inequalities by decomposing the total commutation graph into perfect subgraphs. The results offer a powerful tool to investigate the contextuality and to understand quantum information theory. This theoretical work can be experimentally verified in current laboratorial technology.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.