David A. Meyer  Home/Search
Context Related
| ucsd.edu/~dmeyer/research/pub...qgqa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~dmeyer/r...publications (more) Homepages: D.Meyer |
Rate this article:      (best)Comment on this article |
Abstract: 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. 1999 Physics... (Update)
Cited by: More
One Complexity Theorist's View of Quantum Computing - Lance Fortnow Nec (2000) (Correct)
Active bibliography (related documents): More All
1.0: Quantum Strategies - Meyer (1999) (Correct)
0.7: Sophisticated Quantum Search Without Entanglement - Meyer (2000) (Correct)
0.6: June 2001 quant-ph/0108104 GLOBAL ENTANGLEMENT - In Multiparticle Systems (Correct)
Similar documents based on text: More All
0.1: Quantum Lattice Gases And Their Invariants - David Meyer (1997) (Correct)
0.1: From Gauge Transformations to Topology Computation in Quantum.. - Meyer (2000) (Correct)
0.1: Quantum Computing Classical Physics - Meyer (2001) (Correct)
BibTeX entry: (Update)
D. Meyer. Quantum games and quantum algorithms. In Quantum Computation and Quantum Information Science, Contemporary Mathematics Series. American Mathematical Society, 2001. To appear. http://citeseer.ist.psu.edu/meyer00quantum.html More
@misc{ meyer01quantum,
author = "D. Meyer",
title = "Quantum games and quantum algorithms",
text = "D. Meyer. Quantum games and quantum algorithms. In Quantum Computation
and Quantum Information Science, Contemporary Mathematics Series. American
Mathematical Society, 2001. To appear.",
year = "2001",
url = "citeseer.ist.psu.edu/meyer00quantum.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996 ACM DBLP
168 Algorithms for quantum computation: discrete logarithms and .. - Shor - 1994 DBLP
144 the power of quantum computation - Simon - 1994
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997 ACM DBLP
81 The Principles of Quantum Mechanics (context) - Dirac - 1958
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998 ACM
50 Quantum algorithms revisited - Cleve, Ekert et al. - 1998
21 Grover's quantum searching algorithm is optimal (context) - Zalka - 1999
13 Zur theorie der gesellschaftsspiele (context) - von Neumann - 1928
7 Quantum states with Einstein-Podolsky-Rosen correlations adm.. (context) - Werner - 1989
6 Die gegenwartige Situation in der Quantenmechanik (context) - Schrodinger - 1935
4 Quantum coding (information theory (context) - Schumacher - 1995
4 Quantum search without entanglement (context) - Lloyd - 1999
3 Quantum strategies - Meyer - 1999
2 with a forword by Stephen Hawking (context) - Krauss, of et al. - 1995
2 Sophisticated quantum search without entanglement - Meyer - 2000
2 Invariants for multiple qubits I: the case of 3 qubits (context) - Meyer, Wallach
2 Physicists triumph at guess my number (context) - Steane, van Dam - 2000
1 Why quantum strategies are quantum mechanical (context) - Meyer - 2000
1 Quantum and classical game strategies (context) - See, van Enk - 2000
1 A quantum computer needs only one universe (context) - Steane
1 Quantum games and quantum strategies (context) - Eisert, Wilkens et al. - 1999
1 Comment on `Quantum games and quantum strategies (context) - Benjamin, Hayden
1 third 8 Quantum games & quantum algorithms David (context) - von Neumann, Morgenstern et al. - 1953
Documents on the same site (http://math.ucsd.edu/~dmeyer/research/publications.html): More
Quantum Strategies - Meyer (1999) (Correct)
Complexity of Allocation Processes: Chaos and Path Dependence - Meyer (1998) (Correct)
Scale Decoherence In Inhomogeneous Potentials - Meyer (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC