Abstract In this work, we advance the understanding of fundamental limits computation for binary polynomial optimization (BPO), which is problem maximizing a given function over all points. our main result provide novel class BPO that can be solved efficiently both from theoretical and computational perspective. fact, give strongly polynomial-time algorithm instances whose corresponding hypergr...

This paper proves lower bounds of the quantum query complexity of a multiple-block ordered search problem, which is a natural generalization of the ordered search problems. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our proof employs an argument that (i) commences with the faulty assumption that a quantum algorithm of low query complexity...

We discuss initial value problems for time evolution equations in one dimensional space which are expressed by the lattice operators and propose some new to complexity of solutions is polynomial class. Novel type expressions using shift binary trees applied derivation solution.

This paper proves lower bounds of the quantum query complexity of a multiple-block ordered search problem, which is a natural generalization of the ordered search problems. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our proof employs an argument that (i) commences with the faulty assumption that a quantum algorithm of low query complexity...