The optimal depth of variational quantum algorithms is QCMA-hard to approximate

DOI10.4230/LIPICS.CCC.2023.34MaRDI QIDQ6640372FDOQ6640372

Authors: Lennart Bittel, Sevag Gharibian, Martin Kliesch 

Publication date: 19 November 2024

zbMATH Keywords

hardness of approximationcircuit depth minimizationhybrid quantum algorithmsquantum approximate optimization algorithm (QAOA)quantum-classical merlin-Arthur (QCMA)variational quantum algorithms (VQA)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: The optimal depth of variational quantum algorithms is QCMA-hard to approximate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640372)