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}
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.