The Axiom of Choice and the No-Signaling Principle
- URL: http://arxiv.org/abs/2206.08467v2
- Date: Thu, 7 Jul 2022 18:35:04 GMT
- Title: The Axiom of Choice and the No-Signaling Principle
- Authors: \"Amin Baumeler, Borivoje Daki\'c, and Flavio Del Santo
- Abstract summary: We show that the axiom of choice, a basic yet controversial postulate of set theory, leads to revise the standard understanding of one of the pillars of our best physical theories.
We show-by invoking the axiom of choice-the opposite: Functional (deterministic) no-signaling resources can be stronger than probabilistic ones.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show that the axiom of choice, a basic yet controversial postulate of set
theory, leads to revise the standard understanding of one of the pillars of our
best physical theories, namely the no-signaling principle. While it is well
known that probabilistic no-signaling resources (such as quantum non-locality)
are stronger than deterministic ones, we show-by invoking the axiom of
choice-the opposite: Functional (deterministic) no-signaling resources can be
stronger than probabilistic ones. To prove this, we devise a Bell-like game
that shows a systematic advantage of functional no-signaling with respect to
any probabilistic no-signaling resource.
Related papers
- Achieving Maximal Causal Indefiniteness in a Maximally Nonlocal Theory [0.0]
We show that in maximal theories, respecting non-signalling relations, single system state-spaces do not admit superposition; however, composite systems do.
We provide a concrete example of a maximally Bell-nonlocal theory, which allows for post-quantum violations of theory-independent inequalities.
These findings might point towards potential connections between a theory's ability to admit indefinite causal order, Bell-nonlocal correlations and the structure of its state spaces.
arXiv Detail & Related papers (2024-11-06T19:01:47Z) - Axioms for AI Alignment from Human Feedback [44.51306968484829]
We develop novel rules for learning reward functions with strong axiomatic guarantees.
A key innovation from the standpoint of social choice is that our problem has a linear structure.
arXiv Detail & Related papers (2024-05-23T16:29:29Z) - Every quantum helps: Operational advantage of quantum resources beyond convexity [1.3124513975412255]
We identify what quantum-mechanical properties are useful to untap a superior performance in quantum technologies.
We provide two operational interpretations of the usefulness of quantum resources without convexity.
arXiv Detail & Related papers (2023-10-13T14:48:58Z) - Epistemic Boundaries and Quantum Uncertainty: What Local Observers Can (Not) Predict [0.0]
We argue that post-quantum theories can offer a predictive advantage while conforming to the Born rule on average.
We uncover a fascinating possibility: When the assumption of reliable intersubjectivity between different observers is violated, subjective predictive advantage can, in principle, exist.
The findings reconcile us to quantum uncertainty as an aspect of limits on Nature's predictability.
arXiv Detail & Related papers (2023-10-13T14:09:18Z) - A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality.
Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
arXiv Detail & Related papers (2023-05-19T13:15:48Z) - Incompatibility of observables, channels and instruments in information
theories [68.8204255655161]
We study the notion of compatibility for tests of an operational probabilistic theory.
We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
arXiv Detail & Related papers (2022-04-17T08:44:29Z) - The Sigma-Max System Induced from Randomness and Fuzziness [6.2983831147593685]
This paper induce probability theory (sigma system) and possibility theory (max system) respectively from randomness and fuzziness.
It is claimed that the long-standing problem of lack of consensus to the foundation of possibility theory is well resolved.
arXiv Detail & Related papers (2021-10-12T15:55:37Z) - Logical Credal Networks [87.25387518070411]
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability.
We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
arXiv Detail & Related papers (2021-09-25T00:00:47Z) - From no causal loop to absoluteness of cause: discarding the quantum NOT
logic [0.0]
AC principle restrains the time order' of two spacelike separated events/processes to be a potential cause of another event in their common future.
A strong form of violation enables instantaneous signaling, whereas a weak form of violation forbids the theory to be locally tomographic.
On the other hand, impossibility of an intermediate violation suffices to discard the universal quantum NOT logic.
arXiv Detail & Related papers (2021-09-21T04:24:25Z) - Quantum Bell inequalities from Information Causality -- tight for
Macroscopic Locality [0.34771439623170125]
In a Bell test, the set of observed probability distributions complying with the principle of local realism is fully characterized by Bell inequalities.
We present a family of inequalities, which approximate the set of quantum correlations in Bell scenarios where the number of settings or outcomes can be arbitrary.
arXiv Detail & Related papers (2021-03-08T19:36:13Z) - A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
We propose a weaker assumption that we call $2$-adjacency faithfulness.
We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
arXiv Detail & Related papers (2020-10-27T13:04:08Z) - Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic.
Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z) - Logical Neural Networks [51.46602187496816]
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning)
Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation.
Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
arXiv Detail & Related papers (2020-06-23T16:55:45Z)
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.