用于多重独立性测试和经典量子任意变化多重接入信道的通用测试仪

Ayanava Dasgupta, Naqueeb Ahmad Warsi, Masahito Hayashi
{"title":"用于多重独立性测试和经典量子任意变化多重接入信道的通用测试仪","authors":"Ayanava Dasgupta, Naqueeb Ahmad Warsi, Masahito Hayashi","doi":"arxiv-2409.05619","DOIUrl":null,"url":null,"abstract":"We study two kinds of different problems. One is the multiple independence\ntesting, which can be considered as a kind of generalization of quantum Stein's\nlemma. We test whether the quantum system is correlated to the classical system\nor is independent of it. Here, the null hypothesis is composed of states having\nthe quantum system is correlated to the classical system in an arbitrarily\nvarying form. The second problem is the problem of reliable communication over\nclassical-quantum arbitrarily varying multiple access channels (CQ-AVMAC) and\nestablishing its capacity region by giving multiple achievability techniques.\nWe prove that each of these techniques is optimal by proving a converse.\nFurther, for both these techniques, the decoder designed is a \\emph{universal}\ndecoder and can achieve any rate pair in the capacity region without time\nsharing and also these decoders do not depend on the channel and therefore they\nare universal. Our result covers the case when the channel parameter is\ncontinuous, which has not been studied even in the classical case. Further,\nboth these techniques can be easily generalized to the case when there are $T\n(T>2)$ senders. The design of each of these decoders is based on the study of\nmultiple independence testing. This approach allows us to study the problem of\nreliable communication over CQ-AVMAC from the point of view of hypothesis\ntesting. Further, we also give a necessary and sufficient condition for the\ndeterministic code capacity region of CQ-AVMAC to be non-empty.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel\",\"authors\":\"Ayanava Dasgupta, Naqueeb Ahmad Warsi, Masahito Hayashi\",\"doi\":\"arxiv-2409.05619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study two kinds of different problems. One is the multiple independence\\ntesting, which can be considered as a kind of generalization of quantum Stein's\\nlemma. We test whether the quantum system is correlated to the classical system\\nor is independent of it. Here, the null hypothesis is composed of states having\\nthe quantum system is correlated to the classical system in an arbitrarily\\nvarying form. The second problem is the problem of reliable communication over\\nclassical-quantum arbitrarily varying multiple access channels (CQ-AVMAC) and\\nestablishing its capacity region by giving multiple achievability techniques.\\nWe prove that each of these techniques is optimal by proving a converse.\\nFurther, for both these techniques, the decoder designed is a \\\\emph{universal}\\ndecoder and can achieve any rate pair in the capacity region without time\\nsharing and also these decoders do not depend on the channel and therefore they\\nare universal. Our result covers the case when the channel parameter is\\ncontinuous, which has not been studied even in the classical case. Further,\\nboth these techniques can be easily generalized to the case when there are $T\\n(T>2)$ senders. The design of each of these decoders is based on the study of\\nmultiple independence testing. This approach allows us to study the problem of\\nreliable communication over CQ-AVMAC from the point of view of hypothesis\\ntesting. Further, we also give a necessary and sufficient condition for the\\ndeterministic code capacity region of CQ-AVMAC to be non-empty.\",\"PeriodicalId\":501082,\"journal\":{\"name\":\"arXiv - MATH - Information Theory\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.05619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们研究两种不同的问题。一种是多重独立检验,它可以被视为量子斯坦因困境的一种概括。我们要检验量子系统是否与经典系统相关,或者是否独立于经典系统。在这里,无效假设由量子系统与经典系统以任意变化的形式相关的状态组成。第二个问题是经典量子任意变化多址信道(CQ-AVMAC)上的可靠通信问题,通过给出多种可实现性技术来建立其容量区域。我们通过证明反证来证明这些技术中的每一种都是最优的。此外,对于这两种技术,所设计的解码器都是\emph{universal}解码器,可以在容量区域内实现任意速率对,而无需分时,而且这些解码器不依赖于信道,因此它们是通用的。我们的结果涵盖了信道参数连续的情况,而这种情况即使在经典情况下也没有被研究过。此外,这两种技术都可以很容易地推广到有 $T(T>2)$ 发送方的情况。每种解码器的设计都基于对多重独立性检验的研究。这种方法允许我们从假设检验的角度研究 CQ-AVMAC 的可靠通信问题。此外,我们还给出了 CQ-AVMAC 的确定性代码容量区域非空的必要条件和充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel
We study two kinds of different problems. One is the multiple independence testing, which can be considered as a kind of generalization of quantum Stein's lemma. We test whether the quantum system is correlated to the classical system or is independent of it. Here, the null hypothesis is composed of states having the quantum system is correlated to the classical system in an arbitrarily varying form. The second problem is the problem of reliable communication over classical-quantum arbitrarily varying multiple access channels (CQ-AVMAC) and establishing its capacity region by giving multiple achievability techniques. We prove that each of these techniques is optimal by proving a converse. Further, for both these techniques, the decoder designed is a \emph{universal} decoder and can achieve any rate pair in the capacity region without time sharing and also these decoders do not depend on the channel and therefore they are universal. Our result covers the case when the channel parameter is continuous, which has not been studied even in the classical case. Further, both these techniques can be easily generalized to the case when there are $T (T>2)$ senders. The design of each of these decoders is based on the study of multiple independence testing. This approach allows us to study the problem of reliable communication over CQ-AVMAC from the point of view of hypothesis testing. Further, we also give a necessary and sufficient condition for the deterministic code capacity region of CQ-AVMAC to be non-empty.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信