Nonlocal Games and Self-tests in the Presence of Noise

• URL: http://arxiv.org/abs/2509.20350v1
• Date: Wed, 24 Sep 2025 17:45:03 GMT
• Title: Nonlocal Games and Self-tests in the Presence of Noise
• Authors: Honghao Fu, Minglong Qin, Haochen Xu, Penghui Yao,
• Abstract summary: We study self-testing in the high-noise regime.<n>These are the first known self-tests that are robust in the high-noise regime and remain sound even when the players' measurements are noisy.
• Score: 9.763471774242237
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Self-testing is a key characteristic of certain nonlocal games, which allow one to uniquely determine the underlying quantum state and measurement operators used by the players, based solely on their observed input-output correlations [MY04]. Motivated by the limitations of current quantum devices, we study self-testing in the high-noise regime, where the two players are restricted to sharing many copies of a noisy entangled state with an arbitrary constant noise rate. In this setting, many existing self-tests fail to certify any nontrivial structure. We first characterize the maximal winning probabilities of the CHSH game [CHSH69], the Magic Square game [Mer90a], and the 2-out-of-n CHSH game [CRSV18] as functions of the noise rate, under the assumption that players use traceless observables. These results enable the construction of device-independent protocols for estimating the noise rate. Building on this analysis, we show that these three games--together with an additional test enforcing the tracelessness of binary observables--can self-test one, two, and n pairs of anticommuting Pauli operators, respectively. These are the first known self-tests that are robust in the high-noise regime and remain sound even when the players' measurements are noisy. Our proofs rely on Sum-of-Squares (SoS) decompositions and Pauli analysis techniques developed in the contexts of quantum proof systems and quantum learning theory.

Related papers

• Disambiguating Pauli noise in quantum computers [5.9039349711987645]
  We show that when learnable parameters are self-consistently characterized, the unlearnable (gauge) degrees of freedom do not impact predictions of noisy dynamics or error mitigation.<n>We use the recently introduced framework of gate set Pauli noise learning to efficiently and self-consistently characterize and mitigate noise of a complete gate set.
  arXiv  Detail & Related papers  (2025-05-28T17:46:17Z)
• Noise-Robust Self-Testing: Detecting Non-Locality in Noisy Non-Local Inputs [0.0]
  Non-local games test for non-locality and entanglement in quantum systems.<n>They are used in self-tests for certifying quantum states in untrusted devices.<n>Current literature lacks a standardized measure of noise-robustness.
  arXiv  Detail & Related papers  (2025-05-18T16:55:33Z)
• Noise-Robust Estimation of Quantum Observables in Noisy Hardware [0.0]
  Noise-Robust Estimation is a noise-agnostic framework that systematically reduces estimation bias.<n>NRE exploits a bias-dispersion correlation uncovered in this work.<n>We experimentally validate NRE on an IQM superconducting quantum processor.
  arXiv  Detail & Related papers  (2025-03-09T17:18:16Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• 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.<n>We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Compressed gate characterization for quantum devices with time-correlated noise [0.0]
  We present a general framework for quantum process tomography (QPT) in the presence of time-correlated noise. As an application of our method, we perform a comparative theoretical and experimental analysis of silicon spin qubits. We find good agreement between our theoretically predicted process fidelities and two qubit interleaved randomized benchmarking fidelities of 99.8% measured in recent experiments on silicon spin qubits.
  arXiv  Detail & Related papers  (2023-07-26T18:05:49Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testing [14.684867444153625]
  Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. These quantum algorithms, like their classical counterparts, have been shown to be vulnerable to input perturbations. These can arise either from noisy implementations or, as a worst-case type of noise, adversarial attacks.
  arXiv  Detail & Related papers  (2020-09-21T17:55:28Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.