*-isomorphic Game Algebras

Samuel J. Harris
{"title":"*-isomorphic Game Algebras","authors":"Samuel J. Harris","doi":"10.26421/qic22.11-12-2","DOIUrl":null,"url":null,"abstract":"We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is $*$-isomorphic to the game algebra of an associated bisynchronous game on $nk$ inputs and $nk$ outputs. As a result, we show that there are bisynchronous games with equal question and answer sets, whose optimal strategies only exist in the quantum commuting model, and not in the quantum approximate model. Moreover, we show that there are bisynchronous games with equal question and answer sets that have non-zero game algebras, but no winning quantum commuting strategies, resolving a problem of V.I. Paulsen and M. Rahaman. We also exhibit a $*$-isomorphism between any synchronous game algebra with $n$ questions and $k>3$ answers and a synchronous game algebra with $n(k-2)$ questions and $3$ answers.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"8 3-4","pages":"924-946"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Inf. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/qic22.11-12-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is $*$-isomorphic to the game algebra of an associated bisynchronous game on $nk$ inputs and $nk$ outputs. As a result, we show that there are bisynchronous games with equal question and answer sets, whose optimal strategies only exist in the quantum commuting model, and not in the quantum approximate model. Moreover, we show that there are bisynchronous games with equal question and answer sets that have non-zero game algebras, but no winning quantum commuting strategies, resolving a problem of V.I. Paulsen and M. Rahaman. We also exhibit a $*$-isomorphism between any synchronous game algebra with $n$ questions and $k>3$ answers and a synchronous game algebra with $n(k-2)$ questions and $3$ answers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
*-同构对策代数
在相应的对策代数是$*$-同构的意义上,我们建立了同步非局部对策的几个强等价。我们首先证明了在$n$输入和$k$输出上的任何同步博弈的博弈代数与在$nk$输入和$nk$输出上的相关双同步博弈的博弈代数是$*$-同构的。结果表明,存在问答集相等的双同步博弈,其最优策略只存在于量子交换模型中,而不存在于量子近似模型中。此外,我们还证明了具有相等问答集的双同步博弈存在非零博弈代数,但没有获胜的量子交换策略,从而解决了V.I. Paulsen和M. Rahaman的问题。我们还展示了具有$n$问题和$k>3$答案的任何同步博弈代数与具有$n(k-2)$问题和$3$答案的同步博弈代数之间的$*$-同构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A quantization of interacting particle systems Guidelines to use the ICSM for developing quantum-classical systems A Comparative Analysis of Quantum-based Approaches for Scalable and Efficient Data mining in Cloud Environments On the quantum complexity of integration of a function with unknown singularity Site recurrence for continuous-time open quantum walks on the line
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1