Andrew M. Childs
Artificial Intelligence · 2000–2021
A researcher in the Science corpus: 19 papers; trusts 54 researchers and is trusted by 65 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 137 citations into it; #3,225 of 36,961 by trust here, #3,480 by citations
- Atomic and Molecular Physics, and Optics — 67 citations into it; #1,189 of 7,158 by trust here, #2,677 by citations
- Computational Theory and Mathematics — 61 citations into it; #415 of 12,489 by trust here, #440 by citations
- Statistical and Nonlinear Physics — 7 citations into it
- Numerical Analysis — 6 citations into it
- Information Systems — 5 citations into it; #890 of 9,233 by trust here, #3,943 by citations
Whom Andrew M. Childs trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Andris Ambainis
- Dominic W. Berry
- Dorit Aharonov
- Edward Farhi
- Julia Kempe
- Miklos Santha
- Richard Cleve
- Jeffrey Goldstone
- Frédéric Magniez
- Aram Wettroth Harrow
Who trusts Andrew M. Childs overall
- Guang Hao Low
- Salvador Elías Venegas-Andraca
- Andris Ambainis
- Dominic W. Berry
- Nathan Wiebe
- Yazhen Wang
- Isaac L. Chuang
- Julia Kempe
- Robin Kothari
- András Gilyén
Papers from Andrew M. Childs's perspective
Ordered by how strongly the researchers Andrew M. Childs trusts endorse each paper. Same corpus, a different order for every researcher.
- Quantum Computation by Adiabatic Evolution
- Adiabatic quantum state generation and statistical zero knowledge (Symposium on the Theory of Computing)
- Quantum Computation and Quantum Information
- Exponential algorithmic speedup by a quantum walk (Symposium on the Theory of Computing)
- Quantum walks on graphs (Symposium on the Theory of Computing)
- An Example of the Difference Between Quantum and Classical Random Walks (Quantum Information Processing)
- Quantum walk algorithm for element distinctness (45th Annual IEEE Symposium on Foundations of Computer Science)
- The Complexity of the Local Hamiltonian Problem (Foundations of Software Technology and Theoretical Computer Science)
- Quantum random-walk search algorithm
- Quantum Amplitude Amplification and Estimation
Their papers
- Exponential algorithmic speedup by a quantum walk (2002) — 948 citations
- On the Relationship Between Continuous- and Discrete-Time Quantum Walk (2008) — 449 citations
- An Example of the Difference Between Quantum and Classical Random Walks (2001) — 428 citations
- Robustness of adiabatic quantum computation (2001) — 388 citations
- Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters (2015) — 524 citations
- Hamiltonian simulation using linear combinations of unitary operations (2012) — 806 citations
- Spatial search by quantum walk (2003) — 644 citations
- Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision (2017) — 303 citations
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (2015) — 764 citations
- Automated optimization of large quantum circuits with continuous parameters (2017) — 311 citations
- Universal Computation by Multiparticle Quantum Walk (2012) — 450 citations
- Constructing elliptic curve isogenies in quantum subexponential time (2010) — 303 citations
- Theory of Trotter Error with Commutator Scaling (2021) — 620 citations
- Efficient quantum algorithm for dissipative nonlinear differential equations (2020) — 295 citations
- Toward the first quantum simulation with quantum speedup (2017) — 617 citations
- Simulating Hamiltonian dynamics with a truncated Taylor series. (2014) — 763 citations
- Exponential improvement in precision for simulating sparse Hamiltonians (2013) — 451 citations
- Universal computation by quantum walk. (2008) — 888 citations
- Realization of quantum process tomography in NMR (2000) — 187 citations