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

Published Jan 1, 2011• 0 citations
Publisher

Abstract

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

Related papers

About some probabilistic algebraic model of interaction between particles

Andrei Yu. Khrennikov, V. M. Maximov, Andrei Yu. Khrennikov +3 more

AIP conference proceedings•Jan 1, 2011•0 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

Algebraic approach to interacting quantum systems

Cristian D. Batista, Gerardo Ortíz

We present an algebraic framework for interacting extended quantum systems to study complex phenomena characterized by the coexistence and competition of different states of matter. We start by showing how to connect different (spin-particle-gauge) languages by means of exact mappings (isomorphisms) that we name dictionaries and prove a fundamental theorem establishing when two arbitrary languages can be connected. These mappings serve to unravel symmetries which are hidden in one representation but become manifest in another. In addition, we establish a formal link between seemingly unrelated physical phenomena by changing the language of our model description. This link leads to the idea of universality or equivalence. Moreover, we introduce the novel concept of emergent symmetry as another symmetry guiding principle. By introducing the notion of hierarchical languages, we determine the quantum phase diagram of lattice models (previously unsolved) and unveil hidden order parameters to explore new states of matter. Hierarchical languages also constitute an essential tool to provide a unified description of phases which compete and coexist. Overall, our framework provides a simple and systematic methodology to predict and discover new kinds of orders. Another aspect exploited by the present formalism is the relation between condensed matter and lattice gauge theories through quantum link models. We conclude by discussing applications of these dictionaries to the area of quantum information and computation with emphasis in building new models of computation and quantum programming languages.

arXiv:cond-mat/0207106•Advances In Physics•Jan 1, 2004•134 citations

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Alessandro Chiesa, Michael A. Forbes, Tom Gur +1 more

Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP , as long as one is willing to make a suitable physical assumption : if the provers are spatially isolated, then they can be assumed to be playing independent strategies. Quantum mechanics, however, tells us that this assumption is unrealistic, because spatially-isolated provers could share a quantum entangled state and realize a non-local correlated strategy. The MIP * model captures this setting. In this work, we study the following question: Does spatial isolation still suffice to unconditionally achieve zero knowledge even in the presence of quantum entanglement? We answer this question in the affirmative: we prove that every language in NEXP has a 2-prover zero knowledge interactive proof that is sound against entangled provers; that is, NEXP ⊆ ZK-MIP * . Our proof consists of constructing a zero knowledge interactive probabilistically checkable proof with a strong algebraic structure, and then lifting it to the MIP * model. This lifting relies on a new framework that builds on recent advances in low-degree testing against entangled strategies, and clearly separates classical and quantum tools. Our main technical contribution is the development of new algebraic techniques for obtaining unconditional zero knowledge; this includes a zero knowledge variant of the celebrated sumcheck protocol, a key building block in many probabilistic proof systems. A core component of our sumcheck protocol is a new algebraic commitment scheme, whose analysis relies on algebraic complexity theory.

Journal of the ACM•Jan 31, 2022•5 citations

Algebraic Effects, Linearity, and Quantum Programming Languages

Sam Staton

We develop a new framework of algebraic theories with linear parameters, and use it to analyze the equational reasoning principles of quantum computing and quantum programming languages. We use the framework as follows: we present a new elementary algebraic theory of quantum computation, built from unitary gates and measurement; we provide a completeness theorem or the elementary algebraic theory by relating it with a model from operator algebra; we extract an equational theory for a quantum programming language from the algebraic theory; we compare quantum computation with other local notions of computation by investigating variations on the algebraic theory.

ACM SIGPLAN Notices•Jan 14, 2015•11 citations

The origin of the algebra of quantum operators in the stochastic formulation of quantum mechanics

Mark P. Davidson

arXiv:quant-ph/0112099•Letters in Mathematical Physics•Sep 1, 1979•13 citations
We present an algebraic framework for interacting extended quantum systems to study complex phenomena characterized by the coexistence and competition of different states of matter. We start by showing how to connect different (spin-particle-gauge) languages by means of exact mappings (isomorphisms) that we name dictionaries and prove a fundamental theorem establishing when two arbitrary languages can be connected. These mappings serve to unravel symmetries which are hidden in one representation but become manifest in another. In addition, we establish a formal link between seemingly unrelated physical phenomena by changing the language of our model description. This link leads to the idea of universality or equivalence. Moreover, we introduce the novel concept of emergent symmetry as another symmetry guiding principle. By introducing the notion of hierarchical languages, we determine the quantum phase diagram of lattice models (previously unsolved) and unveil hidden order parameters to explore new states of matter. Hierarchical languages also constitute an essential tool to provide a unified description of phases which compete and coexist. Overall, our framework provides a simple and systematic methodology to predict and discover new kinds of orders. Another aspect exploited by the present formalism is the relation between condensed matter and lattice gauge theories through quantum link models. We conclude by discussing applications of these dictionaries to the area of quantum information and computation with emphasis in building new models of computation and quantum programming languages.
Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP , as long as one is willing to make a suitable physical assumption : if the provers are spatially isolated, then they can be assumed to be playing independent strategies. Quantum mechanics, however, tells us that this assumption is unrealistic, because spatially-isolated provers could share a quantum entangled state and realize a non-local correlated strategy. The MIP * model captures this setting. In this work, we study the following question: Does spatial isolation still suffice to unconditionally achieve zero knowledge even in the presence of quantum entanglement? We answer this question in the affirmative: we prove that every language in NEXP has a 2-prover zero knowledge interactive proof that is sound against entangled provers; that is, NEXP ⊆ ZK-MIP * . Our proof consists of constructing a zero knowledge interactive probabilistically checkable proof with a strong algebraic structure, and then lifting it to the MIP * model. This lifting relies on a new framework that builds on recent advances in low-degree testing against entangled strategies, and clearly separates classical and quantum tools. Our main technical contribution is the development of new algebraic techniques for obtaining unconditional zero knowledge; this includes a zero knowledge variant of the celebrated sumcheck protocol, a key building block in many probabilistic proof systems. A core component of our sumcheck protocol is a new algebraic commitment scheme, whose analysis relies on algebraic complexity theory.
We develop a new framework of algebraic theories with linear parameters, and use it to analyze the equational reasoning principles of quantum computing and quantum programming languages. We use the framework as follows: we present a new elementary algebraic theory of quantum computation, built from unitary gates and measurement; we provide a completeness theorem or the elementary algebraic theory by relating it with a model from operator algebra; we extract an equational theory for a quantum programming language from the algebraic theory; we compare quantum computation with other local notions of computation by investigating variations on the algebraic theory.