Entanglement in prepare-and-measure scenarios without receiver inputs

• URL: http://arxiv.org/abs/2603.29625v1
• Date: Tue, 31 Mar 2026 11:46:27 GMT
• Title: Entanglement in prepare-and-measure scenarios without receiver inputs
• Abstract summary: Most elementary prepare-and-measure scenarios have no independent measurement inputs.<n>We study them systematically and reveal several of their basic features.<n>For classical messages, we first identify the minimal scenario with a quantum advantage.<n>Then, we show that quantum advantages can be propelled by nonlocality of the Clauser-Horne-Shimony-Holt type.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The most elementary prepare-and-measure scenarios have no independent measurement inputs. No inputs mean that quantum advantages require two indispensable ingredients: shared entanglement and measurements that can be adapted to the communicated messages. Understanding these scenarios is therefore conceptually natural, but also practically relevant, since they act as testbeds for black-box certification of adaptive one-way LOCC. Here, we study them systematically and reveal several of their basic features. For classical messages, we first identify the minimal scenario with a quantum advantage and show that it is maximised by high-dimensional entanglement. Then, we identify the next-to-minimal scenario, and show that quantum advantages can be propelled by nonlocality of the Clauser-Horne-Shimony-Holt type, which makes this an appropriate setting for certification experiments. Proceeding further, we replace classical messages with quantum messages, but require the receiver to read the message before measuring the entangled particle. We show that this leads to amplified quantum advantages, that are made possible only thanks to non-projective message read-out. This in dispensable role of non-projective measurements challenges the common wisdom that they play a secondary role in revealing the power of quantum correlations in black-box experiments.

Related papers

• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication [0.0]
  We show that quantum strategies without any shared entanglement can outperform the classical ones.<n>Explicit quantum protocols are studied that violate these inequalities.<n>We prove that when each sender has a binary input, the quantum advantage grows with the number of senders.
  arXiv  Detail & Related papers  (2025-06-09T12:38:58Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage [5.669806907215807]
  We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. Our work paves the way for immediate applications in near-term quantum technologies.
  arXiv  Detail & Related papers  (2024-03-05T05:09:32Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Randomness-free Test of Non-classicality: a Proof of Concept [0.0]
  Existing schemes to certify such non-classical resources in a device-independent manner require seed randomness. We propose and experimentally implement a semi-device independent certification technique for both quantum correlations and non-projective measurements without seed randomness.
  arXiv  Detail & Related papers  (2023-03-13T10:44:16Z)
• 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)
• Robust certification of unsharp instruments through sequential quantum advantages in a prepare-measure communication game [1.7205106391379026]
  We propose a specific two-party communication game in the prepare-measure scenario that relies on an encoding-decoding task of specific information. We first demonstrate that quantum theory outperforms the classical preparation non-contextual theory, and the optimal quantum success probability of such a communication game enables the semi-device-independent certification of qubit states and measurements.
  arXiv  Detail & Related papers  (2022-12-29T07:54:45Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Certification of incompatible measurements using quantum steering [0.0]
  We consider the problem of certification of quantum measurements with an arbitrary number of outcomes. We propose a simple scheme for certifying any set of $d$-outcome projective measurements which do not share any common invariant proper subspace.
  arXiv  Detail & Related papers  (2021-07-01T13:04:47Z)
• 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)

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.