Related papers: Subgame perfect implementation: A new result
The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that…
Here we discuss advances in the field of quantum machine learning. The following document offers a hybrid discussion; both reviewing the field as it is currently, and suggesting directions for further research. We include both algorithms…
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in…
Quantum phenomena have remained largely inaccessible to the general public. This can be attributed to the fact that we do not experience quantum mechanics on a tangible level in our daily lives. Games can provide an environment in which…
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…
Quantum state targeting is a quantum game which results from combining traditional quantum state estimation with additional classical information. We consider a particular version of the game and show how it can be played with maximally…
In this paper, we explore two different ways of implementing quantum effects in a classical structure. The first one is through an external field. The other one is modifying the classical conservation laws. In both cases, the consequences…
The laws of quantum mechanics allow to perform measurements whose precision supersedes results predicted by classical parameter estimation theory. That is, the precision bound imposed by the central limit theorem in the estimation of a…
We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…
Recent analysis of classical algorithms resulted in their axiomatization as transition systems satisfying some simple postulates, and in the formulation of the Abstract State Machine Theorem, which assures us that any classical algorithm…
Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently…
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…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for $L$-perfect matchings in bipartite graphs, perfect matchings in general…
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient…
Equations of motion of large N quantum mechanics are solved for infinite N in the case of unbroken global O(N) symmetry. It is shown that the only correction to the action is a change in the potential. All characteristics of the motion…
To elucidate ideal measurements, one must explain how individual events emerge from quantum theory which deals with statistical ensembles, and how different may end up with different final states. This so-called "measurement problem" is…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
This paper discusses the compilation, optimization, and error mitigation of quantum algorithms, essential steps to execute real-world quantum algorithms. Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of…
Quantum computing has garnered significant attention in recent years from both academia and industry due to its potential to achieve a "quantum advantage" over classical computers. The advent of quantum computing introduces new challenges…