Quantum game application to spectrum scarcity problems

Zabaleta, Omar Gustavo; Barrangu, J. P.; Arizmendi, C. M.

doi:10.1016/j.physa.2016.09.054

Cited by 19 publications

(14 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work environment is split into several zones, and the checkpoint is only used once when MH enters and exits the region. For further information on how these protocols work, see [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”

Section: Recovery Algorithms and Its Parametersmentioning

confidence: 99%

“…The three players apply the inversion operator σ with probability (1-p), (1-q), and (1-r). If ρ in in is the density matrix corresponding to the initial quantum state, then the final state after players have implemented their strategies is [17,18].…”

Section: Quantum Nash Equilibrium For Selectionmentioning

confidence: 99%

“…These are in contrast to cooperative games, which allow agents to interact directly or indirectly via a third party. Entanglement is a quantum resource that may be utilized to optimize known gametheoretic equilibrium outcomes [16][17][18][19]. Figure 1 depicts the classical and quantum versions of a four-player game.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quantum Game Application to Recovery Problem in Mobile Database

2021

View full text Add to dashboard Cite

Mobile Computing (MC) is a relatively new concept in the world of distributed computing that is rapidly gaining traction. Due to the dynamic nature of mobility and the limited bandwidth available on wireless networks, this new computing environment for mobile devices presents significant challenges in terms of fault-tolerant system development. As a consequence, traditional fault-tolerance techniques are inherently inapplicable to these systems. External circumstances often expose mobile systems to failures in communication or data storage. In this article, a quantum game theory-based recovery model is proposed in the case of a mobile host’s failure. Several of the state-of-the-art recovery protocols are selected and analyzed in order to identify the most important variables influencing the recovery mechanism, such as the number of processes, the time needed to send messages, and the number of messages logged-in time. Quantum game theory is then adapted to select the optimal recovery method for the given environment variables using the proposed utility matrix of three players. Game theory is the study of mathematical models of situations in which intelligent rational decision-makers face conflicting interests (alternative recovery procedures). The purpose of this study is to present an adaptive algorithm based on quantum game theory for selecting the most efficient context-aware computing recovery procedure. The transition from a classical to a quantum domain is accomplished in the proposed model by treating strategies as a Hilbert space rather than a discrete set and then allowing for the existence of linear superpositions between classical strategies; this naturally increases the number of possible strategic choices available to each player from a numerable to a continuous set. Numerical data are provided to demonstrate feasibility.

show abstract

Section: Recovery Algorithms and Its Parametersmentioning

confidence: 99%

Section: Quantum Nash Equilibrium For Selectionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum Game Application to Recovery Problem in Mobile Database

2021

View full text Add to dashboard Cite

show abstract

“…Based on a multiple-users multiple-choice quantum minority game, Zabaleta et al propose a model for managing spectrum fairly and effectively, by taking advantage of quantum entanglement and quantum interference. It is possible to lessen the chance of collision problems associated with classic algorithms [25] .…”

Section: A the Main Classical Game Models And Its Quantum Counterpartmentioning

confidence: 99%

A survey of the current status of research on quantum games

Huang

2018

2018 4th International Conference on Information Management (ICIM)

View full text Add to dashboard Cite

obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The WestminsterResearch online digital archive at the University of Westminster aims to make the research output of the University available to a wider audience. Copyright and Moral Rights remain with the authors and/or copyright owners.Whilst further distribution of specific materials from within this archive is forbidden, you may freely distribute the URL of WestminsterResearch: ((http://westminsterresearch.wmin.ac.uk/).In case of abuse or copyright appearing without permission e-mail repository@westminster.ac.uk Huang, Dingxuan & Li, Shuliang Abstract -Quantum games have gained considerable interest from researchers. In this paper, on the basis of the Web of Science database, through the use of the social network analysis methods, the literature on quantum games is analyzed from three aspects: the keywords co-occurrence, coauthorship, and co-citation. In the process of analysis, the main quantum game models are reviewed with graphical illustrations. Our paper provides a survey and outline of the current status of research in this field, and identify directions for future work.. A Survey of the Current Status of Research on Quantum Games. In: Proceedings of the 2018 4th International Conference on Information Management (ICIM2018), 25th to 27th May 2018, Oxford, United Kingdom. IEEE. pp.46-52. ISBN: 978-1-5386-6146-8/18. A Survey of the Current Status of Research on Quantum Games

show abstract

“…Since their introduction, quantum games have been studied in a variety of contexts. With the growing prevalence of quantum computers and quantum networks, quantum games emerge as strong candidates for real world applications in quantum security protocols [10], distributed quantum computing algorithms [11], or improving the efficiency of classical network routing algorithms [12].…”

Section: Introductionmentioning

confidence: 99%

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Solmeyer

Linke

Figgatt

et al. 2018

Quantum Sci. Technol.

View full text Add to dashboard Cite

We demonstrate a Bayesian quantum game on an ion trap quantum computer with five qubits. The players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice. Two five-qubit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies. The data are then parsed into player types randomly in order to combine them classically into a Bayesian framework. We exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the Nash equilibria of the game directly. Then we compare the payoff at the Nash equilibria and location of phase-change-like transitions obtained from the experimental data to the theory, and study how it changes as a function of the amount of entanglement.

show abstract

Quantum game application to spectrum scarcity problems

Cited by 19 publications

References 25 publications

Quantum Game Application to Recovery Problem in Mobile Database

Quantum Game Application to Recovery Problem in Mobile Database

A survey of the current status of research on quantum games

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Contact Info

Product

Resources

About