Faithful Simulation of Distributed Quantum Measurement with Coding for Computing
Anders H{\o}st-Madsen

TL;DR
This paper investigates the minimal communication and shared randomness needed for two parties to accurately simulate a joint quantum measurement on a bipartite system, providing an achievable rate region.
Contribution
It introduces a new achievable rate region for simulating distributed quantum measurements with classical communication and shared randomness.
Findings
Derived an achievable rate region for the problem.
Quantified the minimum resources needed for faithful simulation.
Advances understanding of distributed quantum measurement simulation.
Abstract
This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
