Quantum Sphere-Packing Bounds With Polynomial Prefactors.
Hao-Chung ChengMin-Hsiu HsiehMarco TomamichelPublished in: IEEE Trans. Inf. Theory (2019)
Keyphrases
- lower bound
- upper bound
- upper and lower bounds
- worst case
- polynomially bounded
- low order
- lower and upper bounds
- quantum mechanics
- information retrieval
- average case
- quantum computation
- quantum computing
- tight bounds
- search algorithm
- neural network
- generalization bounds
- error bounds
- support vector machine
- unit sphere
- computational complexity
- quantum inspired
- confidence bounds
- quantum genetic algorithm
- case study
- probability ranking principle