836 citations · 1.9k across the 6 of their papers we have counts for
14 papers
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
Dave Bacon, Andrew M. Childs, Wim van Dam
We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect pr…
Spatial search and the Dirac equation
Andrew M. Childs, Jeffrey Goldstone
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for…
Lower bounds on the complexity of simulating quantum gates
Andrew M. Childs, Henry L. Haselgrove, Michael A. Nielsen
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries.…
Spatial search by quantum walk
Andrew M. Childs, Jeffrey Goldstone
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambai…
Reversible simulation of bipartite product Hamiltonians
Andrew M. Childs, Debbie W. Leung, Guifre Vidal
Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversi…
Exponential algorithmic speedup by quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto +3
We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a c…