Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.10947

Faithful Simulation of Broadcast Measurements

Anders Høst-Madsen

quant-phcs.ITSubmitted Jan 16, 2026• Announced Jan 19, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper a central server Charlie has access to a quantum system C and measures it with a POVM $\{Λ_x\}$. Alice and Bob are only interested in the partial results $g_A(x)$ respectively $g_B(x)$. Alice, Bob, and Charlie share common randomness and Alice and Bob only need to faithfully simulate their measurements. The paper develops to achievable regions for the amount of communication needed to Alice and Bob.

Comments
Submitted to IEEE ISIT'26

Related papers

Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements

Touheed Anwar Atif, S. Sandeep Pradhan

In this work, we consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In the distributed 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 achievable information-theoretic rate-region that exploits the bivariate function using random structured POVMs based on asymptotically good algebraic codes. The algebraic structure of these codes is matched to that of the bivariate function that models the action of Charlie. The conventional approach for this class of problems has been to reconstruct individual measurement outcomes corresponding to Alice and Bob, at Charlie, and then compute the bivariate function, achieved using mutually independent approximating POVMs based on random unstructured codes. In the present approach, using algebraic structured POVMs, the computation is performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie. Using this, we show that a strictly larger rate region can be achieved. One of the challenges in analyzing these structured POVMs is that they exhibit only pairwise independence and induce only uniform single-letter distributions. To address this, we use nesting of algebraic codes and develop a covering lemma applicable to pairwise-independent POVM ensembles. Combining these techniques, we provide a multi-party distributed faithful simulation and function computation protocol.

arXiv:2101.02360•Jan 7, 2021•0 citations

Quantum error rejection for faithful quantum communication over noise channels

Peng‐Liang Guo, Cheng‐Yan Gao, Tao Li +2 more

Science China Physics Mechanics and Astronomy•May 31, 2019•17 citations

Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory

Touheed Anwar Atif, Mohsen Heidari, S. Sandeep Pradhan

We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Charlie, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at Charlie. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to Charlie, and the common randomness shared among the three parties, while faithfully simulating independent repeated instances of the original measurement. To achieve this, we develop a mutual covering lemma and a technique for random binning of distributed quantum measurements, and, in turn, characterize a set of sufficient communication and common randomness rates required for asymptotic simulatability in terms of single-letter quantum information quantities. In the special case, where the Charlie’s action is restricted to a deterministic mapping, we develop a one-shot performance characterization of the distributed faithful simulation problem. Furthermore, using these results we address a distributed quantum rate-distortion problem, where we characterize the achievable rate distortion region through a single-letter inner bound. Finally, via a technique of single-letterization of multi-letter quantum information quantities, we provide an outer bound for the rate-distortion region.

arXiv:1901.06788•IEEE Transactions on Information Theory•Nov 2, 2021•13 citations

Simple and Tighter Derivation of Achievability for Classical Communication Over Quantum Channels

Hao–Chung Cheng

A judicious application of the so-called pretty-good measurement in quantum coding considerably simplifies the derivation of one-shot achievability, sharpening many existing quantum information-processing protocols.

arXiv:2208.02132•PRX Quantum•Nov 22, 2023•13 citations

Nearly deterministic Bell measurement using quantum communication bus

Jiaming Wang, Meng-Zheng Zhu, Dong Wang +1 more

Quantum Information Processing•Jan 28, 2017•1 citation

Faithful Simulation of Distributed Quantum Measurement with Coding for Computing

Anders Høst-Madsen

This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $ρ^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two share common randomness. The central question is: what is the minimum amount of communication and common randomness required to faithfully simulate the measurement? This paper derives an achievable rate region.

arXiv:2501.12271•Jan 21, 2025•0 citations
In this paper a central server Charlie has access to a quantum system C and measures it with a POVM {Λx}\{Λ_x\}{Λx​}. Alice and Bob are only interested in the partial results gA(x)g_A(x)gA​(x) respectively gB(x)g_B(x)gB​(x). Alice, Bob, and Charlie share common randomness and Alice and Bob only need to faithfully simulate their measurements. The paper develops to achievable regions for the amount of communication needed to Alice and Bob.
In this work, we consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In the distributed 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 achievable information-theoretic rate-region that exploits the bivariate function using random structured POVMs based on asymptotically good algebraic codes. The algebraic structure of these codes is matched to that of the bivariate function that models the action of Charlie. The conventional approach for this class of problems has been to reconstruct individual measurement outcomes corresponding to Alice and Bob, at Charlie, and then compute the bivariate function, achieved using mutually independent approximating POVMs based on random unstructured codes. In the present approach, using algebraic structured POVMs, the computation is performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie. Using this, we show that a strictly larger rate region can be achieved. One of the challenges in analyzing these structured POVMs is that they exhibit only pairwise independence and induce only uniform single-letter distributions. To address this, we use nesting of algebraic codes and develop a covering lemma applicable to pairwise-independent POVM ensembles. Combining these techniques, we provide a multi-party distributed faithful simulation and function computation protocol.
We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Charlie, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at Charlie. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to Charlie, and the common randomness shared among the three parties, while faithfully simulating independent repeated instances of the original measurement. To achieve this, we develop a mutual covering lemma and a technique for random binning of distributed quantum measurements, and, in turn, characterize a set of sufficient communication and common randomness rates required for asymptotic simulatability in terms of single-letter quantum information quantities. In the special case, where the Charlie’s action is restricted to a deterministic mapping, we develop a one-shot performance characterization of the distributed faithful simulation problem. Furthermore, using these results we address a distributed quantum rate-distortion problem, where we characterize the achievable rate distortion region through a single-letter inner bound. Finally, via a technique of single-letterization of multi-letter quantum information quantities, we provide an outer bound for the rate-distortion region.
This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system ρABρ^{AB}ρAB. Alice transmits the results of her measurements to Bob over a classical channel, and the two share common randomness. The central question is: what is the minimum amount of communication and common randomness required to faithfully simulate the measurement? This paper derives an achievable rate region.