A tight consecutive measurement theorem and its applications

• URL: http://arxiv.org/abs/2504.12754v1
• Date: Thu, 17 Apr 2025 08:47:29 GMT
• Title: A tight consecutive measurement theorem and its applications
• Authors: Chen-Xun Weng, Minglong Qin, Yanglin Hu, Marco Tomamichel,
• Abstract summary: We apply the consecutive measurement theorem to quantum nonlocal games.<n>We also present a novel application of the theorem to obtain a tighter trade-offs bound in quantum oblivious transfer.<n>These results enhance the theoretical tools for analyzing quantum advantage and have concrete implications for nonlocal games and quantum cryptographic protocols.
• Score: 7.912206996605676
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In many cryptographic tasks, we encounter scenarios where information about two incompatible observables must be retrieved. A natural approach is to perform consecutive measurements, raising a key question: How does the information gained from the first measurement compare to that from both? The consecutive measurement theorem provides a general relation between these quantities and has been used in quantum proofs of knowledge and nonlocal games. However, its previous formulations are often too loose to yield meaningful bounds, especially in quantum nonlocal games. Here, we establish a tight version of the theorem and apply it to improve the best-known bounds on the quantum value of $\text{CHSH}_q(p)$ games and their parallel repetition. We also present a novel application of the theorem to obtain a tighter trade-offs bound in quantum oblivious transfer for certain regimes. These results enhance the theoretical tools for analyzing quantum advantage and have concrete implications for nonlocal games and quantum cryptographic protocols.

Related papers

• (Almost-)Quantum Bell Inequalities and Device-Independent Applications [3.7482527016282963]
  We present families of (almost)quantum Bell inequalities and highlight three foundational and DI applications. We derive quantum Bell inequalities that show a separation of the quantum boundary from certain portions of the no-signaling boundary of dimension up to 4k-8. We provide the most precise characterization of the quantum boundary known so far.
  arXiv  Detail & Related papers  (2023-09-12T15:13:02Z)
• 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)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Theorems motivated by foundations of quantum mechanics and some of their applications [0.0]
  This paper provides theorems aimed at shedding light on issues in the foundations of quantum mechanics. theorems can be used to propose new interpretations to the theory, or to better understand, evaluate and improve current interpretations.
  arXiv  Detail & Related papers  (2022-02-02T21:55:57Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum guessing games with posterior information [68.8204255655161]
  A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial information after a quantum measurement has been performed. We formalize symmetry of guessing games and characterize the optimal measurements in cases where the symmetry is related to an irreducible representation.
  arXiv  Detail & Related papers  (2021-07-25T19:10:26Z)
• A Theoretical Framework for Learning from Quantum Data [15.828697880068704]
  We propose a theoretical foundation for learning classical patterns from quantum data. We present a quantum counterpart of the well-known PAC framework. We establish upper bounds on the quantum sample complexity quantum concept classes.
  arXiv  Detail & Related papers  (2021-07-13T21:39:47Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Bounding generalized relative entropies: Nonasymptotic quantum speed limits [0.0]
  Information theory has become an increasingly important research field to better understand quantum mechanics. Relative entropy quantifies how difficult is to tell apart two probability distributions, or even two quantum states. We show how this quantity changes under a quantum process.
  arXiv  Detail & Related papers  (2020-08-27T15:37:04Z)
• R\'{e}nyi formulation of uncertainty relations for POVMs assigned to a quantum design [0.0]
  Information entropies provide powerful and flexible way to express restrictions imposed by the uncertainty principle. In this paper, we obtain uncertainty relations in terms of min-entropies and R'enyi entropies for POVMs assigned to a quantum design.
  arXiv  Detail & Related papers  (2020-04-12T09:44:44Z)

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.