Optimizing quantum optimization algorithms via faster quantum gradient computation

DOI10.1137/1.9781611975482.87zbMath1431.68038arXiv1711.00465OpenAlexW2766294686MaRDI QIDQ5236271

Srinivasan Arunachalam, Nathan Wiebe, Unnamed Author

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Quantum classification algorithm with multi-class parallel training ⋮ The Python's lunch: geometric obstructions to decoding Hawking radiation ⋮ Modular quantum computing and quantum-like devices ⋮ Unnamed Item ⋮ Quantum algorithms for numerical differentiation of expected values with respect to parameters

This page was built for publication: Optimizing quantum optimization algorithms via faster quantum gradient computation