Andrew M. Childs

	2011
28		Andris Ambainis, Andrew M. Childs, Yi-Kai Liu: Quantum Property Testing for Bounded-Degree Graphs. APPROX-RANDOM 2011: 365-376
27		Andrew M. Childs, Robin Kothari: Quantum query complexity of minor-closed graph properties. STACS 2011: 661-672
26		Andrew M. Childs, Shelby Kimmel, Robin Kothari: The quantum query complexity of read-many formulas CoRR abs/1112.0548: (2011)
25		Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols: Characterization of universal two-qubit Hamiltonians. Quantum Information & Computation 11(1&2): 19-39 (2011)
	2010
24		Andrew M. Childs, Robin Kothari: Simulating Sparse Hamiltonians with Star Decompositions. TQC 2010: 94-103
23		Andrew M. Childs, Robin Kothari: Quantum query complexity of minor-closed graph properties CoRR abs/1011.1443: (2010)
22		Andris Ambainis, Andrew M. Childs, Yi-Kai Liu: Quantum property testing for bounded-degree graphs CoRR abs/1012.3174: (2010)
21		Andrew M. Childs, David Jao, Vladimir Soukharev: Constructing elliptic curve isogenies in quantum subexponential time CoRR abs/1012.4019: (2010)
20		Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani: The quantum query complexity of certification. Quantum Information & Computation 10(3&4): 181-189 (2010)
19		Andrew M. Childs, Robin Kothari: Limitations on the simulation of non-sparse Hamiltonians. Quantum Information & Computation 10(7&8): 669-684 (2010)
18		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. SIAM J. Comput. 39(6): 2513-2530 (2010)
	2009
17		Andrew M. Childs, Michele Mosca: Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers Springer 2009
16		Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani: The quantum query complexity of certification CoRR abs/0903.1291: (2009)
15		Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo: Discrete-Query Quantum Algorithm for NAND Trees. Theory of Computing 5(1): 119-123 (2009)
	2008
14		Andrew M. Childs, Troy Lee: Optimal Quantum Adversary Lower Bounds for Ordered Search. ICALP (1) 2008: 869-880
	2007
13		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
12		Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani: Quantum Algorithms for Hidden Nonlinear Structures. FOCS 2007: 395-404
11		Andrew M. Childs, Wim van Dam: Quantum algorithm for a generalized hidden shift problem. SODA 2007: 1225-1232
10		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
9		Andrew M. Childs, Pawel Wocjan: On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Information & Computation 7(5): 504-521 (2007)
	2006
8		Dave Bacon, Andrew M. Childs, Wim van Dam: Optimal measurements for the dihedral hidden subgroup problem. Chicago J. Theor. Comput. Sci. 2006: (2006)
	2005
7		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
6		Andrew M. Childs: Secure assisted quantum computation. Quantum Information & Computation 5(6): 456-466 (2005)
5		Andrew M. Childs, Jason M. Eisenberg: Quantum algorithms for subset finding. Quantum Information & Computation 5(7): 593-604 (2005)
	2004
4		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
3		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
2		Andrew M. Childs, Debbie W. Leung, Frank Verstraete, Guifre Vidal: Asymptotic entanglement capacity of the ising and anisotropic Heisenberg interactions. Quantum Information & Computation 3(2): 97-105 (2003)
	2002
1		Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann: Finding cliques by quantum adiabatic evolution. Quantum Information & Computation 2(3): 181-191 (2002)

Coauthor Index

1	Andris Ambainis	[13] [16] [18] [20] [22] [28]
2	Dave Bacon	[7] [8]
3	Richard Cleve	[3] [15]
4	Wim van Dam	[7] [8] [11]
5	Enrico Deotto	[3]
6	Jason M. Eisenberg	[5]
7	Edward Farhi	[1] [3]
8	François Le Gall (Francois Le Gall)	[16] [20]
9	Jeffrey Goldstone	[1]
10	Sam Gutmann	[1] [3]
11	Aram Wettroth Harrow	[10]
12	David Jao	[21]
13	Stephen P. Jordan	[15]
14	Shelby Kimmel	[26]
15	Robin Kothari	[19] [23] [24] [26] [27]
16	Troy Lee	[14]
17	Debbie W. Leung	[2] [4] [25]
18	Yi-Kai Liu	[22] [28]
19	Laura Mancinska	[25]
20	Michele Mosca	[17]
21	Maris Ozols	[25]
22	Ben Reichardt (Ben W. Reichardt)	[13] [18]
23	Leonard J. Schulman	[12]
24	Vladimir Soukharev	[21]
25	Robert Spalek	[13] [18]
26	Daniel A. Spielman	[3]
27	Seiichiro Tani	[16] [20]
28	Umesh V. Vazirani	[12]
29	Frank Verstraete	[2]
30	Guifre Vidal	[2] [4]
31	Pawel Wocjan	[9] [10]
32	David L. Yonge-Mallo	[15]
33	Shengyu Zhang	[13] [18]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page