Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction to Quantum Computation
Problems with the Fna Protocol
References

Representative of the Office of Graduate Studies

Profile image of Bryant YorkBryant York

2009

Abstract

A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary accuracy, via a circuit consisting entirely of variations of the quantum multiplexer, and that certain one player games, the history dependent Parrondo games, can be quantized as games via a particular variation of the quantum multiplexer. However, to date all such quantizations have lacked a certain fundamental game theoretic property. The main result in this dissertation is the development of quantizations of history dependent quantum Parrondo games that satisfy this fundamental game theoretic property. Our approach also yields fresh insight as to what should be considered as the proper quantum analogue of a classical Markov process and gives the first game theoretic measures of multiplexer behavior. QUANTUM MULTIPLEXERS, PARRONDO GAMES, AND PROPER

Related papers

Quantum Games and Programmable Quantum Systems
Edward Piotrowski

2005

Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.

View PDFchevron_right
Fe b 20 02 Quantum Parrondo ’ s Games
Adrian Flitney

2002

Parrondo’s Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state, a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case. pacs: 03.67.-a, 02.50.le keywords: quantum games, Parrondo’s paradox

View PDFchevron_right
0 Ja n 20 02 Quantum Parrondo ’ s Games
Adrian Flitney

2002

Parrondo’s Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case. pacs: 03.67.-a, 02.50.le keywords: quantum games, Parrondo’s paradox

View PDFchevron_right
A Quantum Analogue of Parrondo's Game
Clement Ampadu

arXiv (Cornell University), 2011

We consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed.

View PDFchevron_right
Quantum Games
Jens Eisert

2000

In these lecture notes we investigate the implications of the identification of strategies with quantum operations in game theory beyond the results presented in [J. Eisert, M. Wilkens, and M. Lewenstein, Phys. Rev. Lett. 83, 3077 (1999)]. After introducing a general framework, we study quantum games with a classical analogue in order to flesh out the peculiarities of game theoretical settings in the quantum domain. Special emphasis is given to a detailed investigation of different sets of quantum strategies.

View PDFchevron_right
Static Quantum Games Revisited
Jarosław Pykacz

The so called \emph{quantum game theory} has recently been proclaimed as one of the new branches in the development of both quantum information theory and game theory. However, the notion of a quantum game itself has never been strictly defined, which has led to a lot of conceptual confusion among different authors. In this paper we introduce a new conceptual framework of a \emph{scenario} and an \emph{implementation} of a game. It is shown that the procedures of "quantization" of games proposed in the literature lead in fact to several different games which can be defined within the same scenario, but apart from this they may have nothing in common with the original game. Within the framework we put forward, a lot of conceptual misunderstandings that have arisen around "quantum games" can be stated clearly and resolved uniquely. In particular, the proclaimed essential role of entanglement in several static "quantum games", and their connection with Bel...

View PDFchevron_right
Quantum repeated games
Ayesha Toor

Physics Letters A, 2002

In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the players decide to cooperate in the first stage while knowing that both will defect in the second.

View PDFchevron_right
The role of measurement in quantum games
Ahmad Nawaz

Journal of Physics A: Mathematical and General, 2006

The game of Prisoner Dilemma is analyzed to study the role of measurement basis in quantum games. Four different types of payoffs for quantum games are identified on the basis of different combinations of initial state and measurement basis. A relation among these different payoffs is established.

View PDFchevron_right
Quantum Games and Quantum Strategies
Jens Eisert

1998

We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy which always gives reward if played against any classical strategy.

View PDFchevron_right
An Invitation to Quantum Game Theory
Jan Sładkowski

2003

Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history, basic ideas and recent development in quantum game theory. In this context, a new application of the Ising chain model is proposed.

View PDFchevron_right

