Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle

2016/07/31 by Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani +2
Computer Science · Physics and Astronomy · #Computational complexity theory #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum annealing #Quantum computer #Quantum phase estimation algorithm #Spectroscopy and Quantum Chemical Studies #Variational method #cs.CC #quant-ph

paper · pdf · doi:10.1103/physrevx.7.021027

published as Phys. Rev. X 7, 021027 (2017) · Added new simulations on the effect of weak coupling to the environment. 9 pages, 5 figures

openalex created_date 2016/08/23 · arxiv created 2017/03/11 · openalex publication_date 2017/05/18 · arxiv updated 2017/05/30 · openalex updated_date 2026/08/05

Abstract

Variational quantum algorithms (VQAs) mix quantum machines with classical optimizers to solve complex computational problems. A new analysis reveals the optimal method for implementing a VQA, which could lead to improvements in future quantum computing techniques.

Citations

• Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure
• Quantum Annealing in the Transverse Ising Model
• A variational eigenvalue solver on a photonic quantum processor
• Exploring Interacting Quantum Many-Body Systems by Experimentally Creating Continuous Matrix Product States in Superconducting Circuits
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Computation and Quantum Information