QBism Logic

• URL: http://arxiv.org/abs/2607.17174v1
• Date: Sun, 19 Jul 2026 10:20:53 GMT
• Title: QBism Logic
• Abstract summary: QBism interprets quantum theory as a normative discipline for an agent's probability assignments.<n>This paper develops a logical formalization of that picture.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: QBism interprets quantum theory as a normative discipline for an agent's probability assignments and their revision across possible experience. This paper develops a logical formalization of that picture. A well-formed core datum consists of an admissible prior space, a finite family of actual measurements, Born kernels, and update kernels. For each such datum, we introduce a guarded dynamic language for histories and posterior states and prove a global reduction theorem. We next consider effectively semialgebraic data over an effectively presented real closed field. For data in this class, we translate the fragment without dynamic operators into first-order formulas in the corresponding language of ordered rings, thereby reducing validity to first-order reasoning over real closed fields. Together, the reduction and first-order translation yield a sound and complete recursive calculus and a decision procedure for validity. Finally, assuming a symmetric informationally complete (SIC) reference measurement, we show that quantum theory in finite dimensions realizes the framework through SIC coordinates, POVMs, and quantum instruments. We also prove that the corresponding SIC image satisfies the standard qplex geometry conditions, namely the consistency bounds and the lower polar condition, and that under explicit coefficient field hypotheses the resulting quantum datum is effectively semialgebraic.

Related papers

• Algebraic paradoxes in adaptive quantum computation [0.1399948157377307]
  Measurement-based quantum computation (MBQC) is a universal model of quantum computation whose full power requires adaptivity.<n>We show that if an adaptive $mathbbZ$-textual measurement-based quantum computing protocol deterministically computes a non-affine function, the underlying quantum resource satisfies an inconsistent set of linear equations.
  arXiv  Detail & Related papers  (2026-07-28T18:06:08Z)
• Maximal Classicalization of Finite-Group Quantum Reference-Frame Noise [0.0]
  A finite quantum reference token with group-valued misalignment induces a random-unitary channel.<n>We prove that the following conditions are equivalent for a unitary representation U of a finite group G.
  arXiv  Detail & Related papers  (2026-07-14T17:07:57Z)
• A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
  We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
  arXiv  Detail & Related papers  (2026-01-14T09:10:41Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Structure-Fair Quantum Circuit Complexity: An Auditable Information-Theoretic Lower Bound [0.2606834301724095]
  This paper introduces the Reference-Contingent Complexity (RCC), an information-theoretic measure calibrated by the available quantum operations.<n>Our central result is a key theorem that rigorously proves the RCC serves as a lower bound for the complexity of any universal quantum circuit.<n>This work provides a "ruler" for quantum technology that is structure-fair and enables cross-platform comparison.
  arXiv  Detail & Related papers  (2025-09-20T14:58:34Z)
• The Structure and Interpretation of Quantum Programs I: Foundations [0.0]
  Qubits are a great way to build a quantum computer, but a limited way to program one.<n>We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model.<n>We show how measurement modifies state, proving an operator-algebraic version of the Knill-Laflamme conditions.
  arXiv  Detail & Related papers  (2025-09-03T18:00:23Z)
• A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization [0.0]
  We study a connection between a Hermitian version of the SoS hierarchy, related to the quantum de Finetti theorem. We show that previously known HSoS rounding algorithms can be recast as quantizing an objective function.
  arXiv  Detail & Related papers  (2024-11-06T17:09:28Z)
• Absolute dimensionality of quantum ensembles [41.94295877935867]
  The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis.<n>We propose an absolute, i.e.basis-independent, notion of dimensionality for ensembles of quantum states.
  arXiv  Detail & Related papers  (2024-09-03T09:54:15Z)
• Dilation theorem via Schr\"odingerisation, with applications to the quantum simulation of differential equations [29.171574903651283]
  Nagy's unitary dilation theorem in operator theory asserts the possibility of dilating a contraction into a unitary operator. In this study, we demonstrate the viability of the recently devised Schr"odingerisation approach.
  arXiv  Detail & Related papers  (2023-09-28T08:55:43Z)
• 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)
• Cone-Restricted Information Theory [4.358456799125693]
  We show which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. We present parallel results for the extended conditional min-entropy. In doing so, we extend the notion of k-superpositive channels to superchannels.
  arXiv  Detail & Related papers  (2022-06-09T06:27:48Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)

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.