BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Iceland
1 × Latvia
2 × USA
Collaborated with:
T.Lee R.Kothari R.Cleve D.Gosset Z.Webb D.W.Berry R.D.Somma A.Belovs S.Jeffery F.Magniez E.Deotto E.Farhi S.Gutmann D.A.Spielman
Talks about:
quantum (3) exponenti (2) walk (2) hamiltonian (1) algorithm (1) adversari (1) distinct (1) speedup (1) hubbard (1) complet (1)

Person: Andrew M. Childs

DBLP DBLP: Childs:Andrew_M=

Contributed to:

ICALP (1) 20142014
STOC 20142014
ICALP (1) 20132013
ICALP (1) 20082008
STOC 20032003

Wrote 5 papers:

The Bose-Hubbard Model is QMA-complete (AMC, DG, ZW), pp. 308–319.
STOC-2014-BerryCCKS #exponential #precise #simulation
Exponential improvement in precision for simulating sparse Hamiltonians (DWB, AMC, RC, RK, RDS), pp. 283–292.
ICALP-v1-2013-BelovsCJKM #3d #quantum
Time-Efficient Quantum Walks for 3-Distinctness (AB, AMC, SJ, RK, FM), pp. 105–122.
ICALP-A-2008-ChildsL #bound #order #quantum
Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.
STOC-2003-ChildsCDFGS #algorithm #exponential #quantum
Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.