A simple lower bound for the complexity of estimating partition functions on a quantum computer.
Zherui ChenGiacomo NanniciniPublished in: CoRR (2024)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- computer systems
- optimal solution
- computational complexity
- average case complexity
- objective function
- np hard
- image segmentation
- information systems
- genetic algorithm
- machine learning
- learning theory
- rigid body
- computer programs
- computer programming
- sufficiently accurate
- neural network