Search For:

Displaying 1-4 out of 4 total
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Dave Bacon, Andrew M. Childs, Wim van Dam
Issue Date:October 2005
pp. 469-478
<p>We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pret...
Found in: Computing in Science and Engineering
By Dave Bacon
Issue Date:September 2010
pp. 5-7
<p>Stephen M. Barnett's Quantum Information offers a strong, broadly accessible introductory guide to the field of quantum information science. In Scientific Computation, Gaston Gonnet and Ralf Scholl treat a range of algorithms and offer a unique mo...
Ubiquity symposium 'What is computation?': Computation and Fundamental Physics
Found in: Ubiquity
By Dave Bacon
Issue Date:December 2010
pp. 1-69
In this seventh article in the ACM Ubiquity symposium, What is Computation?, Dave Bacon of University of Washington explains why he thinks discussing the question is as important as thinking about what it means to be self-aware. —Editor
Recent progress in quantum algorithms
Found in: Communications of the ACM
By Dave Bacon, Wim van Dam, Wim van Dam
Issue Date:February 2010
pp. 84-93
What quantum algorithms outperform classical computation and how do they do it?