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

Theoretical and Mathematical Physics

Quantum logics, games, and equilibriums

Andrey Anatoljevich Grib, G. N. Parfionov

Published Nov 1, 2011• 1 citation
Publisher
DOI
10.1007/s11232-011-0136-5

Related papers

Macroscopic Games and Quantum Logic

Andrei Yu. Khrennikov

Springer eBooks•Jan 1, 2009•0 citations

Quantum Logic and Macroscopic Quantum Games

Andrey Anatoljevich Grib, Guillaume Adenier, Andrei Yu. Khrennikov +3 more

AIP conference proceedings•Jan 1, 2007•1 citation

Macroscpoic Quantum Game

Andrey Anatoljevich Grib, G. N. Parfionov

The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive orthocomplemented lattice. Mixed strategies of the participants are calculated by the use of probability amplitudes according to the rules of quantum mechanics. A scheme of quantization of the payoff function is proposed and an algorithm for the search of Nash equilibrium is given. It is shown that differently from the classical case in the quantum situation a discrete set of equilibrium is possible.

arXiv:quant-ph/0211068•Nov 12, 2002•3 citations

A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution

Asif Akhtab Ronggon, Tasnuva Farheen

Current fault-tolerant quantum compilers allocate error budgets uniformly during resource estimation, causing suboptimal physical resource overhead. We optimize this allocation using a potential game formulation, where Nash Equilibrium yields a Pareto-optimal distribution across logical operations, T-state distillation, and rotation synthesis. An iterated best response (IBR) algorithm converges to this equilibrium through monotonic descent of the shared cost function. Evaluation across 433 MQT benchmarks demonstrates an average reduction of 30.22\% in physical resource requirements relative to uniform baselines, with peak improvements of 97.81\% for specific circuit instances. This establishes a game-theoretic foundation for strategic error budget optimization in fault-tolerant quantum design automation.

quant-pharXiv:2604.15603•Apr 20, 2026•1 citation

A Decision-Optimization Approach to Quantum Mechanics and Game Theory

Xiaofei Huang

The fundamental laws of quantum world upsets the logical foundation of classic physics. They are completely counter-intuitive with many bizarre behaviors. However, this paper shows that they may make sense from the perspective of a general decision-optimization principle for cooperation. This principle also offers a generalization of Nash equilibrium, a key concept in game theory, for better payoffs and stability of game playing.

arXiv:0911.5548•Nov 30, 2009•0 citations

An Invitation to Quantum Game Theory

Edward W. Piotrowski, Jan Sładkowski

arXiv:quant-ph/0211191•International Journal of Theoretical Physics•May 1, 2003•195 citations
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive orthocomplemented lattice. Mixed strategies of the participants are calculated by the use of probability amplitudes according to the rules of quantum mechanics. A scheme of quantization of the payoff function is proposed and an algorithm for the search of Nash equilibrium is given. It is shown that differently from the classical case in the quantum situation a discrete set of equilibrium is possible.
Current fault-tolerant quantum compilers allocate error budgets uniformly during resource estimation, causing suboptimal physical resource overhead. We optimize this allocation using a potential game formulation, where Nash Equilibrium yields a Pareto-optimal distribution across logical operations, T-state distillation, and rotation synthesis. An iterated best response (IBR) algorithm converges to this equilibrium through monotonic descent of the shared cost function. Evaluation across 433 MQT benchmarks demonstrates an average reduction of 30.22\% in physical resource requirements relative to uniform baselines, with peak improvements of 97.81\% for specific circuit instances. This establishes a game-theoretic foundation for strategic error budget optimization in fault-tolerant quantum design automation.