Jump to content

Quantum logic

From Wikipedia, the free encyclopedia

In themathematical study of logicand thephysicalanalysis ofquantum foundations,quantum logicis a set of rules for manip­ulation ofpropositionsinspired by the structure ofquantum theory.The formal system takes as its starting point an obs­ervation ofGarrett BirkhoffandJohn von Neumann,that the structure of experimental tests in classical mechanics forms aBoolean algebra,but the structure of experimental tests in quantum mechanics forms a much more complicated structure.

A number of other logics have also been proposed to analyze quantum-mechanical phenomena, unfortunately also under the name of "quantum logic(s)". They are not the subject of this article. For discussion of the similarities and differences between quantum logic and some of these competitors, see§ Relationship to other logics.

Quantum logic has been proposed as the correct logic for propositional inference generally, most notably by the philosopherHilary Putnam,at least at one point in his career. This thesis was an important ingredient in Putnam's 1968 paper "Is Logic Empirical?"in which he analysed theepistemologicalstatus of the rules of propositional logic. Modern philosophers reject quantum logic as a basis for reasoning, because it lacks amaterial conditional;a common alternative is the system oflinear logic,of which quantum logic is a fragment.

Mathematically, quantum logic is formulated by weakening thedistributive lawfor a Boolean algebra, resulting in anortho­complemented lattice.Quantum-mechanicalobservablesandstatescan be defined in terms of functions on or to the lattice, giving an alternateformalismfor quantum computations.

Introduction[edit]

The most notable difference between quantum logic andclassical logicis the failure of thepropositionaldistributive law:[1]

pand (qorr) = (pandq) or (pandr),

where the symbolsp,qandrare propositional variables.

To illustrate why the distributive law fails, consider a particle moving on a line and (using some system of units where thereduced Planck constantis 1) let[Note 1]

p= "the particle hasmomentumin the interval[0, +16]"
q= "the particle is in the interval[−1, 1]"
r= "the particle is in the interval[1, 3]"

We might observe that:

pand (qorr) =true

in other words, that the state of the particle is a weightedsuperpositionof momenta between 0 and +1/6 and positions between −1 and +3.

On the other hand, the propositions "pandq"and"pandr"each assert tighter restrictions on simultaneous values of position and momentum than are allowed by theuncertainty principle(they each have uncertainty 1/3, which is less than the allowed minimum of 1/2). So there are no states that can support either proposition, and

(pandq) or (pandr) =false

History and modern criticism[edit]

In his classic 1932 treatiseMathematical Foundations of Quantum Mechanics,John von Neumannnoted thatprojectionson aHilbert spacecan be viewed as propositions about physical observables; that is, as potentialyes-or-no questionsan observer might ask about the state of a physical system, questions that could be settled by some measurement.[2]Principles for manipulating these quantum propositions were then calledquantum logicby von Neumann and Birkhoff in a 1936 paper.[3]

George Mackey,in his 1963 book (also calledMathematical Foundations of Quantum Mechanics), attempted to axiomatize quantum logic as the structure of anortho­complemented lattice,and recognized that a physical observable could bedefinedin terms of quantum propositions. Although Mackey's presentation still assumed that the ortho­complemented lattice is thelatticeofclosedlinear subspacesof aseparableHilbert space,[4]Constantin Piron,Günther Ludwig and others later developed axiomatizations that do not assume an underlying Hilbert space.[5]

Inspired byHans Reichenbach's recent defence ofgeneral relativity,the philosopherHilary Putnampopularized Mackey's work in two papers in 1968 and 1975,[6]in which he attributed the idea that anomalies associated to quantum measurements originate with a failure of logic itself to his coauthor, physicistDavid Finkelstein.[7]Putnam hoped to develop a possible alternative tohidden variablesorwavefunction collapsein the problem ofquantum measurement,butGleason's theorempresents severe difficulties for this goal.[6][8]Later, Putnam retracted his views, albeit with much less fanfare,[6]but the damage had been done. While Birkhoff and von Neumann's original work only attempted to organize the calculations associated with theCopenhagen interpretationof quantum mechanics, a school of researchers had now sprung up, either hoping that quantum logic would provide a viable hidden-variable theory, or obviate the need for one.[9]Their work proved fruitless, and now lies in poor repute.[10]

