We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. T...
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Marques and Almeida [9] recently proposed a nonlinear data seperation technique based on the maximum entropy principle of Bell and Sejnowsky. The idea behind is a pattern repulsion...
Fabian J. Theis, Christoph Bauer, Carlos Garc&iacu...