Quantum Sphere-Packing Bounds with Polynomial Prefactors.
Hao-Chung ChengMin-Hsiu HsiehMarco TomamichelPublished in: CoRR (2017)
Keyphrases
- upper bound
- lower bound
- quantum computation
- polynomially bounded
- quantum mechanics
- worst case
- upper and lower bounds
- information retrieval
- quantum inspired
- packing problem
- low order
- quantum computing
- probability ranking principle
- data sets
- quantum genetic algorithm
- integer programming
- multi view
- np hard
- artificial neural networks
- machine learning