Origin: https://plato.stanford.edu/entries/qt-quantlog/

Quantum Logic and Probability Theory

First published Mon Feb 4, 2002; substantive revision Tue Aug 10, 2021

Mathematically, quantum mechanics can be regarded as a non-classical probability calculus resting upon a non-classical propositional logic. More specifically, in quantum mechanics each probability-bearing proposition of the form “the value of physical quantity A lies in the range B” is represented by a projection operator on a Hilbert space H. These form a non-Boolean—in particular, non-distributive—orthocomplemented lattice. Quantum-mechanical states correspond exactly to probability measures (suitably defined) on this lattice.

What are we to make of this? Some have argued that the empirical success of quantum mechanics calls for a revolution in logic itself. This view is associated with the demand for a realistic interpretation of quantum mechanics, i.e., one not grounded in any primitive notion of measurement. Against this, there is a long tradition of interpreting quantum mechanics operationally, that is, as being precisely a theory of measurement. On this latter view, it is not surprising that a “logic” of measurement-outcomes, in a setting where not all measurements are compatible, should prove not to be Boolean. Rather, the mystery is why it should have the particular non-Boolean structure that it does in quantum mechanics. A substantial literature has grown up around the programme of giving some independent motivation for this structure—ideally, by deriving it from more primitive and plausible axioms governing a generalized probability theory.

  1. Quantum Mechanics as a Probability Calculus

    1.1 Quantum Probability in a Nutshell

    1.2 The “Logic” of Projections

    1.3 Probability Measures and Gleason’s Theorem

    1.4 The Reconstruction of QM
  2. Interpretations of Quantum Logic

    2.1 Realist Quantum Logic

    2.2 Operational Quantum Logic
  3. Generalized Probability Theory

    3.1 Discrete Classical Probability Theory

    3.2 Test Spaces

    3.3 Kolmogorovian Probability Theory

    3.4 Quantum Probability Theory
  4. Logics associated with probabilistic models

    4.1 Operational Logics

    4.2 Orthocoherence

    4.3 Lattices of Properties
  5. Piron’s Theorem

    5.1 Conditioning and the Covering Law
  6. Classical Representations

    6.1 Classical Embeddings

    6.2 Contextual Hidden Variables
  7. Composite Systems

    7.1 The Foulis-Randall Example

    7.2 Aerts’ Theorem

    7.3 Ramifications
  8. Effect Algebras

    8.1 Quantum effects and Naimark’s Theorem

    8.2 Sequential Effect Algebras

    Bibliography

    Academic Tools

    Other Internet Resources

    Related Entries
  9. Quantum Mechanics as a Probability Calculus

    It is uncontroversial (though remarkable) that the formal apparatus of quantum mechanics reduces neatly to a generalization of classical probability in which the role played by a Boolean algebra of events in the latter is taken over by the “quantum logic” of projection operators on a Hilbert space.[1] Moreover, the usual statistical interpretation of quantum mechanics asks us to take this generalized quantum probability theory quite literally—that is, not as merely a formal analogue of its classical counterpart, but as a genuine doctrine of chances. In this section, I survey this quantum probability theory and its supporting quantum logic.[2]

[For further background on Hilbert spaces, see the entry on quantum mechanics. For further background on ordered sets and lattices, see the supplementary document: The Basic Theory of Ordering Relations. Concepts and results explained these supplements will be used freely in what follows.]

1.1 Quantum Probability in a Nutshell

The quantum-probabilistic formalism, as developed by von Neumann [1932], assumes that each physical system is associated with a (separable) Hilbert space H, the unit vectors of which correspond to possible physical states of the system. Each “observable” real-valued random quantity is represented by a self-adjoint operator A on H, the spectrum of which is the set of possible values of A. If u is a unit vector in the domain of A, representing a state, then the expected value of the observable represented by A in this state is given by the inner product

