Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games

[2311.12887] Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games Skip to main content Search Submit Donate Log in Quantum Physics arXiv:2311.12887 (quant-ph) [Submitted on 21 Nov 2023 ( v1 ), last revised 25 Aug 2026 (this version, v4)] Title: Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games Authors: Pete Rigas View PDF HTML (experimental) Abstract: We analyze optimal, and approximately optimal, quantum strategies in two non-local settings based upon previous investigations of the XOR and CHSH games. By building upon previous arguments due to Ostrev in 2016, {\color{blue}[37]}, which characterized approximately optimal, and optimal, strategies that players Alice and Bob can adopt for increasing their respective winning probabilities, we identify additional applications of the framework for analyzing prospective quantum advantage in other game-theoretic settings. In particular, while it is possible for Alice and Bob to realize quantum advantage if they adopt strategies that are dependent upon entanglement, two-dimensional resource systems, and reversible transformations, the magnitude of the duality gap between the performance of classical and quantum strategies has not yet been classified from the perspective of error bounds. Such bounds are not only dependent upon the winning probability if Alice and Bob leverage entanglement in their strategies but also upon a suitably defined representation-theoretic intertwining operation. Comments: Template (78 pages, expanded references). Overview presentation available at this https URL Subjects: Quantum Physics (quant-ph) ; Information Theory (cs.IT) MSC classes: 81P02, 81Q02 Cite as: arXiv:2311.12887 [quant-ph] (or arXiv:2311.12887v4 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2311.12887 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Pete Rigas [ view email ] [v1] Tue, 21 Nov 2023 04:03:26 UTC (19 KB) [v2] Sat, 20 Apr 2024 06:25:38 UTC (19 KB) [v3] Wed, 7 Aug 2024 12:52:41 UTC (20 KB) [v4] Tue, 25 Aug 2026 09:38:02 UTC (47 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2023-11 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP SciX Google Scholar Semantic Scholar export BibTeX citation 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)

Related documents

• Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games#670265
• Quantum interaction can superactivate cheating under parallel repetition#1105781
• Benchmarking indirect quantum control schemes via higher-order quantum operations#1012595
• Exponential lower bounds for low-degree strategies in position-based quantum cryptography#1130247
• Extended Graphon Mean-Field Games in Discrete Time#971410