Prepare-and-measure and entanglement simulation beyond qubits

• URL: http://arxiv.org/abs/2508.02377v1
• Date: Mon, 04 Aug 2025 13:04:36 GMT
• Title: Prepare-and-measure and entanglement simulation beyond qubits
• Authors: Mani Zartab, Giulio Gasbarri, Gael Sentís, Ramon Muñoz-Tapia,
• Abstract summary: We identify the key features of the exact classical protocol in $d=2$, and use them to construct robust approximate protocols in higher dimensions.<n>Our approach exactly reproduces the quantum probability distributions for $d=2$, and performs very well compared to existing protocols for higher dimensions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For two non-communicating parties, quantum theory can give rise to probability distributions of outcomes that cannot be reproduced by any local classical model without communication. However, in the case of two-dimensional systems ($d=2$), it is known that allowing a finite amount of classical communication to shared classical resources makes it possible to simulate these quantum correlations. Whether such a simulation remains possible in higher dimensions is still an open question. In this work, we identify the key features of the exact classical protocol in $d=2$, and use them to construct robust approximate protocols in higher dimensions. We assess their performance through a randomized numerical study based on the Total Variation Distance. Our approach exactly reproduces the quantum probability distributions for $d=2$, and performs very well compared to existing protocols for higher dimensions, being the most robust protocol in all cases studied. These results offer new insights into the analytical structure of classical protocols in higher dimensions.

Related papers

• New Key Rate Bound for High-Dimensional BB84 with Multiple Basis Measurements [2.8851756275902467]
  We derive a new bound on the secret key-rate of the High Dimensional BB84 protocol.<n>We show that far more optimistic key-rates are possible for a low number of signals, even in general channels.
  arXiv  Detail & Related papers  (2025-04-15T15:55:24Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• Nearly query-optimal classical shadow estimation of unitary channels [6.715668514390893]
  Classical shadow estimation is a powerful tool for learning properties of quantum states and quantum processes. By querying an unknown unitary channel in quantum experiments, the goal is to learn a classical description of $mathcalU$. Our protocol can also be applied to simultaneously predict many non-linear properties such as out-of-time-ordered correlators.
  arXiv  Detail & Related papers  (2024-10-18T15:25:40Z)
• Quantum information with quantum-like bits [0.0]
  We show how arbitrary gates can be implemented by manipulating many-body correlations.<n>This suggests the possibility of quantum-like information processing on a special class of many-body classical systems.
  arXiv  Detail & Related papers  (2024-08-12T20:40:54Z)
• Quantifying protocol efficiency: a thermodynamic figure of merit for classical and quantum state-transfer protocols [0.0]
  We focus on classical and quantum protocols transferring a state across a double-well potential.<n>The classical protocols are achieved by deforming the potential, while the quantum ones are assisted by a counter-diabatic driving.<n>We show that quantum protocols perform more quickly and accurately.
  arXiv  Detail & Related papers  (2022-12-20T09:19:51Z)
• 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)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)

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.