اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
157
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Variational Hybrid Quantum Classical Algorithms (VHQCAs) are a class of quantum algorithms intended to run on noisy intermediate-scale quantum (NISQ) devices. These algorithms employ a parameterized quantum circuit (ansatz) and a quantum-classical feedback loop. A classical device is used to optimize the parameters in order to minimize a cost function that can be computed far more efficiently on a quantum device. The cost function is constructed such that finding the ansatz parameters that minimize its value, solves some problem of interest. We focus specifically on the Variational Quantum Linear Solver (VQLS), and examine the effect of several gradient-free and gradient-based classical optimizers on performance. We focus on both the average rate of convergence of the classical optimizers studied, as well as the distribution of their average termination cost values, and how these are affected by noise. Our work demonstrates that realistic noise levels on NISQ devices present a challenge to the optimization process. All classical optimizers appear to be very negatively affected by the presence of realistic noise. If noise levels are significantly improved, there may be a good reason for preferring gradient-based methods in the future, which performed better than the gradient-free methods with the only shot-noise present. The gradient-free optimizers, Simultaneous Perturbation Stochastic Approximation (SPSA) and Powells method, and the gradient-based optimizers, AMSGrad and BFGS performed the best in the noisy simulation, and appear to be less affected by noise than the rest of the methods. SPSA appears to be the best performing method. COBYLA, Nelder-Mead and Conjugate-Gradient methods appear to be the most heavily affected by noise, with even slight noise levels significantly impacting their performance.
قيم البحث
اقرأ أيضاً
Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the required circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum Linear Solver (
VQLS), for solving linear systems on near-term quantum computers. VQLS seeks to variationally prepare $|xrangle$ such that $A|xranglepropto|brangle$. We derive an operationally meaningful termination condition for VQLS that allows one to guarantee that a desired solution precision $epsilon$ is achieved. Specifically, we prove that $C geq epsilon^2 / kappa^2$, where $C$ is the VQLS cost function and $kappa$ is the condition number of $A$. We present efficient quantum circuits to estimate $C$, while providing evidence for the classical hardness of its estimation. Using Rigettis quantum computer, we successfully implement VQLS up to a problem size of $1024times1024$. Finally, we numerically solve non-trivial problems of size up to $2^{50}times2^{50}$. For the specific examples that we consider, we heuristically find that the time complexity of VQLS scales efficiently in $epsilon$, $kappa$, and the system size $N$.
Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach which mitigate the problems of noise in quantum computers. In our study we introduce the dynamic ansatz in the Variational Quantum Line
ar Solver for a system of linear algebraic equations. In this improved algorithm, the number of layers in the hardware efficient ansatz circuit is evolved, starting from a small and gradually increasing until convergence of the solution is reached. We demonstrate the algorithm advantage in comparison to the standard, static ansatz by utilizing fewer quantum resources and with a smaller quantum depth on average, in presence and absence of quantum noise, and in cases when the number of qubits or condition number of the system matrix are increased. The numbers of iterations and layers can be altered by a switching parameter. The performance of the algorithm in using quantum resources is quantified by a newly defined metric.
Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization outer-loop that minimizes some function of a parameterized quantum circui
t. In practice, finite sampling error and gate errors make this a stochastic optimization with unique challenges that must be addressed at the level of the optimizer. The sharp trade-off between precision and sampling time in conjunction with experimental constraints necessitates the development of new optimization strategies to minimize overall wall clock time in this setting. In this work, we introduce two optimization methods and numerically compare their performance with common methods in use today. The methods are surrogate model-based algorithms designed to improve reuse of collected data. They do so by utilizing a least-squares quadratic fit of sampled function values within a moving trusted region to estimate the gradient or a policy gradient. To make fair comparisons between optimization methods, we develop experimentally relevant cost models designed to balance efficiency in testing and accuracy with respect to cloud quantum computing systems. The results here underscore the need to both use relevant cost models and optimize hyperparameters of existing optimization methods for competitive performance. The methods introduced here have several practical advantages in realistic experimental settings, and we have used one of them successfully in a separately published experiment on Googles Sycamore device.
We propose a realistic hybrid classical-quantum linear solver to solve systems of linear equations of a specific type, and demonstrate its feasibility using Qiskit on IBM Q systems. This algorithm makes use of quantum random walk that runs in $mathca
l{O}(Nlog(N))$ time on a quantum circuit made of $mathcal{O}(log(N))$ qubits. The input and output are classical data, and so can be easily accessed. It is robust against noise, and ready for implementation in applications such as machine learning.
In order to support near-term applications of quantum computing, a new compute paradigm has emerged--the quantum-classical cloud--in which quantum computers (QPUs) work in tandem with classical computers (CPUs) via a shared cloud infrastructure. In t
his work, we enumerate the architectural requirements of a quantum-classical cloud platform, and present a framework for benchmarking its runtime performance. In addition, we walk through two platform-level enhancements, parametric compilation and active qubit reset, that specifically optimize a quantum-classical architecture to support variational hybrid algorithms (VHAs), the most promising applications of near-term quantum hardware. Finally, we show that integrating these two features into the Rigetti Quantum Cloud Services (QCS) platform results in considerable improvements to the latencies that govern algorithm runtime.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
