{"title":"Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements","authors":"Touheed Anwar Atif;S. Sandeep Pradhan","doi":"10.1109/TIT.2025.3539082","DOIUrl":null,"url":null,"abstract":"We consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In this setup, the constituent sub-systems of the joint quantum state are measured by two agents, Alice and Bob. A third agent, Charlie, receives the measurement outcomes sent by Alice and Bob. Charlie uses local and pairwise shared randomness to compute a bivariate function of the measurement outcomes. The objective of three agents is to faithfully simulate the given distributed quantum measurement acting on the given quantum state while minimizing the communication and shared randomness rates. We demonstrate a new inner bound to the rate region using random structured POVMs based on asymptotically good algebraic codes, and characterize the performance limit using single-letter quantum mutual information quantities. This new bound subsumes the largest known inner bound and improves upon it strictly for identified examples. One of the challenges in analyzing these structured POVMs is that they exhibit only pairwise independence and induce only uniform single-letter distributions. We address these in the non-commutative quantum setting, and provide a two-party distributed faithful simulation and function computation protocol.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2800-2825"},"PeriodicalIF":2.2000,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10877921/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In this setup, the constituent sub-systems of the joint quantum state are measured by two agents, Alice and Bob. A third agent, Charlie, receives the measurement outcomes sent by Alice and Bob. Charlie uses local and pairwise shared randomness to compute a bivariate function of the measurement outcomes. The objective of three agents is to faithfully simulate the given distributed quantum measurement acting on the given quantum state while minimizing the communication and shared randomness rates. We demonstrate a new inner bound to the rate region using random structured POVMs based on asymptotically good algebraic codes, and characterize the performance limit using single-letter quantum mutual information quantities. This new bound subsumes the largest known inner bound and improves upon it strictly for identified examples. One of the challenges in analyzing these structured POVMs is that they exhibit only pairwise independence and induce only uniform single-letter distributions. We address these in the non-commutative quantum setting, and provide a two-party distributed faithful simulation and function computation protocol.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.