Tight and Robust Consecutive Measurement Theorems with Applications to Quantum Cryptography

• URL: http://arxiv.org/abs/2504.12754v2
• Date: Mon, 23 Jun 2025 08:48:26 GMT
• Title: Tight and Robust Consecutive Measurement Theorems with Applications to Quantum Cryptography
• Authors: Chen-Xun Weng, Minglong Qin, Yanglin Hu, Marco Tomamichel,
• Abstract summary: The consecutive measurement theorem (CMT) provides a general relation between these quantities.<n>We first establish a tight CMT and apply it to achieve the best upper bounds on the quantum value of certain nonlocal games.<n>We then develop a robust CMT and explore a novel application of CMT to obtain the tightest known no-go theorem for quantum oblivious transfer.
• Score: 7.912206996605676
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In many quantum information 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 (CMT) provides a general relation between these quantities and has found applications in quantum cryptography. However, its previous formulations are often either too loose or too brittle to yield meaningful bounds. In this work, we first establish a tight CMT and apply it to achieve the best upper bounds on the quantum value of certain nonlocal games and their parallel repetitions to date. We then develop a robust CMT and explore a novel application of CMT to obtain the tightest known no-go theorem for quantum oblivious transfer. These contributions strengthen the theoretical tools for analyzing quantum advantage and have concrete implications for nonlocal games and quantum cryptographic protocols.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• (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)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• 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)
• Quantum jump metrology in a two-cavity network [0.0]
  In interferometry, quantum physics is used to enhance measurement precision. An alternative approach is quantum metrology jump [L. A. Clark et al., Phys A 99, 022102] which deduces information by continuously monitoring an open quantum system. It is shown that the proposed approach can exceed the standard quantum limit without the need for complex quantum states being scalable.
  arXiv  Detail & Related papers  (2022-01-12T10:53:24Z)
• Probably approximately correct quantum source coding [0.0]
  Holevo's and Nayak's bounds give an estimate of the amount of classical information that can be stored in a quantum state. We show two novel applications in quantum learning theory and delegated quantum computation with a purely classical client.
  arXiv  Detail & Related papers  (2021-12-13T17:57:30Z)
• 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)
• Quantum Fisher information from randomized measurements [0.0]
  The quantum Fisher information (QFI) is a fundamental quantity of interest in many areas. We use measurements of the density matrix to construct lower bounds that converge to the QFI. We present two examples of applications of the method in quantum systems made of coupled qubits and collective spins.
  arXiv  Detail & Related papers  (2021-05-27T14:16:14Z)
• 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.