Quantum games and quantum algorithms

Details Quantum games and quantum algorithms Quantum games and quantum algorithms

2000-04-24

arxiv.org/abs/quant-ph/0004092v2

Physics

Quantum Physics

10 pages, plain TeX; to appear in the AMS Contemporary Mathematics volume: Quantum Computation and Quantum Information Science

Scientific paper

A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein-Vazirani quantum search algorithm which I show creates no entanglement at any timestep.

Affiliated with

Also associated with

No associations

Rating

Quantum games and quantum algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum games and quantum algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum games and quantum algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473852