Sciweavers

1596 search results - page 3 / 320
» Quantum property testing
Sort
View
AIEDAM
2008
102views more  AIEDAM 2008»
13 years 5 months ago
Machine invention of quantum computing circuits by means of genetic programming
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 ...
Lee Spector, Jon Klein
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
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...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
IV
2005
IEEE
86views Visualization» more  IV 2005»
13 years 11 months ago
Visualizing Time Dependent Semantics: An Application to Quantum Algorithms
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
COGSCI
2006
107views more  COGSCI 2006»
13 years 5 months ago
Is the Brain a Quantum Computer?
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...
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 5 months ago
Sharp Quantum versus Classical Query Complexity Separations
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...
J. Niel de Beaudrap, Richard Cleve, John Watrous