ﻻ يوجد ملخص باللغة العربية
The optimization of circuit parameters of variational quantum algorithms such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA) is a key challenge for the practical deployment of near-term quantum computing algorithms. Here, we develop a hybrid quantum/classical optimization procedure inspired by the Jacobi diagonalization algorithm for classical eigendecomposition, and combined with Anderson acceleration. In the first stage, analytical tomography fittings are performed for a local cluster of circuit parameters via sampling of the observable objective function at quadrature points in the circuit angles. Classical optimization is used to determine the optimal circuit parameters within the cluster, with the other circuit parameters frozen. Different clusters of circuit parameters are then optimized in sweeps, leading to a monotonically-convergent fixed-point procedure. In the second stage, the iterative history of the fixed-point Jacobi procedure is used to accelerate the convergence by applying Anderson acceleration/Pulays direct inversion of the iterative subspace (DIIS). This Jacobi+Anderson method is numerically tested using a quantum circuit simulator (without noise) for a representative test case from the multistate, contracted variant of the variational quantum eigensolver (MC-VQE), and is found to be competitive with and often faster than Powells method and L-BFGS.
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite this, most
We explore whether quantum advantages can be found for the zeroth-order online convex optimization problem, which is also known as bandit convex optimization with multi-point feedback. In this setting, given access to zeroth-order oracles (that is, t
An enhanced framework of quantum approximate optimization algorithm (QAOA) is introduced and the parameter setting strategies are analyzed. The enhanced QAOA is as effective as the QAOA but exhibits greater computing power and flexibility, and with p
We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation resulting from a multidimensional system of stochastic differential equations. We utilize the correspondence betwe
Quantum variational algorithms have garnered significant interest recently, due to their feasibility of being implemented and tested on noisy intermediate scale quantum (NISQ) devices. We examine the robustness of the quantum approximate optimization