Robust Self-testing for Synchronous Correlations and Games
- URL: http://arxiv.org/abs/2503.23500v1
- Date: Sun, 30 Mar 2025 16:19:14 GMT
- Title: Robust Self-testing for Synchronous Correlations and Games
- Authors: Prem Nigam Kar,
- Abstract summary: We show that a synchronous correlation is a robust self-test if and only if there is a unique state on an appropriate $C*$-algebra.<n>We establish that all synchronous correlations and games that serve as commuting operator self-tests for finite-dimensional strategies are also robust self-tests.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We develop an abstract operator-algebraic characterization of robust self-testing for synchronous correlations and games. Specifically, we show that a synchronous correlation is a robust self-test if and only if there is a unique state on an appropriate $C^*$-algebra that "implements" the correlation. Extending this result, we prove that a synchronous game is a robust self-test if and only if its associated $C^*$-algebra admits a unique amenable tracial state. This framework allows us to establish that all synchronous correlations and games that serve as commuting operator self-tests for finite-dimensional strategies are also robust self-tests. As an application, we recover sufficient conditions for linear constraint system games to exhibit robust self-testing. We also demonstrate the existence of a synchronous nonlocal game that is a robust self-test but not a commuting operator self-test, showing that these notions are not equivalent.
Related papers
- 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) - Self-testing in the compiled setting via tilted-CHSH inequalities [0.0]
We formalize self-testing for compiled Bell scenarios.
We prove the maximal quantum value is preserved under compilation for the family of tilted-CHSH inequalities.
arXiv Detail & Related papers (2024-06-07T14:49:40Z) - Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice.
We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
arXiv Detail & Related papers (2023-12-27T09:03:43Z) - Online Learning with Adversaries: A Differential-Inclusion Analysis [52.43460995467893]
We introduce an observation-matrix-based framework for fully asynchronous online Federated Learning with adversaries.
Our main result is that the proposed algorithm almost surely converges to the desired mean $mu.$
We derive this convergence using a novel differential-inclusion-based two-timescale analysis.
arXiv Detail & Related papers (2023-04-04T04:32:29Z) - An operator-algebraic formulation of self-testing [2.115993069505241]
We give a new definition of self-testing for correlations in terms of states on $C*$-algebras.
For extremal binary correlations and for extremal synchronous correlations, we show that any self-test for projective models is a self-test for POVM models.
An advantage of our new definition is that it extends naturally to commuting operator models.
arXiv Detail & Related papers (2023-01-26T18:19:35Z) - 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) - 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) - Fully device-independent quantum key distribution using synchronous
correlations [0.0]
We derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities.
We close a "synchronicity" loophole by showing that an almost synchronous correlation inherits the self-testing property of the associated synchronous correlation.
arXiv Detail & Related papers (2021-10-27T15:43:04Z) - Synchronous Values of Games [0.23301643766310368]
It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy.
We give examples of synchronous games, in particular graph colouring games, with synchronous value that is strictly smaller than their ordinary value.
arXiv Detail & Related papers (2021-09-29T22:10:12Z) - SelfORE: Self-supervised Relational Feature Learning for Open Relation
Extraction [60.08464995629325]
Open-domain relation extraction is the task of extracting open-domain relation facts from natural language sentences.
We proposed a self-supervised framework named SelfORE, which exploits weak, self-supervised signals.
Experimental results on three datasets show the effectiveness and robustness of SelfORE.
arXiv Detail & Related papers (2020-04-06T07:23:17Z) - Conditional Self-Attention for Query-based Summarization [49.616774159367516]
We propose textitconditional self-attention (CSA), a neural network module designed for conditional dependency modeling.
Experiments on Debatepedia and HotpotQA benchmark datasets show CSA consistently outperforms vanilla Transformer.
arXiv Detail & Related papers (2020-02-18T02:22: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.