{"title":"Atom graph, partial Boolean algebra and quantum contextuality","authors":"Songyi Liu, Yongjun Wang, Baoshan Wang, Jian Yan, Heng Zhou","doi":"10.1007/s11128-024-04632-2","DOIUrl":null,"url":null,"abstract":"<div><p>Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving that (i) the partial Boolean algebras for quantum systems are determined by their atom graphs; (ii) the states on atom graphs can be extended uniquely to the partial Boolean algebras, and (iii) each exclusivity graph is an induced graph of an atom graph. (i) and (ii) show that the finite dimensional quantum systems are uniquely determined by their atom graphs. which proves the reasonability of graphs as the models of quantum experiments. (iii) establishes a connection between atom graphs and exclusivity graphs, and introduces a method to express the exclusivity experiments more precisely. We also present a general and parametric description for Kochen–Specker theorem based on graphs, which gives a type of non-contextuality inequality for KS contextuality.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04632-2","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0
Abstract
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving that (i) the partial Boolean algebras for quantum systems are determined by their atom graphs; (ii) the states on atom graphs can be extended uniquely to the partial Boolean algebras, and (iii) each exclusivity graph is an induced graph of an atom graph. (i) and (ii) show that the finite dimensional quantum systems are uniquely determined by their atom graphs. which proves the reasonability of graphs as the models of quantum experiments. (iii) establishes a connection between atom graphs and exclusivity graphs, and introduces a method to express the exclusivity experiments more precisely. We also present a general and parametric description for Kochen–Specker theorem based on graphs, which gives a type of non-contextuality inequality for KS contextuality.
期刊介绍:
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.