Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs.
Farid M. AblayevKamil KhadievAliya KhadievaPublished in: CoRR (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound
- optimal solution
- branch and bound algorithm
- np hard
- lower and upper bounds
- objective function
- quantum computing
- sufficiently accurate
- quantum computation
- quantum mechanics
- orders of magnitude
- special case
- hierarchical structure
- partially ordered
- lagrangian relaxation
- linear programming relaxation
- lower bounding
- channel capacity
- information retrieval
- neural network
- data sets