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

Chaos Solitons & Fractals

Dynamical simulations of probabilities

Michail A. Zak

Published May 1, 1997• 16 citations
Publisher
DOI
10.1016/s0960-0779(96)00164-6

Related papers

Probabilistic Physics and Its Applications

Lazar Mayants

Physics Essays•Sep 1, 1991•0 citations

Dynamical Simulation of Probabilities

Michail A. Zak

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices(such as random number generators). Self-orgainizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed. Special attention was focused upon coupled stochastic processes, defined in terms of conditional probabilities, for which joint probability does not exist. Simulations of quantum probabilities are also discussed.

•Jan 1, 1996•5 citations

Probabilistic issues in statistical mechanics

Gérard G. Emch

Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics•Mar 1, 2005•8 citations

Probability Field Dynamics (PFD) – Quantum Computing Validation

Jincheng Zhang

This paper investigates the application of Probability Field Dynamics (PFD) to quantum computing validation through simulation and quantum entanglement analysis. We propose a framework for evaluating quantum algorithms' performance using PFD-based simulations and leveraging quantum entanglement to verify algorithm correctness. Traditional quantum verification relies heavily on classical simulations, limiting the direct assessment of quantum algorithm performance. The core concept of this work is to directly utilize the probabilistic nature of PFD to validate quantum algorithms by simulating their behavior and examining entanglement correlations. This approach offers a novel pathway to robust and accurate quantum algorithm assessment. The paper outlines the framework, methodology, and preliminary results demonstrating the potential of this approach to significantly advance quantum verification techniques.

•Sep 6, 2026•0 citations

Probability Information Theory of Quantum Entanglement Simulation - Based on Quantum Entanglement Dynamics

Jincheng Zhang

This paper explores the application of probability information theory to simulate complex quantum systems, specifically leveraging the dynamic nature of quantum entanglement. We propose a novel framework for quantum system simulation, utilizing a probabilistic distribution driven by quantum entanglement to model evolving quantum states. The core claim is that this model, when implemented, can approximate the fundamental principles underlying quantum consciousness. The mechanism involves introducing a dynamic probability distribution derived from entanglement, allowing for the simulation of complex systems exhibiting phenomena previously inaccessible through traditional probability information theory. This work addresses the limitations of existing methods and opens avenues for quantum computing research, potentially towards simulating quantum systems with enhanced fidelity and adaptability.

•Sep 3, 2026•0 citations

TIME EVOLUTION OF THE PROBABILITY DENSITY

WORLD SCIENTIFIC eBooks•Mar 1, 1987•0 citations
It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices(such as random number generators). Self-orgainizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed. Special attention was focused upon coupled stochastic processes, defined in terms of conditional probabilities, for which joint probability does not exist. Simulations of quantum probabilities are also discussed.
This paper investigates the application of Probability Field Dynamics (PFD) to quantum computing validation through simulation and quantum entanglement analysis. We propose a framework for evaluating quantum algorithms' performance using PFD-based simulations and leveraging quantum entanglement to verify algorithm correctness. Traditional quantum verification relies heavily on classical simulations, limiting the direct assessment of quantum algorithm performance. The core concept of this work is to directly utilize the probabilistic nature of PFD to validate quantum algorithms by simulating their behavior and examining entanglement correlations. This approach offers a novel pathway to robust and accurate quantum algorithm assessment. The paper outlines the framework, methodology, and preliminary results demonstrating the potential of this approach to significantly advance quantum verification techniques.
This paper explores the application of probability information theory to simulate complex quantum systems, specifically leveraging the dynamic nature of quantum entanglement. We propose a novel framework for quantum system simulation, utilizing a probabilistic distribution driven by quantum entanglement to model evolving quantum states. The core claim is that this model, when implemented, can approximate the fundamental principles underlying quantum consciousness. The mechanism involves introducing a dynamic probability distribution derived from entanglement, allowing for the simulation of complex systems exhibiting phenomena previously inaccessible through traditional probability information theory. This work addresses the limitations of existing methods and opens avenues for quantum computing research, potentially towards simulating quantum systems with enhanced fidelity and adaptability.