#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1999

2018

- This year (4)
- Last 5 years (20)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time… (More)

- Andrew M. Childs
- 2004

Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not… (More)

- Dave Bacon, Andrew M. Childs, Wim van Dam
- FOCS
- 2005

EDUCATION Ph.D. Computer Science, University of Amsterdam, 2002 Thesis title: “On Quantum Computation Theory”, supervisor: Prof. P. Vitányi Ph.D. Physics, University of Oxford, 2000 Thesis title:… (More)

We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically,… (More)

- Andrew M. Childs
- Quantum Information & Computation
- 2005

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims… (More)

- Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani
- 48th Annual IEEE Symposium on Foundations of…
- 2007

Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonAbelian hidden subgroup problem, which generalizes the central problem solved by Shor's… (More)

- Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma
- Physical review letters
- 2015

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the… (More)

- Andrew M. Childs, David Jao, Vladimir Soukharev
- J. Mathematical Cryptology
- 2014

Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to… (More)

- Andrew M. Childs
- Physical review letters
- 2009

In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the… (More)

- Andrew M. Childs, Robin Kothari
- SIAM J. Comput.
- 2012