Consistency and Causality of Interconnected Nonsignaling Resources

• URL: http://arxiv.org/abs/2405.18408v2
• Date: Thu, 13 Jun 2024 17:10:18 GMT
• Title: Consistency and Causality of Interconnected Nonsignaling Resources
• Authors: Peter Bierhorst,
• Abstract summary: This paper examines networks of $n$ measuring parties sharing $m$ independent nonsignaling resources that can be locally wired together. A specific framework is provided for studying probability distributions arising in such networks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper examines networks of $n$ measuring parties sharing $m$ independent nonsignaling resources that can be locally wired together: that is, each party follows a scheme to measure the resources in a cascaded fashion with inputs to later resources possibly depending on outputs of earlier-measured ones. A specific framework is provided for studying probability distributions arising in such networks, and this framework is used to directly prove some accepted, but often only implicitly invoked, facts: there is a uniquely determined and well-defined joint probability distribution for the outputs of all resources shared by the parties, and this joint distribution is nonsignaling. It is furthermore shown that is often sufficient to restrict consideration to only extremal nonsignaling resources when considering features and properties of such networks. Finally, the framework illustrates how the physical theory of nonsignaling boxes and local wirings is causal, supporting the applicability of the inflation technique to constrain such models. For an application, we probe the example of (3,2,2) inequalities that witness genuine three-party nonlocality according to the local-operations-shared-randomness definition, and show how all other examples can be derived from that of Mao et al. [Phys. Rev. Lett. 129:150401 (2022)]

Related papers

• Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers [49.97755400231656]
  We present the first performance guarantee with explicit dimensional general score-mismatched diffusion samplers. We show that score mismatches result in an distributional bias between the target and sampling distributions, proportional to the accumulated mismatch between the target and training distributions. This result can be directly applied to zero-shot conditional samplers for any conditional model, irrespective of measurement noise.
  arXiv  Detail & Related papers  (2024-10-17T16:42:12Z)
• The Rate-Distortion-Perception Trade-off: The Role of Private Randomness [53.81648040452621]
  We show that private randomness is not useful if the compression rate is lower than the entropy of the source. We characterize the corresponding rate-distortion trade-off and show that private randomness is not useful if the compression rate is lower than the entropy of the source.
  arXiv  Detail & Related papers  (2024-04-01T13:36:01Z)
• Numerically assisted determination of local models in network scenarios [55.2480439325792]
  We develop a numerical tool for finding explicit local models that reproduce a given statistical behaviour. We provide conjectures for the critical visibilities of the Greenberger-Horne-Zeilinger (GHZ) and W distributions. The developed codes and documentation are publicly available at281.com/mariofilho/localmodels.
  arXiv  Detail & Related papers  (2023-03-17T13:24:04Z)
• Experimental full network nonlocality with independent sources and strict locality constraints [59.541438315564854]
  Nonlocality in networks gives rise to phenomena radically different from that in standard Bell scenarios. We experimentally observe full network nonlocality in a network where the source-independence, locality, and measurement-independence loopholes are closed. Our experiment violates known inequalities characterizing non-full network nonlocal correlations by over five standard deviations.
  arXiv  Detail & Related papers  (2023-02-05T20:03:58Z)
• Partial self-testing and randomness certification in the triangle network [1.0312968200748118]
  Quantum nonlocality can be demonstrated without inputs in a network with independent sources. We show that the triangle network allows for genuine network quantum nonlocality and certifiable randomness.
  arXiv  Detail & Related papers  (2022-09-20T18:00:06Z)
• Possibilistic approach to network nonlocality [0.0]
  We explore a possibilistic approach, where only patterns of possible outcomes matter, and apply it to Bell nonlocality in networks with independent sources. We present various algorithms for determining whether a given outcome pattern can be achieved via classical resources or via non-signaling resources. We show how to construct certificates for detecting the nonlocality of a certain pattern, in the form of nonlinear Bell-type inequalities involving joint probabilities.
  arXiv  Detail & Related papers  (2022-08-29T12:04:25Z)
• GFlowNet Foundations [66.69854262276391]
  Generative Flow Networks (GFlowNets) have been introduced as a method to sample a diverse set of candidates in an active learning context. We show a number of additional theoretical properties of GFlowNets.
  arXiv  Detail & Related papers  (2021-11-17T17:59:54Z)
• Ruling out Bipartite Nonsignaling Nonlocal Models for Tripartite Correlations [0.0]
  Quantum mechanics predicts three-party correlations that admit no such simulation. We show how to use the framework to derive Bell-inequality-type constraints on these correlations that can be robustly violated by tripartite quantum systems.
  arXiv  Detail & Related papers  (2020-12-21T06:16:49Z)
• Postquantum common-cause channels: the resource theory of local operations and shared entanglement [0.0]
  We define the type-independent resource theory of local operations and shared entanglement (LOSE) This allows us to formally quantify postquantumness in common-cause scenarios such as the Bell scenario. We prove several fundamental results regarding how the type of a resource determines what conversions into other resources are possible.
  arXiv  Detail & Related papers  (2020-04-13T18:03:45Z)
• GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences [70.30467057209405]
  Generative Adversarial Networks (GANs) are modern methods to learn the underlying distribution of a data set. GANs are designed in a model-free fashion where no additional information about the underlying distribution is available. We propose a principled design of a model-based GAN that uses a set of simple discriminators on the neighborhoods of the Bayes-net/MRF.
  arXiv  Detail & Related papers  (2020-03-02T04:31:22Z)

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.