1k citations · 12.3k across the 101 of their papers we have counts for
102 papers
Quantum lower bounds for convex optimization and real matrix-vector query problems
Andrew M. Childs
We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of with eva…
Toward a 2D Local Implementation of Quantum LDPC Codes
Noah Berthusen, Dhruv Devulapalli, Eddie Schoute +4
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realizati…
Efficiently verifiable quantum advantage on near-term analog quantum simulators
Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter +4
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimen…
Quantum Algorithms for Simulating Nuclear Effective Field Theories
James D. Watson, Jacob Bringewatt, Alexander F. Shaw +3
Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources to realize this…
Streaming quantum state purification
Andrew M. Childs, Honghao Fu, Debbie Leung +3
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications…
Quantum algorithms and the power of forgetting
Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the na…