DOE OSTI · 2377985
Variational Quantum Algorithms for Semidefinite Programming
Abstract
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Patel, Dhrumil, Coles, Patrick Joseph, Wilde, Mark M.. 2021-12-13. Variational Quantum Algorithms for Semidefinite Programming. https://doi.org/10.2172/2377985. https://engineeringpapers.com/record/osti%3A2377985/variational-quantum-algorithms-for-semidefinite-programming
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.