An exponential time upper bound for Quantum Merlin-Arthur games with unentangled provers.
Martin SchwarzPublished in: Electron. Colloquium Comput. Complex. (2015)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- computer games
- branch and bound algorithm
- quantum computation
- lower and upper bounds
- theorem prover
- branch and bound
- game design
- game theory
- nash equilibria
- error probability
- linear complexity
- quantum computing
- theorem proving
- perfect information
- sample complexity
- game playing
- nash equilibrium
- learning games
- coalitional games
- game tree search
- game play
- repeated games
- imperfect information
- online game
- mobile devices
- board game
- monte carlo tree search
- general game playing
- serious games
- channel capacity
- boolean functions
- e learning