This paper introduces the new concept of Reversible Game Theory (RGT) and its Multiple-Valued Quantum Computation (MVQC). Game Theory (GT) involves the study of competition and cooperation, without regard to the particular entities (agents) involved, and issues of rationality associated with such phenomena. Reversibility property in GT can be important in situations where: (1) an outside observer needs to know reversely the paths that lead to specific payoffs on a game’s extensive form, and (2) modeling the (maximin) dynamics using low-power consuming circuits as reversibility is a main requirement for low-power circuit design of future technologies such as in Quantum Computing (QC). Quantum Decision Trees (QDTs) are also presented as a quantum representation for applying MVQC to games’ dynamics.
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation — here we are considering classical and quantum computation. We develop an equational theory of reversible computations and an associated theory of irreversible computations which is obtained by marking some inputs as preinitialised heap and some outputs as garbage to be thrown away at the end of the computation. We present three laws which apply to irreversible classical and quantum computations and show that von Neumann's measurement postulate is derivable from them. We discuss the question whether these laws are complete for irreversible quantum computations.