The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.
Lennart BittelSevag GharibianMartin KlieschPublished in: CCC (2023)
Keyphrases
- approximate solutions
- theoretical analysis
- data structure
- optimization problems
- worst case
- approximately optimal
- exhaustive search
- computationally efficient
- computational complexity
- data mining
- probabilistic model
- computational cost
- active contours
- bayesian networks
- machine learning algorithms
- information retrieval
- data sets