The optimal depth of variational quantum algorithms is QCMA-hard to approximate (Q6640372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The optimal depth of variational quantum algorithms is QCMA-hard to approximate |
scientific article; zbMATH DE number 7946375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimal depth of variational quantum algorithms is QCMA-hard to approximate |
scientific article; zbMATH DE number 7946375 |
Statements
The optimal depth of variational quantum algorithms is QCMA-hard to approximate (English)
0 references
19 November 2024
0 references
variational quantum algorithms (VQA)
0 references
quantum approximate optimization algorithm (QAOA)
0 references
circuit depth minimization
0 references
quantum-classical merlin-Arthur (QCMA)
0 references
hardness of approximation
0 references
hybrid quantum algorithms
0 references
