Efficiency and formalism of quantum games
Journal Article
·
· Physical Review. A
- Centre for Quantum Computation and Physics Department, Clarendon Laboratory, Oxford University, Parks Road, Oxford OX1 3PU (United Kingdom)
We show that quantum games are more efficient than classical games and provide a saturated upper bound for this efficiency. We also demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. Our analysis is based on a rigorous formulation of quantum games, from which quantum versions of the minimax theorem and the Nash equilibrium theorem can be deduced.
- OSTI ID:
- 20633691
- Journal Information:
- Physical Review. A, Vol. 67, Issue 2; Other Information: DOI: 10.1103/PhysRevA.67.022311; (c) 2003 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Quantum computational advantage attested by nonlocal games with the cyclic cluster state
Game-Theoretic Approach for Electricity Pricing Between Distribution System Operator and Load Aggregators
A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks
Journal Article
·
Fri Jul 22 00:00:00 EDT 2022
· Physical Review Research
·
OSTI ID:20633691
+7 more
Game-Theoretic Approach for Electricity Pricing Between Distribution System Operator and Load Aggregators
Conference
·
Sat Jun 01 00:00:00 EDT 2019
·
OSTI ID:20633691
+2 more
A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks
Journal Article
·
Thu Jul 28 00:00:00 EDT 2022
· IEEE Transactions on Wireless Communications
·
OSTI ID:20633691
+2 more