Minimizing polynomial functions on quantum computers
Abstract
This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algebraic geometry and adiabatic quantum computing (AQC), and concentrates on presenting concrete examples (with Python codes tested on a quantum computer) of applying algebraic geometry constructs: solving binary optimization, factoring, and compiling. Reversing the direction, we also briefly describe a novel use of quantum computers to compute Groebner bases for toric ideals. We also show how Groebner bases play a role in studying AQC at a fundamental level within a Morse theory framework. We close by placing our work in perspective, by situating this leg of the journey, as part of a marvelous intellectual expedition that began with our ancients over 4000 years ago.
Keywords
Cite
@article{arxiv.1903.08270,
title = {Minimizing polynomial functions on quantum computers},
author = {Raouf Dridi and Hedayat Alghassi and Sridhar Tayur},
journal= {arXiv preprint arXiv:1903.08270},
year = {2019}
}
Comments
Commemorating 30 years since the publication of Ray, Chakrabarti & Chakrabarti, Phys. Rev. B 39 (1989) 11828