References (38)

  1. Figure 4.2: A uniformly (n -1)-controlled R y rotation for 2-valued quantum logic. The • control turns on for control value |0 and the • control turns on for control value |1 . It requires 2 n-1 one qubit controlled gates R θ i y to implement a uniformly (n -1)-controlled R y rotation. REFERENCES
  2. A. Ahmed, S. A. Bleiler, and F. S. Khan. Three player, Two Strategy, Maximally Entangled Quantum Games. Proceeding of the 9 th International Pure Math Con- ference, Islamabad, Pakistan, 2008. 9, 90
  3. S. D. Bartlett, H. de Guise, and B. C. Sanders. Quantum encodings in spin systems and harmonic oscillators. Physical Review A, Volume 65, Issue 5, 2002. 68
  4. K. Binmore. Fun and Games: A Text on Game Theory. D.C. Heath, 1991. 21
  5. A. Bjorck and G. H. Golub. Numerical Methods for Computing Angles between Linear Subspaces. Mathematics of Computation Volume 27, pages 579-594, 1973. 70
  6. S. A. Bleiler. A Formalism for Quantum Games and an Application. Proceeding of the 9 th International Pure Math Conference, Islamabad, Pakistan, 2008. 2, 21
  7. S. Bone and M. Castro. A Brief History of Quantum Computing. Imperial College London, http://www.doc.ic.ac.uk/∼nd/surprise 97/journal/vol4/spb3s. 3
  8. S. Bullock, D. P. O'Leary, and G. K. Brennen. Asymptotically Optimal Quantum Circuits for d-level Systems. Physical Review Letters, Volume 94, 230502, 2005. 69
  9. J. Daboul, X. Wang, and B. Sanders. Quantum Gates on Hybrid Qudits. Journal of Physics A: Mathematical and General, pages 2525-2536, 2003. 68
  10. D. Deutsch and R. Jozsa. Rapid Solutions of Problems by Quantum Computation. Proceedings of the Royal Society of London A, 439, pages 553558, 1992. 2
  11. J. Eisert, M. Wilkens, and M. Lewenstein. Quantum Games and Quantum Strate- gies. Physical Review Letters, Volume 83, pages 3077-3080, 1999. 2
  12. A. P. Flitney, J. Ng, and D. Abbott. Quantum Parrondos Games. Physica A, Volume 314, pages 35-42, 2002. 32, 33, 45, 47, 52
  13. References
  14. G. H. Golub and C. F. Van Loan. Matrix computations. John Hopkins University Press, 1989. 79
  15. L. K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack. Physical Review Letters, Volume 79, pages 325-328, 1997. 2, 14
  16. G. P. Harmer and D. Abbott. A Review of Parrondo's Paradox. Fluctuation and Noise Letters, Volume 2, Number 2, 2002. 33
  17. R. J. Kay and N. F.Johnson. Winning combinations of History-Dependent Games. Physical Review E 67, Issue 5, 2003. 43
  18. F. S. Khan and M. A. Perkowski. Synthesis of Ternary Quantum Logic Circuits by Decomposition. Proceedings of the 7th International Symposium on Representa- tions and Methodology of Future Computing Technologies, pages 114-117, 2005. 69, 71, 75
  19. F. S. Khan and M. A. Perkowski. Synthesis of Multi-qudit Hybrid and d-Valued Quantum Logic Circuits by Decomposition. Theoretical Computer Science, Vol- ume 367, Issue 3, pages 336-346, 2006. 46, 69
  20. S. E. Landsburg. Nash Equilibria in Quantum Games. PUniversiy of Rochester, Working paper No. 524, http://www.rcer.econ.rochester.edu/RCERPAPERS/, 2006. 2, 9, 90
  21. L. Marinatto and T. Weber. A Quantum Approach to Static Games of Complete Information. Physical Letters A, Volume 272, Issues 5-6, pages 291-303, 2000. 2
  22. D. A. Meyer. Quantum Strategies. Physical Review Letters, Volume 82, pages 1052-1055, 1999. 47, 53
  23. D. A. Meyer. Noisy Quantum Parrondo Games. Proceedings of SPIE, Volume 5111, page 344, 2003. 33
  24. M. Mottonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa. Quantum Circuits for General Multiqubit Gates. Physical Review Letters, Volume 93, Number 13, 130502, 2004. 69, 71
  25. A. Muthukrishnan and C. R. Stroud Jr. Multi-valued Logic Gates for Quantum Computation. Physical Review A, Volume 62, 052309, 2000. 68, 77
  26. R. B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, 1991. 21
  27. J. Nash. Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences of the United States of America, Volume 36, Issue 1, pages 48-49, 1950. 21, 26
  28. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. 3
  29. M. Oskin. Quantum Computing-Lecture Notes. Department of Computer Science and Engineering, University of Washington, http://www.cs.washington.edu/homes/oskin. 3, 20
  30. C. C. Paige and M. Wie. History and generality of the CS decomposition. Linear Algebra and its Applications, Volume 208-209, pages 303-326, 1994. 70
  31. J. M. R. Parrondo, G. Harmer, and D. Abbott. New Paradoxical Games Based on Brownian Ratchets. Physical Review Letters, Volume 85, 5226, 2000. 32, 33, 37
  32. Juan M. R. Parrondo, Gregory P. Harmer, and Derek Abbott. New Paradoxical Games Based on Brownian Ratchets. Physical Review Letters, Volume 85, Num- ber 24, 2000. 44, 45
  33. V. Shende, S. Bullock, and I. Markov. Synthesis of Quantum Logic Circuits. IEEE Transactions on Computer Aided Design, Volume 25, Number 6, pages 1000-1010, 2006. 69, 71
  34. P. W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Scientific and Statistical Computing, 1997. 2, 14
  35. G. W. Stewart. Computing the CS Decomposition of a Partitioned Orthogonal Matrix. Numerische Mathematik, Volume 40, pages 297-306, 1982. 70
  36. G. W. Stewart and J. Sun. Matrix perturbation theory. Academic Press Inc, 1990. 70, 112
  37. T. Tilma and E. C. G. Sudarshan. Generalized Euler Angle Parameterization for SU(N). Journal of Physics A: Mathematics and General, Volume 35, pages 10467- 10501, 2002. 69
  38. R. Tucci. Rudimentary Quantum Compiler. http://arxiv.org/abs/quant-ph/9805015, 1998. 71

