Glued magic games self-test maximally entangled states

• URL: http://arxiv.org/abs/2105.10658v2
• Date: Wed, 30 Jun 2021 14:32:23 GMT
• Title: Glued magic games self-test maximally entangled states
• Abstract summary: Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. We introduce the notion of self-testing convex combinations of reference strategies, which is a generalisation of self-testing to multiple strategies.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. The standard definition of self-testing does not apply in situations when there are two or more inequivalent optimal strategies. To address this, we introduce the notion of self-testing convex combinations of reference strategies, which is a generalisation of self-testing to multiple strategies. We show that the Glued Magic Square game [Quantum 4 (2020), p. 346] self-tests a convex combination of two inequivalent strategies. As a corollary, we obtain that the Glued Magic square game self-tests two EPR pairs thus answering an open question from [Quantum 4 (2020), p. 346]. Our self-test is robust and extends to natural generalisations of the Glued Magic Square game.

Related papers

• Minimax games for quantum channel discrimination [52.790001414559136]
  Quantum channel discrimination is a primitive task for identifying, verifying, and benchmarking quantum dynamics.<n>Here, we introduce a game-theoretic framework in which both the tester and jammer control separate inputs.<n>We develop a general argument that upgrades achievability results to strong converse results, thereby establishing strong converse properties for several game models.
  arXiv  Detail & Related papers  (2026-09-09T07:46:08Z)
• Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning [51.77462571479799]
  Multi-agent imitation learning (MA-IL) aims to learn optimal policies from expert demonstrations of interactions in multi-agent interactive domains.<n>Despite existing guarantees on the performance of the resulting learned policies, characterizations of how far the learned polices are from a Nash equilibrium are missing for offline MA-IL.
  arXiv  Detail & Related papers  (2026-02-24T15:38:11Z)
• Self-Harmony: Learning to Harmonize Self-Supervision and Self-Play in Test-Time Reinforcement Learning [48.14470449860784]
  Test-time reinforcement learning (TTRL) offers a label-free paradigm for adapting models using only synthetic signals at inference.<n>We introduce Self-Harmony, a framework built on a simple intuition.
  arXiv  Detail & Related papers  (2025-11-03T03:34:34Z)
• Quantum Sequential Universal Hypothesis Testing [62.751483592497806]
  Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states.<n>We introduce the quantum sequential universal test (QSUT), a novel framework for sequential QHT in the general case of composite hypotheses.<n> QSUT builds on universal inference, and it alternates between adaptive local measurements aimed at exploring the hypothesis space and joint measurements optimized for maximal discrimination.
  arXiv  Detail & Related papers  (2025-08-29T12:50:04Z)
• Fractional Reasoning via Latent Steering Vectors Improves Inference Time Compute [57.16286134405821]
  We propose Fractional Reasoning, a framework that enables continuous control over reasoning intensity at inference time.<n>Our method operates by extracting the latent steering vector associated with deeper reasoning and reapplying it with a tunable scaling factor.<n> Experiments on GSM8K, MATH500, and GPQA demonstrate that Fractional Reasoning consistently improves performance across diverse reasoning tasks and models.
  arXiv  Detail & Related papers  (2025-06-18T21:15:59Z)
• Lifting the maximally-entangledness assumption in robust self-testing for synchronous games [2.5979734944486648]
  Robust self-testing in non-local games allows a classical referee to certify that two untrustworthy players are able to perform a specific quantum strategy up to high precision.<n>This has been exploited in the celebrated MIP*=RE paper and related articles to prove robust self-testing results for synchronous games when restricting to PME strategies.<n>We prove that any perfect synchronous game which is a robust self-test when restricted to PME strategies, is in fact a robust self-test for all strategies.
  arXiv  Detail & Related papers  (2025-05-09T12:24:09Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• Robust self-testing for nonlocal games with robust game algebras [3.069161525997864]
  We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We prove that self-testing is equivalent to the uniqueness of finite-dimensional tracial states on the associated game algebra. Applying this tracial-state characterization of self-testing to parallel repetition, we show that a synchronous game is a self-test for perfect quantum strategies.
  arXiv  Detail & Related papers  (2024-11-05T16:55:39Z)
• Mirror-Consistency: Harnessing Inconsistency in Majority Voting [54.30719306011487]
  We present Mirror-Consistency, an enhancement of the standard Self-Consistency approach. Mirror-Consistency incorporates a'reflective mirror' into the self-ensemble decoding process. We show that Mirror-Consistency yields superior performance in both reasoning accuracy and confidence calibration compared to Self-Consistency.
  arXiv  Detail & Related papers  (2024-10-07T03:41:08Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Constant-sized self-tests for maximally entangled states and single projective measurements [0.0]
  Self-testing is a powerful certification of quantum systems relying on measured, classical statistics. This paper considers self-testing in bipartite Bell scenarios with small number of inputs and outputs, but with quantum states and measurements of arbitrarily large dimension.
  arXiv  Detail & Related papers  (2023-06-23T13:43:56Z)
• All Real Projective Measurements Can be Self-tested [0.0]
  We show that every real projective measurement can be self-tested. We employ the idea that existing self-tests can be extended to verify additional untrusted measurements. We develop a new technique of iterative self-testing, which involves using post-hoc self-testing in a sequential manner.
  arXiv  Detail & Related papers  (2023-02-02T09:50:13Z)
• Counterexamples in self-testing [0.0]
  We study self-testing in nonlocal games. In particular, could it be that every 2-party nonlocal game or Bell inequality with a quantum advantage certifies the presence of a specific quantum state? Our counterexamples are based on a class of games to be of independent interest.
  arXiv  Detail & Related papers  (2022-12-22T09:52:18Z)
• The quantum commuting model (Ia): The CHSH game and other examples: Uniqueness of optimal states [91.3755431537592]
  We use the universal description of quantum commuting correlations as state space on the universal algebra for two player games. We find that the CHSH game leaves a single optimal state on this common algebra.
  arXiv  Detail & Related papers  (2022-10-07T17:38:31Z)
• Experimental demonstration of optimal unambiguous two-out-of-four quantum state elimination [52.77024349608834]
  A core principle of quantum theory is that non-orthogonal quantum states cannot be perfectly distinguished with single-shot measurements. Here we implement a quantum state elimination measurement which unambiguously rules out two of four pure, non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2022-06-30T18:00:01Z)
• Practical parallel self-testing of Bell states via magic rectangles [0.0]
  Self-testing is a method to verify that one has a particular quantum state from purely classical statistics. We use the $3 times n$ magic rectangle games to obtain a self-test for $n$ Bell states where the one side needs only to measure single-qubit Pauli observables.
  arXiv  Detail & Related papers  (2021-05-09T23:07:18Z)
• Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing [87.17253904965372]
  We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. We show that these errors decrease exponentially with decay rates given by the measured relative entropies between the two states.
  arXiv  Detail & Related papers  (2021-04-30T00:52:48Z)
• Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games [78.65798135008419]
  It remains vastly open how to learn the Stackelberg equilibrium in general-sum games efficiently from samples. This paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in two-player turn-based general-sum games.
  arXiv  Detail & Related papers  (2021-02-23T05:11:07Z)

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.