Entanglement-swapping in generalised probabilistic theories, and iterated CHSH games

• URL: http://arxiv.org/abs/2405.13819v4
• Date: Mon, 2 Sep 2024 16:27:20 GMT
• Title: Entanglement-swapping in generalised probabilistic theories, and iterated CHSH games
• Abstract summary: We study entanglement swapping in generalised probabilistic theories (GPTs) We introduce the iterated CHSH game, which measures the power of a GPT to preserve non-classical correlations. Our main result is the construction of a GPT that achieves a CHSH value of $4$ after an arbitrary number of rounds.
• Score: 0.6963971634605796
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While there exist theories that have states "more strongly entangled" than quantum theory, in the sense that they show CHSH values above Tsirelson's bound, all known examples of such theories have a strictly smaller set of measurements. Therefore, in tasks which require both bipartite states and measurements, they do not perform better than QM. One of the simplest information processing tasks involving both bipartite states and measurements is that of entanglement swapping. In this paper, we study entanglement swapping in generalised probabilistic theories (GPTs). In particular, we introduce the iterated CHSH game, which measures the power of a GPT to preserve non-classical correlations, in terms of the largest CHSH value obtainable after $n$ rounds of entanglement swapping. Our main result is the construction of a GPT that achieves a CHSH value of $4$ after an arbitrary number of rounds. This addresses a question about the optimality of quantum theory for such games recently raised by Weilenmann and Colbeck. One challenge faced when treating this problem is that there seems to be no general framework for constructing GPTs in which entanglement swapping is a well-defined operation. Therefore, we introduce an algorithmic construction that turns a bipartite GPT into a multipartite GPT that supports entanglement swapping, if consistently possible.

Related papers

• On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem [0.05417521241272644]
  We investigate the task of identifying the parity (odd vs even) of an unknown permutation applied to $n$ particles.<n>We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.
  arXiv  Detail & Related papers  (2026-07-31T06:51:06Z)
• Probabilistic theories stable under teleportation [0.17188280334580194]
  A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why maximal violations of Bell inequalities can not be achieved in Nature.<n>One recently proposed approach considers iterated Bell tests, where a Bell test is performed on a state that has undergone several rounds of entanglement swapping.<n>We give a classification of all general probabilistic theories whose CHSH value is stable in the above sense.
  arXiv  Detail & Related papers  (2026-03-22T18:16:01Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• A Unified Analysis for Finite Weight Averaging [50.75116992029417]
  Averaging iterations of Gradient Descent (SGD) have achieved empirical success in training deep learning models, such as Weight Averaging (SWA), Exponential Moving Average (EMA), and LAtest Weight Averaging (LAWA) In this paper, we generalize LAWA as Finite Weight Averaging (FWA) and explain their advantages compared to SGD from the perspective of optimization and generalization.
  arXiv  Detail & Related papers  (2024-11-20T10:08:22Z)
• Generalised Uncertainty Relations from Finite-Accuracy Measurements [1.0323063834827415]
  We show how the Generalised Uncertainty Principle (GUP) and the Extended Uncertainty Principle (EUP) can be derived within the context of canonical quantum theory.
  arXiv  Detail & Related papers  (2023-02-16T06:56:38Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent [50.4531316289086]
  Gradient Descent (SGD) has been the method of choice for learning large-scale non-root models. An overarching paper is providing general conditions SGD converges, assuming that GF on the population loss converges. We provide a unified analysis for GD/SGD not only for classical settings like convex losses, but also for more complex problems including Retrieval Matrix sq-root.
  arXiv  Detail & Related papers  (2022-10-13T03:55:04Z)
• A Post-Quantum Associative Memory [5.2178708158547025]
  Associative memories are devices storing information that can be fully retrieved given partial disclosure of it. We examine a toy model of associative memory and the ultimate limitations it is subjected to within the framework of general probabilistic theories.
  arXiv  Detail & Related papers  (2022-01-28T18:10:19Z)
• Decoherence limit of quantum systems obeying generalized uncertainty principle: new paradigm for Tsallis thermostatistics [0.0]
  We study possible observational effects of generalized uncertainty principle (GUP) systems in their decoherence domain. We invoke the Maximal Entropy principle known from estimation theory to reveal connection between the quasi-classical (decoherence) limit of GUP-related quantum theory and non-extensive thermostatistics of Tsallis.
  arXiv  Detail & Related papers  (2022-01-19T23:37:05Z)
• On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games [65.51757376525798]
  We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
  arXiv  Detail & Related papers  (2021-12-09T21:06:52Z)
• Reachable sets for two-level open quantum systems driven by coherent and incoherent controls [77.34726150561087]
  We study controllability in the set of all density matrices for a two-level open quantum system driven by coherent and incoherent controls. For two coherent controls, the system is shown to be completely controllable in the set of all density matrices.
  arXiv  Detail & Related papers  (2021-09-09T16:14:23Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Concurrence Percolation in Quantum Networks [3.52359746858894]
  We introduce a new statistical theory, concurrence percolation theory (ConPT) We find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results. ConPT also shows a percolation-like universal critical behavior derived by finite-size analysis on the Bethe lattice.
  arXiv  Detail & Related papers  (2021-03-25T17:14:48Z)
• Probabilistic Theories and Reconstructions of Quantum Theory (Les Houches 2019 lecture notes) [0.0]
  These lecture notes provide a basic introduction to the framework of generalized probabilistic theories (GPTs) I present two conceivable phenomena beyond quantum: superstrong nonlocality and higher-order interference. I summarize a reconstruction of quantum theory from the principles of Tomographic Locality, Continuous Reversibility, and the Subspace Axiom.
  arXiv  Detail & Related papers  (2020-11-02T20:03:13Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.