Variational Quantum Algorithm
Variational Quantum Algorithms (VQAs) are hybrid classical-quantum methods aiming to solve optimization problems on near-term quantum computers by iteratively adjusting parameters of a parameterized quantum circuit (ansatz) to minimize a cost function. Current research focuses on improving ansatz design through reinforcement learning, mitigating the "barren plateau" problem hindering optimization, and developing efficient gradient estimation techniques like the generalized Hadamard test and quantum natural gradient descent. VQAs show promise for applications in quantum machine learning, quantum chemistry, and optimization, with ongoing efforts to enhance their efficiency, accuracy, and scalability on noisy quantum hardware.
Papers
January 18, 2024
December 14, 2023
December 13, 2023
December 11, 2023
December 4, 2023
November 6, 2023
October 14, 2023
October 11, 2023
October 3, 2023
September 20, 2023
August 3, 2023
July 31, 2023
July 23, 2023
July 7, 2023
July 3, 2023
June 19, 2023
June 9, 2023
May 17, 2023
March 23, 2023