Andrew M. Childs
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Quantum algorithms and the power of forgetting | ITCS 2023 | 2023-01-10 |
Main claim: no polynomial-query genuine rooted quantum algorithm finds an entrance→exit path in the three-colored welded-tree oracle. Proof builds an address… | ||
| Symmetries, Graph Properties, and Quantum Speedups | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Shows three concrete claims: graphs described by an adjacency matrix admit at most a 6th power bound (more generally a 3K power for K‑uniform hypergraph… | ||
| nothing matches | ||