Most philosophers find quantum logic an unappealing competitor toclassical logic.It is far from evident (albeit true[11]) that quantum logic is alogic,in the sense of describing a process of reasoning, as opposed to a particularly convenient language to summarize the measurements performed by quantum apparatuses.[12][13]In particular, modernphilosophers of scienceargue that quantum logic attempts to substitute metaphysical difficulties for unsolved problems in physics, rather than properly solving the physics problems.[14]Tim Maudlinwrites that quantum "logic 'solves' the[measurement] problemby making the problem impossible to state. "[15]

The horse of quantum logic has been so thrashed, whipped and pummeled, and is so thoroughly deceased that...the question is not whether the horse will rise again, it is: how in the world did this horse get here in the first place? The tale of quantum logic is not the tale of a promising idea gone bad, it is rather the tale of the unrelenting pursuit of a bad idea.... Many, many philosophers and physicists have become convinced that a change of logic (and most dramatically, the rejection of classical logic) will somehow help in understanding quantum theory, or is somehow suggested or forced on us by quantum theory. But quantum logic, even through its many incarnations and variations, both in technical form and in interpretation, has never yielded the goods.
— Maudlin,Hilary Putnam,pp. 184–185

Quantum logic remains in limited use among logicians as an extremely pathological counterexample (Dalla Chiara and Giuntini: "Why quantum logics? Simply because 'quantum logics are there!'" ).[16]Although the central insight to quantum logic remainsmathematical folkloreas an intuition pump forcategorification,discussions rarely mention quantum logic.[17]

Quantum logic's best chance at revival is through the recent development ofquantum computing,which has engendered a proliferation of new logics for formal analysis of quantum protocols and algorithms (see also§ Relationship to other logics).[18]The logic may also find application in (computational) linguistics.

Algebraic structure[edit]

Quantum logic can be axiomatized as the theory of propositions modulo the following identities:[19]

  • a= ¬¬a
  • ∨ iscommutativeandassociative.
  • There is a maximal element ⊤, and ⊤ =b∨¬bfor anyb.
  • a∨¬(¬ab) =a.

( "¬" is the traditional notation for "not","∨ "the notation for"or",and" ∧ "the notation for"and".)

Some authors restrict toorthomodular lattices,which additionally satisfy the orthomodular law:[20]

  • If ⊤ = ¬(¬a∨¬b)∨¬(ab) thena=b.

( "⊤" is the traditional notation fortruthand "" ⊥ "the traditional notation forfalsity.)

Alternative formulations include propositions derivable via anatural deduction,[16]sequent calculus[21][22]ortableauxsystem.[23]Despite the relatively developedproof theory,quantum logic is not known to bedecidable.[19]

Quantum logic as the logic of observables[edit]

The remainder of this article assumes the reader is familiar with thespectral theoryofself-adjoint operatorson a Hilbert space. However, the main ideas can be under­stood in thefinite-dimensionalcase.

Logic of classical mechanics[edit]

TheHamiltonianformulations ofclassical mechanicshave three ingredients:states,observablesanddynamics.In the simplest case of a single particle moving inR3,the state space is the position–momentum spaceR6.An observable is somereal-valued functionfon the state space. Examples of observables are position, momentum or energy of a particle. For classical systems, the valuef(x), that is the value offfor some particular system statex,is obtained by a process of measurement off.

Thepropositionsconcerning a classical system are generated from basic statements of the form

"Measurement offyields a value in the interval [a,b] for some real numbersa,b."

through the conventional arithmetic operations andpointwise limits.It follows easily from this characterization of propositions in classical systems that the corresponding logic is identical to theBoolean algebraofBorel subsetsof the state space. They thus obey the laws ofclassicalpropositional logic(such asde Morgan's laws) with the set operations of union and intersection corresponding to theBoolean conjunctivesand subset inclusion corresponding tomaterial implication.

In fact, a stronger claim is true: they must obey theinfinitary logicLω1.

We summarize these remarks as follows: The proposition system of a classical system is a lattice with a distinguishedorthocomplementationoperation: The lattice operations ofmeetandjoinare respectively set intersection and set union. The orthocomplementation operation is set complement. Moreover, this lattice issequentially complete,in the sense that any sequence {Ei}iNof elements of the lattice has aleast upper bound,specifically the set-theoretic union:

Propositional lattice of a quantum mechanical system[edit]

In theHilbert spaceformulation of quantum mechanics as presented by von Neumann, a physical observable is represented by some (possiblyunbounded) densely definedself-adjoint operatorAon a Hilbert spaceH.Ahas aspectral decomposition,which is aprojection-valued measureE defined on the Borel subsets ofR.In particular, for any boundedBorel functionfonR,the following extension offto operators can be made:

In casefis the indicator function of an interval [a,b], the operatorf(A) is a self-adjoint projection onto the subspace ofgeneralized eigenvectorsofAwith eigenvalue in[a,b].That subspace can be interpreted as the quantum analogue of the classical proposition

  • Measurement ofAyields a value in the interval [a,b].

This suggests the following quantum mechanical replacement for the orthocomplemented lattice of propositions in classical mechanics, essentially Mackey'sAxiom VII:

  • The propositions of a quantum mechanical system correspond to the lattice of closed subspaces ofH;the negation of a propositionVis the orthogonal complementV.

The spaceQof quantum propositions is also sequentially complete: any pairwise-disjoint sequence {Vi}iof elements ofQhas a least upper bound. Here disjointness ofW1andW2meansW2is a subspace ofW1.The least upper bound of {Vi}iis the closed internaldirect sum.

Standard semantics[edit]

The standard semantics of quantum logic is that quantum logic is the logic ofprojection operatorsin aseparableHilbertorpre-Hilbert space,where an observablepis associated with theset of quantum statesfor whichp(when measured) haseigenvalue1. From there,

  • ¬pis theorthogonal complementofp(since for those states, the probability of observingp,P(p) = 0),
  • pqis the intersection ofpandq,and
  • pq= ¬(¬p∧¬q) refers to states thatsuperposepandq.

This semantics has the nice property that the pre-Hilbert space is complete (i.e., Hilbert) if and only if the propositions satisfy the orthomodular law, a result known as theSolèr theorem.[24]Although much of the development of quantum logic has been motivated by the standard semantics, it is not the characterized by the latter; there are additional properties satisfied by that lattice that need not hold in quantum logic.[16]

Differences with classical logic[edit]

The structure ofQimmediately points to a difference with the partial order structure of a classical proposition system. In the classical case, given a propositionp,the equations

⊤ =pqand
⊥ =pq

have exactly one solution, namely the set-theoretic complement ofp.In the case of the lattice of projections there are infinitely many solutions to the above equations (any closed, algebraic complement ofpsolves it; it need not be the orthocomplement).

More generally,propositional valuationhas unusual properties in quantum logic. An orthocomplemented lattice admitting atotallattice homomorphismto {⊥,⊤} must be Boolean. A standard workaround is to study maximal partial homomorphismsqwith a filtering property:

ifabandq(a) = ⊤, thenq(b) = ⊤.[10]

Failure of distributivity[edit]

Expressions in quantum logic describe observables using a syntax that resembles classical logic. However, unlike classical logic, the distributive lawa∧ (bc) = (ab) ∨ (ac) fails when dealing withnoncommuting observables,such as position and momentum. This occurs because measurement affects the system, and measurement of whether a disjunction holds does not measure which of the disjuncts is true.

For example, consider a simple one-dimensional particle with position denoted byxand momentum byp,and define observables:

  • a— |p| ≤ 1 (in some units)
  • b— x ≤ 0
  • c— x ≥ 0

Now, position and momentum are Fourier transforms of each other, and theFourier transformof asquare-integrablenonzero function with acompact supportisentireand hence does not have non-isolated zeroes. Therefore, there is no wave function that is bothnormalizablein momentum space and vanishes on preciselyx≥ 0. Thus,aband similarlyacare false, so (ab) ∨ (ac) is false. However,a∧ (bc) equalsa,which is certainly not false (there are states for which it is a viablemeasurement outcome). Moreover: if the relevant Hilbert space for the particle's dynamics only admits momenta no greater than 1, thenais true.

To understand more, letp1andp2be the momentum functions (Fourier transforms) for the projections of the particle wave function tox≤ 0 andx≥ 0 respectively. Let |pi|↾≥1be the restriction ofpito momenta that are (in absolute value) ≥1.

(ab) ∨ (ac) corresponds to states with |p1|↾≥1= |p2|↾≥1= 0 (this holds even if we definedpdifferently so as to make such states possible; also,abcorresponds to |p1|↾≥1=0 andp2=0). Meanwhile,acorresponds to states with |p|↾≥1= 0. As an operator,p=p1+p2,and nonzero |p1|↾≥1and |p2|↾≥1might interfere to produce zero |p|↾≥1.Such interference is key to the richness of quantum logic and quantum mechanics.

Relationship to quantum measurement[edit]

Mackey observables[edit]

Given aorthocomplemented latticeQ,a Mackey observable φ is acountably additive homomorphismfrom the orthocomplemented lattice of Borel subsets ofRtoQ.In symbols, this means that for any sequence {Si}iof pairwise-disjoint Borel subsets ofR,{φ(Si)}iare pairwise-orthogonal propositions (elements ofQ) and

Equivalently, a Mackey observable is aprojection-valued measureonR.

Theorem(Spectral theorem). IfQis the lattice of closed subspaces of HilbertH,then there is a bijective correspondence between Mackey observables and densely-defined self-adjoint operators onH.

Quantum probability measures[edit]

Aquantum probability measureis a function P defined onQwith values in [0,1] such that P( "⊥)=0, P(⊤)=1 and if {Ei}iis a sequence of pairwise-orthogonal elements ofQthen

Every quantum probability measure on the closed subspaces of a Hilbert space is induced by adensity matrix— anonnegative operatoroftrace1. Formally,

Theorem.[25]SupposeQis the lattice of closed subspaces of a separable Hilbert space of complex dimension at least 3. Then for any quantum probability measurePonQthere exists a uniquetrace classoperatorSsuch thatfor any self-adjoint projectionEinQ.

Relationship to other logics[edit]

Quantum logic embeds intolinear logic[26]and themodal logicB.[16]Indeed, modern logics for the analysis of quantum computation often begin with quantum logic, and attempt to graft desirable features of an extension of classical logic thereonto; the results then necessarily embed quantum logic.[27][28]

The orthocomplemented lattice of any set of quantum propositions can be embedded into a Boolean algebra, which is then amenable to classical logic.[29]

Limitations[edit]

Although many treatments of quantum logic assume that the underlying lattice must be orthomodular, such logics cannot handle multiple interacting quantum systems. In an example due to Foulis and Randall, there are orthomodular propositions with finite-dimensional Hilbert models whose pairing admits no orthomodular model.[8]Likewise, quantum logic with the orthomodular law falsifies thededuction theorem.[30]

Quantum logic admits no reasonablematerial conditional;anyconnectivethat ismonotonein a certain technical sense reduces the class of propositions to aBoolean algebra.[31]Consequently, quantum logic struggles to represent the passage of time.[26]One possible workaround is the theory ofquantum filtrationsdeveloped in the late 1970s and 1980s byBelavkin.[32][33]It is known, however, that SystemBV,adeep inferencefragment oflinear logicthat is very close to quantum logic, can handle arbitrarydiscrete spacetimes.[34]

See also[edit]

Notes[edit]

  1. ^Due to technical reasons, it is not possible to represent these propositions asquantum-mechanical operators.They are presented here because they are simple enough to enable intuition, and can be considered as limiting cases of operators thatarefeasible. See§ Quantum logic as the logic of observableset seq.for details.

Citations[edit]

  1. ^Peter Forrest, "Quantum logic" inRoutledge Encyclopedia of Philosophy,vol. 7, 1998. p. 882ff: "[Quantum logic] differs from the standard sentential calculus....The most notable difference is that the distributive laws fail, being replaced by a weaker law known as orthomodularity."
  2. ^von Neumann 1932.
  3. ^Birkhoff & von Neumann 1936.
  4. ^Mackey 1963.
  5. ^Piron: Ludwig:
  6. ^abcMaudlin 2005.
  7. ^Putnam 1969.
  8. ^abWilce.
  9. ^T. A. Brody, "On Quantum Logic",Foundations of Physics,vol. 14, no. 5, 1984. pp. 409-430.
  10. ^abBacciagaluppi 2009.
  11. ^Dalla Chiara & Giuntini 2002,p. 94: "Quantum logics are, without any doubt, logics. As we have seen, they satisfy all the canonical conditions that the present community of logicians require in order to call a given abstract object a logic."
  12. ^Maudlin 2005,p. 159-161.
  13. ^Brody 1984.
  14. ^Brody 1984,pp. 428–429.
  15. ^Maudlin 2005,p. 174.
  16. ^abcdDalla Chiara & Giuntini 2002.
  17. ^Terry Tao,"Venn and Euler type diagrams for vector spaces and abelian groups"onWhat's New(blog), 2021.
  18. ^Dalla Chiara, Giuntini & Leporini 2003.
  19. ^abMegill 2019.
  20. ^Kalmbach 1974andKalmbach 1983
  21. ^N.J. Cutland; P.F. Gibbins (Sep 1982). "A regular sequent calculus for Quantum Logic in which ∨ and ∧ are dual".Logique et Analyse.Nouvelle Série.25(99): 221–248.JSTOR44084050.
  22. ^
  23. ^Uwe Egly; Hans Tompits (1999).Gentzen-like Methods in Quantum Logic(PDF).8th Int. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX).SUNY Albany.CiteSeerX10.1.1.88.9045.
  24. ^Dalla Chiara & Giuntini 2002andde Ronde, Domenech & Freytes.Despite suggestions otherwise in Josef Jauch,Foundations of Quantum Mechanics,Addison-Wesley Series in Advanced Physics; Addison-Wesley, 1968, this property cannot be used to deduce a vector space structure, because it is not peculiar to (pre-)Hilbert spaces. An analogous claim holds in mostcategories;see John Harding, "Decompositions in Quantum Logic,"Transactions of the AMS,vol. 348, no. 5, 1996. pp. 1839-1862.
  25. ^A. Gleason,"Measures on the Closed Subspaces of a Hilbert Space",Indiana University Mathematics Journal,vol. 6, no. 4, 1957. pp. 885-893. DOI:10.1512/iumj.1957.6.56050.Reprinted inThe Logico-Algebraic Approach to Quantum Mechanics,University of Western Ontario Series in Philosophy of Science 5a, ed. C. A. Hooker; D. Riedel, c. 1975-1979. pp. 123-133.
  26. ^abVaughan Pratt, "Linear logic for generalized quantum mechanics,"inWork­shop on Physics and Computation (PhysComp '92)proceedings. See also the dis­cuss­ion atnLab,Revision 42,which cites G.D. Crown, "On some orthomodular posets of vector bundles,"Journ. of Natural Sci. and Math.,vol. 15 issue 1-2: pp. 11–25, 1975.
  27. ^Baltag & Smets 2006.
  28. ^Baltag et al. 2014.
  29. ^Jeffery Bub and William Demopoulos, "The Interpretation of Quantum Mechanics," inLogical and Epistemological Studies in Contemporary Physics,Boston Studies in the Philosophy of Science 13, ed. Robert S. Cohen and Marx W. Wartofsky; D. Riedel, 1974. pp. 92-122. DOI:10.1007/978-94-010-2656-7.ISBN978-94-010-2656-7.
  30. ^Kalmbach 1981.
  31. ^Román, L.; Rumbos, B. (1991)."Quantum logic revisited"(PDF).Foundations of Physics.21(6): 727–734.Bibcode:1991FoPh...21..727R.doi:10.1007/BF00733278.S2CID123383431.
  32. ^
    • V. P. Belavkin (1978). "Optimal quantum filtration of Makovian signals".Problems of Control and Information Theory(in Russian).7(5): 345–360.
    • V. P. Belavkin (1992). "Quantum stochastic calculus and quantum nonlinear filtering".Journal of Multivariate Analysis.42(2): 171–201.arXiv:math/0512362.doi:10.1016/0047-259X(92)90042-E.S2CID3909067.
  33. ^ Luc Bouten; Ramon van Handel; Matthew R. James (2009). "A discrete invitation to quantum filtering and feedback control".SIAM Review.51(2): 239–316.arXiv:math/0606118.Bibcode:2009SIAMR..51..239B.doi:10.1137/060671504.S2CID10435983.
  34. ^Richard Blute, Alessio Guglielmi, Ivan T. Ivanov, Prakash Panangaden, Lutz Straß­burger, "A Logical Basis for Quantum Evolution and Entanglement" inCategories and Types in Logic, Language, and Physics: Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday;Springer, 2014. pp. 90-107. DOI:10.1007/978-3-642-54789-8_6.HAL01092279.

Sources[edit]

Historical works[edit]

Arranged chronologically

Modern philosophical perspectives[edit]

Mathematical study and computational applications[edit]

Quantum foundations[edit]

  • D. Cohen,An Introduction to Hilbert Space and Quantum Logic,Springer-Verlag, 1989. Elementary and well-illustrated; suitable for advanced undergraduates.
  • Günther Ludwig,Der Grundlagen der Quantenmechanik(in German), Springer, 1954. The definitive work. Released in English as:
  • Quantum Logicat thenLab
  • C. Piron,Foundations of Quantum Physics,W. A. Benjamin, 1976.