Robust self-testing for nonlocal games with robust game algebras

• URL: http://arxiv.org/abs/2411.03259v1
• Date: Tue, 05 Nov 2024 16:55:39 GMT
• Title: Robust self-testing for nonlocal games with robust game algebras
• Authors: Yuming Zhao,
• Abstract summary: 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.
• Score: 3.069161525997864
• License:
• Abstract: We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. 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 show that the "if" direction of this statement also holds, provided that p is optimal/perfect for a nonlocal game that has a robust game algebra. This last condition applies to many nonlocal games of interest, including all XOR games, synchronous games, and boolean constrained system (BCS) games. For those nonlocal games with robust game algebras, we prove that self-testing is equivalent to the uniqueness of finite-dimensional tracial states on the associated game algebra, and robust self-testing is equivalent to the uniqueness of amenable tracial states. 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 if and only if its parallel repeated version is a self-test for perfect quantum strategies. As a proof approach, we give the first quantitative Gower-Hatami theorem that is applicable to C*-algebras. Here "quantitative" means there is a constructive bound on the distance between the approximate representations and exact representations. We also demonstrate how this quantitative Gowers-Hatami theorem can be used to calculate the explicit robustness function of a self-test.

Related papers

• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• 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)
• Connes implies Tsirelson: a simple proof [91.3755431537592]
  We show that the Connes embedding problem implies the synchronous Tsirelson conjecture. We also give a different construction of Connes' algebra $mathcalRomega$ appearing in the Connes embedding problem.
  arXiv  Detail & Related papers  (2022-09-16T13:59:42Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Nonparametric Conditional Local Independence Testing [69.31200003384122]
  Conditional local independence is an independence relation among continuous time processes. No nonparametric test of conditional local independence has been available. We propose such a nonparametric test based on double machine learning.
  arXiv  Detail & Related papers  (2022-03-25T10:31:02Z)
• Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states [0.0]
  In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm. For the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding *-algebra associated with the game.
  arXiv  Detail & Related papers  (2022-03-04T19:05:58Z)
• Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria [121.36609493711292]
  We study the application of iterative first-order methods to the problem of computing equilibria of large-scale two-player extensive-form games. By instantiating first-order methods with our regularizers, we develop the first accelerated first-order methods for computing correlated equilibra and ex-ante coordinated team equilibria.
  arXiv  Detail & Related papers  (2021-05-27T06:10:24Z)
• 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)
• Constant-sized robust self-tests for states and measurements of unbounded dimension [0.0]
  We show that correlations $p_n,x$ robustly self-test the underlying states and measurements. We are the first to exhibit a constant-sized self-test for measurements of unbounded dimension.
  arXiv  Detail & Related papers  (2021-03-02T14:02:17Z)

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.