2026-07-25T03:04:02Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17333 2024-03-06T10:59:29Z ddc:004 open_access

Optimizing Quantum Circuit Parameters via SDP Lee, Eunou Quantum algorithm Optimization Rounding algorithm Quantum Circuit Approximation In recent years, parameterized quantum circuits have become a major tool to design quantum algorithms for optimization problems. The challenge in fully taking advantage of a given family of parameterized circuits lies in finding a good set of parameters in a non-convex landscape that can grow exponentially to the number of parameters. We introduce a new framework for optimizing parameterized quantum circuits: round SDP solutions to circuit parameters. Within this framework, we propose an algorithm that produces approximate solutions for a quantum optimization problem called Quantum Max Cut. The rounding algorithm runs in polynomial time to the number of parameters regardless of the underlying interaction graph. The resulting 0.562-approximation algorithm for generic instances of Quantum Max Cut improves on the previously known best algorithms by Anshu, Gosset, and Morenz with a ratio 0.531 and by Parekh and Thompson with a ratio 0.533. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eunou Lee 2022 Is Part Of LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2022.48 urn:nbn:de:0030-drops-173330 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.48 eng https://creativecommons.org/licenses/by/4.0/legalcode