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

Lecture notes in computer science

Mathematical Modeling of Finite Quantum Systems

Vladimir V. Kornyak

Published Jan 1, 2012• 10 citations
Publisher
DOI
10.1007/978-3-642-28212-6_7

Related papers

Mathematical Modeling of Linear Dynamical Quantum Systems

Hendra I. Nurdin, Naoki Yamamoto

Communications and control engineering/Communications and control engineering series•Jan 1, 2017•0 citations

Interaction Systems and Quantum Models

This final chapter investigates game-theoretic systems making use of the algebra of complex numbers. Not only cooperation models are generalized, but also interaction of pairs on elements of a set X finds an appropriate setting. The states are naturally represented as hermitian matrices with complex coefficients. This representation allows one to carry out standard spectral analysis for interaction systems and provides a link to the corresponding mathematical model of quantum systems in physics. While the analysis could be extended to general HILBERT spaces, X is assumed to be finite to keep the discussion straigthforward. It is historically perhaps surprising that JOHN VON NEUMANN, who laid out the mathematical foundations of quantum theory, did not build game theory on the same mathematics in his work with OSKAR MORGENSTERN.

WORLD SCIENTIFIC eBooks•Mar 1, 2022•0 citations

Mathematical Formulation of Quantum Systems

Masahito Hayashi

Graduate texts in physics•Nov 3, 2016•1 citation

Optimal Policies for Quantum Markov Decision Processes

Mingsheng Ying, Yuan Feng, Shenggang Ying

Abstract Markov decision process (MDP) offers a general framework for modelling sequential decision making where outcomes are random. In particular, it serves as a mathematical framework for reinforcement learning. This paper introduces an extension of MDP, namely quantum MDP (qMDP), that can serve as a mathematical model of decision making about quantum systems. We develop dynamic programming algorithms for policy evaluation and finding optimal policies for qMDPs in the case of finite-horizon. The results obtained in this paper provide some useful mathematical tools for reinforcement learning techniques applied to the quantum world.

Machine Intelligence Research•Mar 19, 2021•18 citations

Note on Negative Probabilities and Observable Processes

Ulrich Faigle, Alexander Schönhuth

A mathematical framework for observable processes is introduced via the model of systems whose states may be time dependent and described by possibly "negative probabilities". The model generalizes and includes the linearly dependent models or observable operator models for classical discrete stochastic processes. Within this model a general convergence result for finite-dimensional processes, which generalize finite state (hidden) Markov models, is derived. On the philosophical side, the model furthermore offers an explanation for Bell's inequality in quantum mechanics.

Dagstuhl Seminar Proceedings•Jan 1, 2005•0 citations

Mathematical Formulation of Quantum Systems

Springer eBooks•Sep 1, 2006•2 citations
This final chapter investigates game-theoretic systems making use of the algebra of complex numbers. Not only cooperation models are generalized, but also interaction of pairs on elements of a set X finds an appropriate setting. The states are naturally represented as hermitian matrices with complex coefficients. This representation allows one to carry out standard spectral analysis for interaction systems and provides a link to the corresponding mathematical model of quantum systems in physics. While the analysis could be extended to general HILBERT spaces, X is assumed to be finite to keep the discussion straigthforward. It is historically perhaps surprising that JOHN VON NEUMANN, who laid out the mathematical foundations of quantum theory, did not build game theory on the same mathematics in his work with OSKAR MORGENSTERN.
Abstract Markov decision process (MDP) offers a general framework for modelling sequential decision making where outcomes are random. In particular, it serves as a mathematical framework for reinforcement learning. This paper introduces an extension of MDP, namely quantum MDP (qMDP), that can serve as a mathematical model of decision making about quantum systems. We develop dynamic programming algorithms for policy evaluation and finding optimal policies for qMDPs in the case of finite-horizon. The results obtained in this paper provide some useful mathematical tools for reinforcement learning techniques applied to the quantum world.
A mathematical framework for observable processes is introduced via the model of systems whose states may be time dependent and described by possibly "negative probabilities". The model generalizes and includes the linearly dependent models or observable operator models for classical discrete stochastic processes. Within this model a general convergence result for finite-dimensional processes, which generalize finite state (hidden) Markov models, is derived. On the philosophical side, the model furthermore offers an explanation for Bell's inequality in quantum mechanics.