A comparison of various classical optimizers for a variational quantum linear solver

DOI10.1007/S11128-021-03140-XOpenAlexW3170385733MaRDI QIDQ2690481

Ilya Sinayskiy, Anban Pillay, Aidan Pellow-Jarman, Francesco Petruccione

Publication date: 17 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08682

zbMATH Keywords

variational algorithmNISQclassical optimizernear-term quantum deviceVQLS

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

Near term algorithms for linear systems of equations ⋮ The variational quantum eigensolver: a review of methods and best practices

Uses Software

• LBFGS-B
• Adam

Cites Work

• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Limited Memory Algorithm for Bound Constrained Optimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A new approach to variable metric algorithms
• A Simplex Method for Function Minimization
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of various classical optimizers for a variational quantum linear solver