Reassessing the strength of a class of Wigner's friend no-go theorems

• URL: http://arxiv.org/abs/2204.12015v1
• Date: Tue, 26 Apr 2022 00:56:36 GMT
• Title: Reassessing the strength of a class of Wigner's friend no-go theorems
• Authors: E. Okon
• Abstract summary: Two recent theorems try to impose novel, non-trivial constraints on the possible nature of physical reality. I conduct a thorough analysis of these theorems and show that they suffer from a list of shortcomings that question their validity and limit their strength. I conclude that the "no-go theorem for observer-independent facts" and the "Local Friendliness no-go theorem" fail to impose significant constraints on the nature of physical reality.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Two recent, prominent theorems--the "no-go theorem for observer-independent facts" and the "Local Friendliness no-go theorem"--employ so-called extended Wigner's friend scenarios to try to impose novel, non-trivial constraints on the possible nature of physical reality. While the former is argued to entail that there can be no theory in which the results of Wigner and his friend can both be considered objective, the latter is said to place on reality stronger constraints than the Bell and Kochen-Specker theorems. Here, I conduct a thorough analysis of these theorems and show that they suffer from a list of shortcomings that question their validity and limit their strength. I conclude that the "no-go theorem for observer-independent facts" and the "Local Friendliness no-go theorem" fail to impose significant constraints on the nature of physical reality.

Related papers

• Lean-STaR: Learning to Interleave Thinking and Proving [53.923617816215774]
  We present Lean-STaR, a framework for training language models to produce informal thoughts prior to each step of a proof. Lean-STaR achieves state-of-the-art results on the miniF2F-test benchmark within the Lean theorem proving environment.
  arXiv  Detail & Related papers  (2024-07-14T01:43:07Z)
• Proving Theorems Recursively [80.42431358105482]
  We propose POETRY, which proves theorems in a level-by-level manner. Unlike previous step-by-step methods, POETRY searches for a sketch of the proof at each level. We observe a substantial increase in the maximum proof length found by POETRY, from 10 to 26.
  arXiv  Detail & Related papers  (2024-05-23T10:35:08Z)
• Extended Wigner's friend paradoxes do not require nonlocal correlations [0.0]
  We show that such correlations are not necessary for having extended Wigner's friend paradoxes, by constructing a no-go theorem utilizing a proof of the failure of noncontextuality. The argument hinges on a novel metaphysical assumption that is a natural extension of a key assumption going into the Frauchiger and Renner's no-go theorem.
  arXiv  Detail & Related papers  (2023-10-10T19:55:33Z)
• What Does '(Non)-Absoluteness of Observed Events' Mean? [0.0]
  We argue that the Wigner's friend paradox, the theorem of Bong et al and the theorem of Lawrence et al are all best understood as demonstrating that if quantum mechanics is universal. We also argue that these theorems taken together suggest interesting possibilities for a different kind of relational approach in which dynamical states are relativized whilst observed events are absolute.
  arXiv  Detail & Related papers  (2023-09-06T17:13:31Z)
• The De Broglie-Bohm theory {\it is} and {\it is not} a hidden variable theory [0.0]
  We will define what is meant by hidden variables" We will review various theorems proving the impossibility of theories introducing such variables. We will show that the de Broglie-Bohm theory is not refuted by those theorems.
  arXiv  Detail & Related papers  (2023-07-11T10:06:47Z)
• Connecting classical finite exchangeability to quantum theory [69.62715388742298]
  Exchangeability is a fundamental concept in probability theory and statistics. We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• TheoremQA: A Theorem-driven Question Answering dataset [100.39878559382694]
  GPT-4's capabilities to solve these problems are unparalleled, achieving an accuracy of 51% with Program-of-Thoughts Prompting. TheoremQA is curated by domain experts containing 800 high-quality questions covering 350 theorems.
  arXiv  Detail & Related papers  (2023-05-21T17:51:35Z)
• 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)
• A possibilistic no-go theorem on the Wigner's friend paradox [0.0]
  We present a probability-free version of the Local Friendliness theorem. It builds upon Hardy's no-go theorem for local hidden variables.
  arXiv  Detail & Related papers  (2022-05-24T17:31:54Z)
• A Note on Bell's Theorem Logical Consistency [0.0]
  Counterfactual definiteness is supposed to underlie the Bell theorem. We show that counterfactual definiteness is an unnecessary and inconsistent assumption.
  arXiv  Detail & Related papers  (2020-12-16T22:14:06Z)
• Learning to Prove Theorems by Learning to Generate Theorems [71.46963489866596]
  We learn a neural generator that automatically synthesizes theorems and proofs for the purpose of training a theorem prover. Experiments on real-world tasks demonstrate that synthetic data from our approach improves the theorem prover.
  arXiv  Detail & Related papers  (2020-02-17T16:06:02Z)

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.