| 2009 |
|---|
| 9 | EE | Andris Ambainis,
Andrew M. Childs,
François Le Gall,
Seiichiro Tani:
The quantum query complexity of certification
CoRR abs/0903.1291: (2009) |
| 2008 |
|---|
| 8 | EE | Andrew M. Childs,
Troy Lee:
Optimal Quantum Adversary Lower Bounds for Ordered Search.
ICALP (1) 2008: 869-880 |
| 2007 |
|---|
| 7 | EE | Andris Ambainis,
Andrew M. Childs,
Ben Reichardt,
Robert Spalek,
Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer.
FOCS 2007: 363-372 |
| 6 | EE | Andrew M. Childs,
Leonard J. Schulman,
Umesh V. Vazirani:
Quantum Algorithms for Hidden Nonlinear Structures.
FOCS 2007: 395-404 |
| 5 | EE | Andrew M. Childs,
Wim van Dam:
Quantum algorithm for a generalized hidden shift problem.
SODA 2007: 1225-1232 |
| 4 | EE | Andrew M. Childs,
Aram Wettroth Harrow,
Pawel Wocjan:
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.
STACS 2007: 598-609 |
| 2005 |
|---|
| 3 | EE | Dave Bacon,
Andrew M. Childs,
Wim van Dam:
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups.
FOCS 2005: 469-478 |
| 2004 |
|---|
| 2 | | Andrew M. Childs,
Debbie W. Leung,
Guifre Vidal:
Reversible Simulation of Bipartite Product Hamiltonians.
IEEE Transactions on Information Theory 50(6): 1189-1197 (2004) |
| 2003 |
|---|
| 1 | EE | Andrew M. Childs,
Richard Cleve,
Enrico Deotto,
Edward Farhi,
Sam Gutmann,
Daniel A. Spielman:
Exponential algorithmic speedup by a quantum walk.
STOC 2003: 59-68 |
