
Search the dblp DataBase
Andrew M. Childs:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Dave Bacon, Andrew M. Childs, Wim van Dam
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:469478 [Conf]
 Andrew M. Childs, Aram Wettroth Harrow, Pawel Wocjan
Weak FourierSchur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:598609 [Conf]
 Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
Exponential algorithmic speedup by a quantum walk. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:5968 [Conf]
 Andrew M. Childs, Debbie W. Leung, Guifre Vidal
Reversible Simulation of Bipartite Product Hamiltonians. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:11891197 [Journal]
 Andrew M. Childs, Wim van Dam
Quantum algorithm for a generalized hidden shift problem. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:12251232 [Conf]
Any ANDOR Formula of Size N can be Evaluated in time N^{1/2+o(1)} on a Quantum Computer. [Citation Graph (, )][DBLP]
Quantum Algorithms for Hidden Nonlinear Structures. [Citation Graph (, )][DBLP]
Optimal Quantum Adversary Lower Bounds for Ordered Search. [Citation Graph (, )][DBLP]
The quantum query complexity of certification [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
