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

Springer eBooks

Probability and Quantum Dynamics

E. C. G. Sudarshan

Published Jan 1, 1999• 0 citations
Publisher
DOI
10.1007/978-94-011-4581-7_9

Related papers

Dynamic Topology of Quantum Probability Models

Jincheng Zhang

This paper explores the application of dynamic topology to quantum probability models, aiming to enhance quantum system capabilities through adaptive probability distributions. We present a novel framework that dynamically adjusts probability distributions based on quantum system states and environmental influences. The core mechanism relies on the construction of dynamic topology, allowing for automated optimization of probability distributions tailored to the system's characteristics. The work demonstrates a significant improvement in computational performance and system adaptability compared to traditional approaches. This research contributes to a deeper understanding of the potential for dynamic topology to revolutionize quantum computation.

•Sep 4, 2026•0 citations

Probability and quantum mechanics

Diederik Aerts

•Jan 1, 1984•0 citations

Quantum State-Based Dynamic Probability Model Optimization (QSPMO)

Jincheng Zhang

This paper introduces a novel dynamic probability model optimization algorithm, QSPMO, which leverages quantum state representations to dynamically adjust probability model parameters, leading to improved model prediction accuracy. Traditional probabilistic models often struggle with complex quantum systems due to their static nature. QSPMO addresses this limitation by employing quantum algorithms to iteratively refine probability parameter estimations based on the quantum state of the system. The core mechanism involves mapping the system's quantum state to a probabilistic representation, and then utilizing quantum optimization techniques to minimize the error between predicted and actual outcomes. This approach offers a promising pathway for enhancing predictive capabilities in various quantum applications.

•Aug 31, 2026•0 citations

Probability and Quantum Mechanics

Carl Friedrich von Weizsäcker

The British Journal for the Philosophy of Science•Dec 1, 1973•49 citations

Trajectory of Probabilities, Probability on Trajectories, and the Stochastic-Quantum Correspondence

Győző Egri, Marton Gomori, Balazs Gyenis +1 more

The probabilistic description of the time evolution of a physical system can take two conceptually distinct forms: a trajectory of probabilities, which specifies how probabilities evolve over time, and a probability on trajectories, which assigns probabilities to possible histories. A lack of a clear distinction between these two probabilistic descriptions has given rise to a number of conceptual difficulties, particularly in recent analyses of stochastic-quantum correspondence. This paper provides a systematic account of their relationship. We define probability dynamics and stochastic process families together with a precise notion of implementation that connects the two descriptions. We show that implementations are generically non-unique, that every probability dynamics admits a Markovian implementation, and characterize when non-Markovian implementations are possible. We expose fallacies in common arguments for the linearity of probability dynamics based on the law of total probability and clarify the proper interpretation of ``transition matrices'' by distinguishing dynamics-level maps from the conditional probability matrices of implementing processes. We further introduce decomposability as the appropriate general notion of stepwise evolution for (possibly nonlinear) probability dynamics, relate it to divisibility in the linear case -- showing that the two can come apart -- and disentangle both notions from Markovianity and time-homogeneity. Finally, we connect these results to what we call statistical dynamics, in which linearity is indeed physically motivated, and contrast the framework with quantum mechanics.

quant-pharXiv:2602.23491•Mar 2, 2026•2 citations

Quantum Entanglement-Based Dynamic Probability Model Optimization (QEDMO)

Jincheng Zhang

This paper presents a novel algorithm, Quantum Entanglement-Based Dynamic Probability Model Optimization (QEDMO), designed to enhance the accuracy of probabilistic models through the utilization of quantum entanglement. Traditional methods often struggle to fully capture the intricate relationships within probabilistic systems, limiting their predictive power. QEDMO dynamically adjusts probability model parameters based on entanglement, creating a system that adapts to the data and improves overall model performance. We explore the core mechanism and preliminary results demonstrating the effectiveness of this approach in optimizing probabilistic models.

•Aug 31, 2026•0 citations
This paper explores the application of dynamic topology to quantum probability models, aiming to enhance quantum system capabilities through adaptive probability distributions. We present a novel framework that dynamically adjusts probability distributions based on quantum system states and environmental influences. The core mechanism relies on the construction of dynamic topology, allowing for automated optimization of probability distributions tailored to the system's characteristics. The work demonstrates a significant improvement in computational performance and system adaptability compared to traditional approaches. This research contributes to a deeper understanding of the potential for dynamic topology to revolutionize quantum computation.
This paper introduces a novel dynamic probability model optimization algorithm, QSPMO, which leverages quantum state representations to dynamically adjust probability model parameters, leading to improved model prediction accuracy. Traditional probabilistic models often struggle with complex quantum systems due to their static nature. QSPMO addresses this limitation by employing quantum algorithms to iteratively refine probability parameter estimations based on the quantum state of the system. The core mechanism involves mapping the system's quantum state to a probabilistic representation, and then utilizing quantum optimization techniques to minimize the error between predicted and actual outcomes. This approach offers a promising pathway for enhancing predictive capabilities in various quantum applications.
The probabilistic description of the time evolution of a physical system can take two conceptually distinct forms: a trajectory of probabilities, which specifies how probabilities evolve over time, and a probability on trajectories, which assigns probabilities to possible histories. A lack of a clear distinction between these two probabilistic descriptions has given rise to a number of conceptual difficulties, particularly in recent analyses of stochastic-quantum correspondence. This paper provides a systematic account of their relationship. We define probability dynamics and stochastic process families together with a precise notion of implementation that connects the two descriptions. We show that implementations are generically non-unique, that every probability dynamics admits a Markovian implementation, and characterize when non-Markovian implementations are possible. We expose fallacies in common arguments for the linearity of probability dynamics based on the law of total probability and clarify the proper interpretation of ``transition matrices'' by distinguishing dynamics-level maps from the conditional probability matrices of implementing processes. We further introduce decomposability as the appropriate general notion of stepwise evolution for (possibly nonlinear) probability dynamics, relate it to divisibility in the linear case -- showing that the two can come apart -- and disentangle both notions from Markovianity and time-homogeneity. Finally, we connect these results to what we call statistical dynamics, in which linearity is indeed physically motivated, and contrast the framework with quantum mechanics.
This paper presents a novel algorithm, Quantum Entanglement-Based Dynamic Probability Model Optimization (QEDMO), designed to enhance the accuracy of probabilistic models through the utilization of quantum entanglement. Traditional methods often struggle to fully capture the intricate relationships within probabilistic systems, limiting their predictive power. QEDMO dynamically adjusts probability model parameters based on entanglement, creating a system that adapts to the data and improves overall model performance. We explore the core mechanism and preliminary results demonstrating the effectiveness of this approach in optimizing probabilistic models.