Andrew M. Childs Research Group

The research program develops and analyzes quantum algorithms for simulation, quantum walks, and query complexity to characterize quantum computational power. Researchers construct algorithmic frameworks for fast Hamiltonian simulation and eigenvalue transformation, using analytic techniques and complexity analysis to bound resources and error. Methods include theoretical proofs, algorithm design, and benchmarking against model problems to demonstrate exponential speedups and computational universality. The group applies these techniques to problems in quantum simulation, algebraic algorithms, and foundations of quantum information processing.