Information-theoretic temporal Bell inequality and quantum computation

In this talk, I will formulate an information-theoretic temporal Bell inequality to contrast classical and quantum computations. Any classical algorithm solving the "database" search problem satisfies the inequality, while Grover's algorithm for quantum computation violates it. Therefore, the violation of the inequality implies the quantumness in the computation. Furthermore, this approach suggests another view of quantum computation complementary to the conventional quantum parallelism.