We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
We have developed a visual syntax for representing concepts that are contingent on temporal properties (timedependent semantics). A within-group (N=24) experiment was conducted to...
Nivedita R. Kadaba, Pourang Irani, Michel Toulouse
We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, q...
Abninder Litt, Chris Eliasmith, Frederick W. Kroon...
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...