Quantum Computation and Quantum Information Science quant - ph / 0004092 QUANTUM GAMES
نویسنده
چکیده
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.
منابع مشابه
Quantum Computation and Quantum Information Science quant-ph/0004092 QUANTUM GAMES AND QUANTUM ALGORITHMS
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...
متن کاملAdventures in Experimental Quantum Error-Correction: References
References [1] A. Abragam. Principles of Nuclear Magnetism. Clarendon Press, Oxford, England, 1961. [2] I. L. Chuang, N. Gershenfeld, and M. Kubinec. Experimental implementation of fast quantum searching. Physical Review Letters, 80:3408–3411, 1998. [3] I. L. Chuang, N. Gershenfeld, M. Kubinec, and D. Leung. Bulk quantum computation with nuclear magnetic resonance: Theory and experiments. Proce...
متن کاملQuantum Computer II
This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated...
متن کامل0 More on Optical Holonomic Quantum Computer
We in this paper consider a further generalization of the (optical) holonomic quantum computation proposed by Zanardi and Rasetti (quant–ph 9904011), and reinforced by Fujii (quant–ph 9910069) and Pachos and Chountasis (quant–ph 9912093). We construct a quantum computational bundle on some parameter space, and calculate non-abelian Berry connections and curvatures explicitly in the special case...
متن کاملTwo-qubit Projective Measurements are Universal for Quantum Computation
Nielsen showed in quant-ph/0108020 that universal quantum computation can be performed using projective measurements, quantum memory, and preparation of the |0〉 state. Furthermore, 4-qubit measurements are sufficient. Fenner and Zhang showed in quant-ph/0111077 that 3-qubit measurements are sufficient. We prove that 2-qubit measurements are sufficient, closing the gap between the upper and lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000