Quantum optimization using variational algorithms on near-term quantum devices
نویسندگان
چکیده
منابع مشابه
Characterizing Quantum Supremacy in Near-Term Devices
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, 4 John M. Martinis, 6 and Hartmut Neven Google Inc., Venice, CA 90291, USA Google Inc., 8002 Zurich, Switzerland QuAIL, NASA Ames Research Center, Moffett Field, CA 94035, USA SGT Inc., 7701 Greenbelt Rd., Suite 400, Greenbelt, MD 20770 Google Inc., Santa Barbara, CA 93117, USA Department of Physics, Univ...
متن کاملTowards Practical Quantum Variational Algorithms
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimi...
متن کاملOptimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
Zhi-Cheng Yang,1 Armin Rahmani,2, 3 Alireza Shabani,4 Hartmut Neven,4 and Claudio Chamon1 1Physics Department, Boston University, Boston, Massachusetts 02215, USA 2Department of Physics and Astronomy and Quantum Matter Institute, University of British Columbia, Vancouver, British Columbia, Canada V6T 1Z4 3Department of Physics and Astronomy, Western Washington University, 516 High Street, Belli...
متن کاملOptimization and Realization of Quantum Devices
2 Aspice convexo nutantem pondere mundum terrasque tractusque maris caelumque profundum. Behold the world swaying her convex mass, lands and spaces of sea and depth of sky. This manuscript must be intended as an informal review of the research works carried out during three years of PhD. " Informal " in the sense that technical proofs are often omitted (they can be found in the papers) as one c...
متن کاملOptimizing quantum optimization algorithms via faster quantum gradient computation
We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function f : Rd → R by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Jordan’s gradient calculation algorithm [Jor05], providing an approximation of the gradi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Science and Technology
سال: 2018
ISSN: 2058-9565
DOI: 10.1088/2058-9565/aab822