Bounding the classical cost of simulating quantum behaviors in the prepare-and-measure scenario

• URL: http://arxiv.org/abs/2603.01255v1
• Date: Sun, 01 Mar 2026 20:18:43 GMT
• Title: Bounding the classical cost of simulating quantum behaviors in the prepare-and-measure scenario
• Authors: Sebastian Schlösser, Matthias Kleinmann,
• Abstract summary: We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement.<n>We show that the communication cost can be reduced to an average of $1.89$ bits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 $1.89$ 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 $6$ state preparations and $5$ measurements. For a qutrit, it is not known whether the communication cost is finite; we identify a scenario that requires at least $5$ classical messages, already for the simulation of the real qutrit. Finally, we develop a method for restricted sets of states, that allows us to lower bound the classical communication cost based solely on the set of quantum states.

Related papers

• Does there exist a quantum fingerprinting protocol without coherent measurements? [2.445008192336424]
  We show that in the case of one-way LOCC measurements, $Omega(sqrtn)$ qubits communication is required.<n>We derive a new method to replace quantum messages by classical messages.
  arXiv  Detail & Related papers  (2025-02-19T04:55:02Z)
• Optimal unilocal virtual quantum broadcasting [5.80377843790023]
  We introduce protocols that can be approximated using physical operations with minimal cost. We formalize the simulation cost of a virtual quantum broadcasting protocol into a semidefinite programming problem.
  arXiv  Detail & Related papers  (2023-10-23T17:56:02Z)
• Neural Network Approach to the Simulation of Entangled States with One Bit of Communication [0.0]
  Bell's theorem states that Local Hidden Variables cannot fully explain the statistics of measurements on some entangled quantum states. It is natural to ask how much supplementary classical communication would be needed to simulate them. We present evidence that all projective measurements on partially entangled pure two-qubit states require only one bit of communication.
  arXiv  Detail & Related papers  (2023-05-31T15:19:00Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Classical Cost of Transmitting a Qubit [0.0]
  We show that the statistics obtained in any quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. In particular, two bits of communication are enough to simulate all quantum correlations associated to arbitrary local POVMs applied to any entangled two-qubit state.
  arXiv  Detail & Related papers  (2022-07-05T18:06:45Z)
• Quantum cost of dense coding and teleportation [7.238541917115604]
  We show that the quantum cost of d-dimensional dense coding protocol is equal to d+3 when transmitting the classical message. In contrast, the quantum cost of high-dimensional teleportation protocols is equal to 13, which is the maximum value of the cost for the two-dimensional case.
  arXiv  Detail & Related papers  (2022-02-25T08:15:55Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Quantum secure direct communication with private dense coding using general preshared quantum state [59.99354397281036]
  We study secure direct communication by using a general preshared quantum state and a generalization of dense coding. For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
  arXiv  Detail & Related papers  (2021-12-30T16:12:07Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.