Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate.

Lennart Bittel Sevag Gharibian Martin Kliesch

Published in: CoRR (2022)

Keyphrases

computationally efficient
theoretical analysis
times faster
genetic algorithm
learning algorithm
significant improvement
computational efficiency
recently developed
computationally hard
information retrieval
computer vision
decision trees
depth map
combinatorial optimization
approximate solutions