[转载]Quantum Logic and Probability Theory的更多相关文章

  1. 一起啃PRML - 1.2 Probability Theory 概率论

    一起啃PRML - 1.2 Probability Theory @copyright 转载请注明出处 http://www.cnblogs.com/chxer/ A key concept in t ...

  2. Codeforces Round #594 (Div. 1) A. Ivan the Fool and the Probability Theory 动态规划

    A. Ivan the Fool and the Probability Theory Recently Ivan the Fool decided to become smarter and stu ...

  3. 【PRML读书笔记-Chapter1-Introduction】1.2 Probability Theory

    一个例子: 两个盒子: 一个红色:2个苹果,6个橘子; 一个蓝色:3个苹果,1个橘子; 如下图: 现在假设随机选取1个盒子,从中.取一个水果,观察它是属于哪一种水果之后,我们把它从原来的盒子中替换掉. ...

  4. [PR & ML 3] [Introduction] Probability Theory

    虽然学过Machine Learning和Probability今天看着一part的时候还是感觉挺有趣,听惊呆的,尤其是Bayesian Approach.奇怪发中文的笔记就很多人看,英文就没有了,其 ...

  5. Probability theory

    1.Probability mass functions (pmf) and Probability density functions (pdf) pmf 和 pdf 类似,但不同之处在于所适用的分 ...

  6. 概率论基础知识(Probability Theory)

    概率(Probability):事件发生的可能性的数值度量. 组合(Combination):从n项中选取r项的组合数,不考虑排列顺序.组合计数法则:. 排列(Permutation):从n项中选取r ...

  7. P1-概率论基础(Primer on Probability Theory)

    2.1概率密度函数 2.1.1定义 设p(x)为随机变量x在区间[a,b]的概率密度函数,p(x)是一个非负函数,且满足 注意概率与概率密度函数的区别. 概率是在概率密度函数下对应区域的面积,如上图右 ...

  8. Tips on Probability Theory

    1.独立与不相关 随机变量X和Y相互独立,有:E(XY) = E(X)E(Y). 独立一定不相关,不相关不一定独立(高斯过程里二者等价) .对于均值为零的高斯随机变量,“独立”和“不相关”等价的. 独 ...

  9. CF1239A Ivan the Fool and the Probability Theory

    思路: 可以转化为“strip”(http://tech-queries.blogspot.com/2011/07/fit-12-dominos-in-2n-strip.html)问题.参考了http ...

  10. CF C.Ivan the Fool and the Probability Theory【思维·构造】

    题目传送门 题目大意: 一个$n*m$的网格图,每个格子可以染黑色.白色,问每个格子最多有一个相邻格子颜色相同的涂色方案数$n,m<=1e5$ 分析: 首先,考虑到如果有两个相邻的格子颜色相同, ...

随机推荐

  1. 通过 Nuke 为 Dotnet Core 应用构建自动化流程

    为什么使用Nuke 最开始了解Nuke,是浏览github时,刷到了这个项目,看简介可以通过C# 来定义构建任务和流程,这一点很新颖,对我来讲,c# 显然更容易理解和维护. 再看给出的示例,确实比较清 ...

  2. CI框架–头信息,构造器,视图

    今天继续学习CI框架的相关知识,分析下面语句,将匹配到的用户,Location跳转至相应界面,header()函数用来向客户端发送原始HTTP报头. `if ($this->user ['uid ...

  3. LLM主要架构

    LLM本身基于Transformer架构 自2017年,Attention is all you need诞生起,原始的Transformer模型不同领域的模型提供了灵感和启发 基于原始的Transf ...

  4. C++ 容器(STL容器)

    容器(container)用于存放数据的类模板.可变长数组.链表.平衡二叉树等数据结构在STL中都被实现为容器. 在使用容器时,即将容器类模型实例化为容器类,会指明容器中存放的元素是什么类型. 容器可 ...

  5. Qt 的一个大坑:visual studio中setStyleSheet不支持jpg

    在代码中设置QWidget的背景图,一般会使用setStyleSeeht函数去设置样式表: border-image:("c:x.png"); 这里有个大坑:不支持jpg图片!

  6. 在java中使用lua脚本操作redis

    前言 众所周知,redis可以执行lua脚本,至于为什么要用lua脚本来操作redis,自行百度咯 开始 Bean类 package cn.daenx.myadmin.common.config.re ...

  7. k8s pod从私有仓库拉取镜像凭证配置

    方案一: 通过Docker配置文件创建secret # 配置.docker/config.json文件,包含了与 Docker Hub 或其他私有仓库进行身份验证所需的凭据信息. [root@mac- ...

  8. Model Context Protocol C# SDK v0.3.0-preview.1 版本发布

    Model Context Protocol (MCP) 是一种新兴的开放标准,旨在实现大型语言模型(LLM)与外部数据源及工具之间的无缝集成.v0.3.0-preview.1 版本是这一标准的重要更 ...

  9. hot100之子串

    和为K的子数组(560) 先看代码 class Solution { public int subarraySum(int[] nums, int k) { int res = 0; int preS ...

  10. CF1835D Doctor's Brown Hypothesis

    D - Doctor's Brown Hypothesis 首先,一对合法的\((x,y)\)一定是在同一个\(scc\)中的,所以我们将每个\(scc\)分开处理 若我们当前在处理某一个\(scc\ ...