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

AIP conference proceedings

About some probabilistic algebraic model of interaction between particles

Andrei Yu. Khrennikov, V. M. Maximov, Andrei Yu. Khrennikov, Gregg S. Jaeger, M. Schlosshauer, Gregor Weihs

Published Jan 1, 2011• 0 citations
Publisher
DOI
10.1063/1.3578730

Related papers

Algebraic approach to the solution of a one-dimensional model of N interacting particles

A. M. Perelomov

Theoretical and Mathematical Physics•Mar 1, 1971•57 citations

A new algebra in the stochastic approximation for the model of a particle interacting with a quantum field

Luigi Accardi, Igor Vasil'evich Volovich, Sergei Vladimirovich Kozyrev

Theoretical and Mathematical Physics•Sep 1, 1998•1 citation

About some probabilistic algebraic model of interaction between particles

Andrei Yu. Khrennikov, V. M. Maximov

We introduce the notion of a probabilistic algebra. By using the language of the probabilistic algebras we invent new models of interacting particles.

AIP conference proceedings•Jan 1, 2011•0 citations

A Probabilistic Characterization of the Ideals of Resolvent Algebras

Yoshitsugu Sekine

We give a probabilistic characterization of the ideals of resolvent algebras. Through the correspondence of Klein and Landau between KMS systems and stochastic processes, the fields of an isotropic subspace become commuting random variables, and the description of ideals by subspaces of the one-particle space becomes a description by $σ$-algebras: the ideal generated by the resolvents outside a subspace $Y$ corresponds to the $σ$-algebra of the fields on $Y$, inclusions of the ideals reverse those of the $σ$-algebras, and independence is characterized by conditional expectations.

arXiv:2611.16133•Nov 12, 2026•0 citations

A probabilistic-statistical model of quantum mechanics

Виктор Павлович Маслов

Mathematical Notes•Jul 1, 1989•1 citation

Reversible Quantum Process Algebra with Guards

Yong Wang

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ to $π$ calculus, APPTC to probabilistic process algebra. And we also did some work on reversible process algebra and probabilistic truly concurrent process algebra. In this book, we utilize reversible truly concurrent process algebras APRTC and probabilistic process algebra APPTC to model quantum computing and unify quantum and classical computing.

arXiv:1507.03344•Jul 13, 2015•0 citations
We give a probabilistic characterization of the ideals of resolvent algebras. Through the correspondence of Klein and Landau between KMS systems and stochastic processes, the fields of an isotropic subspace become commuting random variables, and the description of ideals by subspaces of the one-particle space becomes a description by σσσ-algebras: the ideal generated by the resolvents outside a subspace YYY corresponds to the σσσ-algebra of the fields on YYY, inclusions of the ideals reverse those of the σσσ-algebras, and independence is characterized by conditional expectations.
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, πtcπ_{tc}πtc​ to πππ calculus, APPTC to probabilistic process algebra. And we also did some work on reversible process algebra and probabilistic truly concurrent process algebra. In this book, we utilize reversible truly concurrent process algebras APRTC and probabilistic process algebra APPTC to model quantum computing and unify quantum and classical computing.