Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0604133 · Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics

Decision theory and information propagation in quantum physics

Alan Forrester

Published May 12, 2007• 9 citations
arXivHTMLPDF
DOI
10.1016/j.shpsb.2007.02.004

Related papers

Deriving Schrodinger Equation From A Soft-Decision Iterative Decoding Algorithm

Xiaofei Huang, Xiaowu Huang

The belief propagation algorithm has been recognized in the information theory community as a soft-decision iterative decoding algorithm. It is the most powerful algorithm found so far for attacking hard optimization problems in channel decoding. Quantum mechanics is the foundation of modern physics with the time-independent Schrodinger equation being one of the most important equations. This paper shows that the equation can be derived from a generalized belief propagation algorithm. Such a connection on a mathematical basis might shed new insights into the foundations of quantum mechanics and quantum computing.

arXiv:cs/0612053•Dec 8, 2006•1 citation

Decision Making and Quantum Probability

WORLD SCIENTIFIC (EUROPE) eBooks•Jul 7, 2017•0 citations

Information Theory and Quantum Physics

Herbert S. Green

Springer eBooks•Jan 1, 2000•20 citations

Model of Network Information Propagation Based on Quantum Game

Qinying Wang, Fengming Liu

Quantum game has wide applicability in many aspects of our lives, such as politics, economics, culture and so on. Combining the quantum game with network information propagation, the model of network information propagation based on the quantum game was established in this paper. From an information propagator’s perspective, the liquidity of network information transmission and trust mechanism were taken into account. We construct the model of network information propagation. The information propagator is the decision body and the trust mechanism is the decisive factor. We find the Nash Equilibrium in this game through the simulation experiment to gain maximum returns.

DEStech Transactions on Computer Science and Engineering•Jul 27, 2017•1 citation

Quantum Decision Theory

Adam M. Brandenburger, Pierfrancesco La Mura

We argue that, contrary to conventional wisdom, decision theory is not invariant to the physical environment in which a decision is made. Specifically, we show that a decision maker (DM) with access to quantum information resources may be able to do strictly better than a DM with access only to classical information resources. In this respect, our findings are somewhat akin to those in computer science that have established the superiority of quantum over classical algorithms for certain problems. We treat three kinds of decision tree: (i) Kuhn trees ([24, 1950], [25, 1953]) in which the DM has perfect recall; (ii) Kuhn trees in which the DM has imperfect recall; and (iii) non-Kuhn trees.

•Jul 1, 2011•2 citations

Statistical decision theory for quantum systems

Alexander Semenovich Holevo

Journal of Multivariate Analysis•Dec 1, 1973•687 citations
The belief propagation algorithm has been recognized in the information theory community as a soft-decision iterative decoding algorithm. It is the most powerful algorithm found so far for attacking hard optimization problems in channel decoding. Quantum mechanics is the foundation of modern physics with the time-independent Schrodinger equation being one of the most important equations. This paper shows that the equation can be derived from a generalized belief propagation algorithm. Such a connection on a mathematical basis might shed new insights into the foundations of quantum mechanics and quantum computing.
Quantum game has wide applicability in many aspects of our lives, such as politics, economics, culture and so on. Combining the quantum game with network information propagation, the model of network information propagation based on the quantum game was established in this paper. From an information propagator’s perspective, the liquidity of network information transmission and trust mechanism were taken into account. We construct the model of network information propagation. The information propagator is the decision body and the trust mechanism is the decisive factor. We find the Nash Equilibrium in this game through the simulation experiment to gain maximum returns.
We argue that, contrary to conventional wisdom, decision theory is not invariant to the physical environment in which a decision is made. Specifically, we show that a decision maker (DM) with access to quantum information resources may be able to do strictly better than a DM with access only to classical information resources. In this respect, our findings are somewhat akin to those in computer science that have established the superiority of quantum over classical algorithms for certain problems. We treat three kinds of decision tree: (i) Kuhn trees ([24, 1950], [25, 1953]) in which the DM has perfect recall; (ii) Kuhn trees in which the DM has imperfect recall; and (iii) non-Kuhn trees.