Related papers

Quantum Multiplexers, Parrondo Games, and Proper Quantization
Faisal Shah Khan

2009

A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary accuracy, via a circuit consisting entirely of variations of the quantum multiplexer, and that certain one player games, the history dependent Parrondo games, can be quantized as games via a particular variation of the quantum multiplexer. However, to date all such quantizations have lacked a certain fundamental game theoretic property. The main result in this dissertation is the development of quantizations of history dependent quantum Parrondo games that satisfy this fundamental game theoretic property. Our approach also yields fresh insight as to what should be considered as the proper quantum analogue of a classical Markov process and gives the first game theoretic measures of multiplexer behavior.

View PDFchevron_right
Properly quantized history dependent Parrondo games, Markov processes, and multiplexing circuits
Faisal Shah Khan

Physics Letters A, 2011

In the context of quantum information theory, “quantization” of various mathematical and computational constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of probability distribution with higher order randomization notions from quantum mechanics such as quantum superposition with measurement. For this to be done “properly”, a faithful copy of the original construction is required to exist within the new quantum one, just as is required when a function is extended to a larger domain. Here procedures for extending history-dependent Parrondo games, Markov processes and multiplexing circuits to their quantum versions are analyzed from a game theoretic viewpoint, and from this viewpoint, proper quantizations developed

View PDFchevron_right
Quantum Parrondo's Games
Derek Abbott

Physica A: Statistical Mechanics and its …, 2002

View PDFchevron_right
Quantum Models of Parrondo's Games
Derek Abbott

Physica A: Statistical Mechanics and its Applications, 2003

View PDFchevron_right
A Formalism for Quantum Games and an Application
Steven Bleiler

This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer [12] published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. What has clouded many of the issues is the lack of a mathematical formalism for the subject in which these various issues can be clearly and precisely expressed, and which provides a context in which to present their resolution. Such a formalism is presented here, along with proposed resolutions to some of the issues discussed in the literature. One in particular, the question of whether there can exist equilibria in a quantized version of a game that do not correspond to classical correlated equilibria of that game and also deliver better payoffs than the classical correlated equilibria is answered in the affirmative for the Prisoner's Dilemma and Simplified Poker.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved