scholarly journals What Is Rational and Irrational in Human Decision Making

2021 ◽  
Vol 3 (1) ◽  
pp. 242-252
Author(s):  
Emmanuel M. Pothos ◽  
Oliver J. Waddup ◽  
Prince Kouassi ◽  
James M. Yearsley

There has been a growing trend to develop cognitive models based on the mathematics of quantum theory. A common theme in the motivation of such models has been findings which apparently challenge the applicability of classical formalisms, specifically ones based on classical probability theory. Classical probability theory has had a singularly important place in cognitive theory, because of its (in general) descriptive success but, more importantly, because in decision situations with low, equivalent stakes it offers a multiply justified normative standard. Quantum cognitive models have had a degree of descriptive success and proponents of such models have argued that they reveal new intuitions or insights regarding decisions in uncertain situations. However, can quantum cognitive models further benefit from normative justifications analogous to those for classical probability models? If the answer is yes, how can we determine the rational status of a decision, which may be consistent with quantum theory, but inconsistent with classical probability theory? In this paper, we review the proposal from Pothos, Busemeyer, Shiffrin, and Yearsley (2017), that quantum decision models benefit from normative justification based on the Dutch Book Theorem, in exactly the same way as models based on classical probability theory.

2021 ◽  
pp. 31-92
Author(s):  
Jochen Rau

This chapter explains the approach of ‘operationalism’, which in a physical theory admits only concepts associated with concrete experimental procedures, and lays out its consequences for propositions about measurements, their logical structure, and states. It illustrates these with toy examples where the ability to perform measurements is limited by design. For systems composed of several constituents this chapter introduces the notions of composite and reduced states, statistical independence, and correlations. It examines what it means for multiple systems to be prepared identically, and how this is represented mathematically. The operational requirement that there must be procedures to measure and prepare a state is examined, and the ensuing constraints derived. It is argued that these constraint leave only one alternative to classical probability theory that is consistent, universal, and fully operational, namely, quantum theory.


2013 ◽  
Vol 11 (01) ◽  
pp. 1350013 ◽  
Author(s):  
JACEK JURKOWSKI

Due to some ambiguity in the definition of mutual Tsallis entropy in classical probability theory, its generalization to quantum theory is discussed and, as a consequence, two types of generalized quantum discords, called q-discords, are defined in terms of quantum Tsallis entropy. Both q-discords for two-qubit Werner and isotropic states are determined and compared and it is shown that one of them is non-negative, at least for states under investigation, for all q > 0. Finally, an analytical expression for q-discord of certain family of two-qubit X-states is presented. Using this example, we show that both types of q-discords can take negative values for some q > 1, hence their use as correlations measures is rather limited.


Author(s):  
Markus Müller

These lecture notes provide a basic introduction to the framework of generalized probabilistic theories (GPTs) and a sketch of a reconstruction of quantum theory (QT) from simple operational principles. To build some intuition for how physics could be even more general than quantum, I present two conceivable phenomena beyond QT: superstrong nonlocality and higher-order interference. Then I introduce the framework of GPTs, generalizing both quantum and classical probability theory. Finally, I summarize a reconstruction of QT from the principles of Tomographic Locality, Continuous Reversibility, and the Subspace Axiom. In particular, I show why a quantum bit is described by a Bloch ball, why it is three-dimensional, and how one obtains the complex numbers and operators of the usual representation of QT.


2013 ◽  
Vol 36 (3) ◽  
pp. 310-327 ◽  
Author(s):  
Emmanuel M. Pothos ◽  
Jerome R. Busemeyer

AbstractThe attempt to employ quantum principles for modeling cognition has enabled the introduction of several new concepts in psychology, such as the uncertainty principle, incompatibility, entanglement, and superposition. For many commentators, this is an exciting opportunity to question existing formal frameworks (notably classical probability theory) and explore what is to be gained by employing these novel conceptual tools. This is not to say that major empirical challenges are not there. For example, can we definitely prove the necessity for quantum, as opposed to classical, models? Can the distinction between compatibility and incompatibility inform our understanding of differences between human and nonhuman cognition? Are quantum models less constrained than classical ones? Does incompatibility arise as a limitation, to avoid the requirements from the principle of unicity, or is it an inherent (or essential?) characteristic of intelligent thought? For everyday judgments, do quantum principles allow more accurate prediction than classical ones? Some questions can be confidently addressed within existing quantum models. A definitive resolution of others will have to anticipate further work. What is clear is that the consideration of quantum cognitive models has enabled a new focus on a range of debates about fundamental aspects of cognition.


2013 ◽  
Vol 36 (3) ◽  
pp. 304-305
Author(s):  
Tim Rakow

AbstractQuantum probability models may supersede existing probabilistic models because they account for behaviour inconsistent with classical probability theory that are attributable to normal limitations of cognition. This intriguing position, however, may overstate weaknesses in classical probability theory by underestimating the role of current knowledge states and may under-employ available knowledge about the limitations of cognitive processes. In addition, flexibility in model specification has risks for the use of quantum probability.


2016 ◽  
Vol 24 (1) ◽  
pp. 29-41 ◽  
Author(s):  
Roman Frič ◽  
Martin Papčo

Abstract The influence of “Grundbegriffe” by A. N. Kolmogorov (published in 1933) on education in the area of probability and its impact on research in stochastics cannot be overestimated. We would like to point out three aspects of the classical probability theory “calling for” an upgrade: (i) classical random events are black-and-white (Boolean); (ii) classical random variables do not model quantum phenomena; (iii) basic maps (probability measures and observables { dual maps to random variables) have very different “mathematical nature”. Accordingly, we propose an upgraded probability theory based on Łukasiewicz operations (multivalued logic) on events, elementary category theory, and covering the classical probability theory as a special case. The upgrade can be compared to replacing calculations with integers by calculations with rational (and real) numbers. Namely, to avoid the three objections, we embed the classical (Boolean) random events (represented by the f0; 1g-valued indicator functions of sets) into upgraded random events (represented by measurable {0; 1}-valued functions), the minimal domain of probability containing “fractions” of classical random events, and we upgrade the notions of probability measure and random variable.


2019 ◽  
Vol 52 (2) ◽  
pp. 157-186
Author(s):  
Adam Burchardt

Abstract Cumulants are a notion that comes from the classical probability theory; they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication structures. We present an algebraic formula which involves those two multiplications as a sum of products of cumulants. In our approach, beside cumulants, we make use of standard combinatorial tools as forests and their colourings. We also show that the resulting statement can be understood as an analogue of Leonov–Shiryaev’s formula. This purely combinatorial presentation leads to some conclusions about structure constant of Jack characters.


Sign in / Sign up

Export Citation Format

Share Document