Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities

[2406.09111] Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2406.09111 (quant-ph) [Submitted on 13 Jun 2024 ( v1 ), last revised 3 Mar 2026 (this version, v3)] Title: Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities Authors: Soumyabrata Hazra , Debashis Saha , Anubhav Chaturvedi , Subhankar Bera , A. S. Majumdar View a PDF of the paper titled Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities, by Soumyabrata Hazra and 4 other authors View PDF HTML (experimental) Abstract: Finding a set of empirical criteria fulfilled by any theory satisfying the generalized notion of noncontextuality is a challenging task of both operational and foundational importance. This work presents a methodology for constructing the noncontextual polytope while ensuring that the dimension of the polytope associated with the preparations remains constant regardless of the number of measurements and their outcome size. The facet inequalities of the noncontextual polytope can thus be obtained in a computationally efficient manner. We illustrate the efficacy of our methodology through several distinct contextuality scenarios. Our investigation uncovers several hitherto unexplored noncontextuality inequalities and demonstrates applications of quantum contextual correlations in certification of non-projective measurements, witnessing the dimension of quantum systems, and randomness certification. Comments: 18 pages, 9 figures Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2406.09111 [quant-ph] (or arXiv:2406.09111v3 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2406.09111 Focus to learn more arXiv-issued DOI via DataCite Journal reference: Quantum 10, 2015 (2026) Related DOI : https://doi.org/10.22331/q-2026-03-09-2015 Focus to learn more DOI(s) linking to related resources Submission history From: Soumyabrata Hazra [ view email ] [v1] Thu, 13 Jun 2024 13:40:30 UTC (503 KB) [v2] Sun, 1 Mar 2026 10:14:41 UTC (537 KB) [v3] Tue, 3 Mar 2026 18:55:38 UTC (537 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities, by Soumyabrata Hazra and 4 other authors View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2024-06 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities#189195
• Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities#189095
• Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities#189045
• Learning structural balance of graphs from quantum spectral features#999425
• Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints#1131911