Bounding the classical cost of simulating quantum behaviors in the prepare-and-measure scenario
Sebastian Schl\"osser (1, 2, 3), Matthias Kleinmann (3, 4) ((1) Uppsala University, Uppsala, Sweden, (2) Nordita, Stockholm, Sweden, (3) Universit\"at Siegen, Siegen, Germany, (4) University of M\"unster, M\"unster, Germany)

TL;DR
This paper investigates the classical communication cost needed to simulate quantum prepare-and-measure scenarios, reducing known bounds and analyzing specific restricted state sets to better understand the classical resources required.
Contribution
It provides new lower bounds on classical communication costs for simulating quantum systems, including reductions for qubit and qutrit scenarios, and introduces a method to bound costs based on state sets.
Findings
Average communication cost for qubit simulation is 1.89 bits.
Reducing the minimal state preparations for a qubit to 6 with 5 measurements.
At least 5 classical messages are needed for certain real qutrit simulations.
Abstract
We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement. The quantum state of the system is unknown to Bob, and the measurement is unknown to Alice. It has recently been shown that shared randomness and two bits of classical communication are necessary and sufficient to simulate the transmission of a qubit. We show that the communication cost can be reduced to an average of bits. We then study restricted sets of state preparations: First, for a restriction to real-valued qubit states, if the communication of a classical trit is sufficient, we show that the corresponding protocol must have a convoluted form. We then reduce the smallest qubit scenario requiring two bits of classical communication to only state preparations and measurements. For a qutrit, it is not known whether the communication…
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 Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
