In 1994 the discovery by Peter Shor of an algorithm for factoring large numbers in polynomial time using a quantum computer1 transformed the field of quantum computation from a theoretical curiosity to a potential technology of national interest. The appeal of a computational paradigm with a potentially exponential increase in capacity over classical approaches dramatically increased interest and research in the field. Interestingly, however, discoveries of other useful quantum algorithms have come few and far between. The ramifications of a quantum factoring algorithm on cryptography not withstanding, it is beginning to appear as if quantum computation is an answer looking for a question. The field of computational intelligence, including ...