68 citations · 68 across the 3 of their papers we have counts for
5 papers
On State Distinguishing Without Inverse Queries
Emma Wang, Joseph Carolan, Andrew M. Childs
In the quantum state distinguishing problem, an algorithm is given copies of a state or separated by trace distance , and tasked with deciding…
Optimal Quantum Algorithms for Ordered Search
Joseph Carolan, Andrew M. Childs
Ordered search is the problem of locating a target element in a sorted list of size using comparison queries. Classically, binary search requires querie…
A quantum lower bound for path finding in welded trees
Joseph Carolan, Andrew M. Childs, Matthew Coudron +1
In the welded tree problem, an algorithm is tasked with navigating a graph formed from two binary trees joined at the leaves through a ``weld'' of connecting edges. A quantum walk…
Quantum lower bounds for simulating fluid dynamics
Abtin Ameri, Joseph Carolan, Andrew M. Childs +1
Developing quantum algorithms to simulate fluid dynamics has become an active area of research, as accelerating fluid simulations could have significant impact in both industry and…
Quantum algorithms for hidden nonlinear structures
Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central proble…