A Theory of Inaccessible Information

• URL: http://arxiv.org/abs/2305.05734v2
• Date: Mon, 2 Sep 2024 21:08:46 GMT
• Title: A Theory of Inaccessible Information
• Authors: Jacopo Surace,
• Abstract summary: We develop a theory in which experimentally accessible statements are a union of a fixed minimum number of inaccessible statements. Surprisingly, the simplest model of theory of inaccessible information is the qubit in quantum mechanics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: What would be the consequences if there were fundamental limits to our ability to experimentally explore the world? In this work we seriously consider this question. We assume the existence of statements whose truth value is not experimentally accessible. That is, there is no way, not even in theory, to directly test if these statements are true or false. We further develop a theory in which experimentally accessible statements are a union of a fixed minimum number of inaccessible statements. For example, the value of truth of the statements "a" and "b" is not accessible, but the value of truth of the statement "a or b" is accessible. We do not directly assume probability theory, we exclusively define experimentally accessible and inaccessible statements and build on these notions using the rules of classical logic. We find that an interesting structure emerges. Developing this theory, we relax the logical structure to a probabilistic one, obtaining a theory rich in structure that we call "theory of inaccessible information". Surprisingly, the simplest model of theory of inaccessible information is the qubit in quantum mechanics. Along the path for the construction of this theory, we characterise and study a family of multiplicative information measures that we call "inaccessibility measures".

Related papers

• Explaining Necessary Truths [0.0]
  We present a framework, based in computational complexity, where explanations for deductive truths co-emerge with discoveries of simplifying steps during the search process. We simulate human subjects, using GPT-4o, presented with SAT puzzles of varying complexity and reasonableness, validating our theory and showing how its predictions can be tested in future human studies.
  arXiv  Detail & Related papers  (2025-02-16T20:11:39Z)
• Minimal operational theories: classical theories with quantum features [41.94295877935867]
  We introduce a class of probabilistic theories, where system dynamics are constrained to the minimal set of operations. Specifically, the allowed instruments are limited to those derived from compositions of preparations, measurements, swap transformations, and conditional tests. We demonstrate that minimal theories with conditioning and a spanning set of non-separable states satisfy two quantum no-go theorems.
  arXiv  Detail & Related papers  (2024-08-02T16:24:09Z)
• Advancing Abductive Reasoning in Knowledge Graphs through Complex Logical Hypothesis Generation [43.26412690886471]
  This paper introduces the task of complex logical hypothesis generation, as an initial step towards abductive logical reasoning with Knowledge Graph. We find that the supervised trained generative model can generate logical hypotheses that are structurally closer to the reference hypothesis. We introduce the Reinforcement Learning from Knowledge Graph (RLF-KG) method, which minimizes differences between observations and conclusions drawn from generated hypotheses according to the KG.
  arXiv  Detail & Related papers  (2023-12-25T08:06:20Z)
• Minimal Equational Theories for Quantum Circuits [44.99833362998488]
  We show that any true equation on quantum circuits can be derived from simple rules. One of our main contributions is to prove the minimality of the equational theory.
  arXiv  Detail & Related papers  (2023-11-13T17:11:25Z)
• Which theories have a measurement problem? [0.0]
  Theory with certain properties makes predictions that are incompatible with measurement outcomes being absolute. Bell Nonlocality, Information Preservation, and Local Dynamics are investigated. Results shed light on whether a future theory of physics might overcome the measurement problem.
  arXiv  Detail & Related papers  (2023-03-06T18:40:00Z)
• A no-go theorem for absolute observed events without inequalities or modal logic [0.0]
  This paper builds on no-go theorems to the effect that quantum theory is inconsistent with observations being absolute. The result illuminates a tension between special relativity and absoluteness.
  arXiv  Detail & Related papers  (2022-09-08T17:27:18Z)
• 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)
• A Theory of PAC Learnability of Partial Concept Classes [30.772106555607458]
  We extend the theory of PAC learning in a way which allows to model a rich variety of learning tasks. We characterize PAC learnability of partial concept classes and reveal an algorithmic landscape which is fundamentally different from the classical one.
  arXiv  Detail & Related papers  (2021-07-18T13:29:26Z)
• On the paper "Quantum theory cannot consistently describe the use of itself" [0.0]
  We prove that either quantum theory cannot be universally applied, even to macroscopic systems. We give a concise description of the paper's result, and expose a detail in the proof.
  arXiv  Detail & Related papers  (2021-06-14T11:33:55Z)
• Non-Boolean Hidden Variables model reproduces Quantum Mechanics' predictions for Bell's experiment [91.3755431537592]
  Theory aimed to violate Bell's inequalities must start by giving up Boolean logic. "Hard" problem is to predict the time values when single particles are detected. "Soft" problem is to explain the violation of Bell's inequalities within (non-Boolean) Local Realism.
  arXiv  Detail & Related papers  (2020-05-20T21:46:35Z)

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.