Andrew Childs
#70,040
Most Influential Person Now
American computer scientist and physicist focused on quantum computing
Andrew Childs's AcademicInfluence.com Rankings
Andrew Childscomputer-science Degrees
Computer Science
#2630
World Rank
#2750
Historical Rank
Database
#7516
World Rank
#7794
Historical Rank
Download Badge
Computer Science Physics
Why Is Andrew Childs Influential?
(Suggest an Edit or Addition)According to Wikipedia, Andrew MacGregor Childs is an American computer scientist and physicist known for his work on quantum computing. He is currently a professor in the department of computer science and Institute for Advanced Computer Studies at the University of Maryland. He also co-directs the Joint Center for Quantum Information and Computer Science, a partnership between the University of Maryland and the National Institute of Standards and Technology.
Andrew Childs's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Exponential algorithmic speedup by a quantum walk (2002) (793)
- Universal computation by quantum walk. (2008) (719)
- Spatial search by quantum walk (2003) (532)
- Simulating Hamiltonian dynamics with a truncated Taylor series. (2014) (432)
- An Example of the Difference Between Quantum and Classical Random Walks (2001) (388)
- Robustness of adiabatic quantum computation (2001) (362)
- Universal Computation by Multiparticle Quantum Walk (2012) (347)
- On the Relationship Between Continuous- and Discrete-Time Quantum Walk (2008) (335)
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (2015) (326)
- Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters (2015) (323)
- Toward the first quantum simulation with quantum speedup (2017) (317)
- Hamiltonian simulation using linear combinations of unitary operations (2012) (315)
- Exponential improvement in precision for simulating sparse Hamiltonians (2013) (267)
- Constructing elliptic curve isogenies in quantum subexponential time (2010) (239)
- Secure assisted quantum computation (2001) (219)
- Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer (2007) (201)
- Black-box hamiltonian simulation and unitary implementation (2009) (180)
- Theory of Trotter Error with Commutator Scaling (2021) (178)
- Automated optimization of large quantum circuits with continuous parameters (2017) (177)
- Realization of quantum process tomography in NMR (2000) (172)
- Quantum information and precision measurement (1999) (152)
- Quantum algorithms for algebraic problems (2008) (146)
- Unified derivations of measurement-based schemes for quantum computation (2004) (131)
- From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups (2005) (123)
- Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision (2017) (116)
- Quantum information processing in continuous time (2004) (110)
- Faster quantum simulation by randomization (2018) (105)
- Spatial search and the Dirac equation (2004) (102)
- Simulating Sparse Hamiltonians with Star Decompositions (2010) (93)
- A Framework for Bounding Nonlocality of State Discrimination (2012) (89)
- Universal simulation of Markovian quantum dynamics (2000) (87)
- Quantum Algorithms for Hidden Nonlinear Structures (2007) (82)
- Efficient quantum algorithm for dissipative nonlinear differential equations (2020) (81)
- Finding cliques by quantum adiabatic evolution (2000) (80)
- Quantum algorithms for subset finding (2003) (80)
- Optimal measurements for the dihedral hidden subgroup problem (2005) (76)
- Nearly optimal lattice simulation by product formulas (2019) (74)
- Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces (2002) (73)
- Circuit Transformations for Quantum Architectures (2019) (71)
- High-precision quantum algorithms for partial differential equations (2020) (70)
- Universal quantum computation with two-level trapped ions (2000) (68)
- Quantum Spectral Methods for Differential Equations (2019) (67)
- Locality and Digital Quantum Simulation of Power-Law Interactions (2018) (65)
- Discrete-Query Quantum Algorithm for NAND Trees (2007) (63)
- Quantum search by measurement (2002) (60)
- A Theory of Trotter Error (2019) (60)
- Time-dependent Hamiltonian simulation with $L^1$-norm scaling (2019) (59)
- ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N ON A QUANTUM COMPUTER∗ (2010) (57)
- Limitations on the simulation of non-sparse Hamiltonians (2009) (56)
- Quantum algorithm for a generalized hidden shift problem (2005) (55)
- Quantum linear systems algorithm with exponentially improved dependence on precision (2015) (51)
- Time-Efficient Quantum Walks for 3-Distinctness (2013) (51)
- The limitations of nice mutually unbiased bases (2004) (50)
- Quantum Query Complexity of Minor-Closed Graph Properties (2010) (45)
- Quantum algorithms for the ordered search problem via semidefinite programming (2006) (42)
- Quantum algorithms and lower bounds for convex optimization (2018) (41)
- Non-interactive classical verification of quantum computation (2019) (39)
- Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer (2007) (37)
- Asymptotic entanglement capacity of the ising and anisotropic Heisenberg interactions (2002) (35)
- Lower bounds on the complexity of simulating quantum gates (2003) (33)
- Spatial search by continuous-time quantum walks on crystal lattices (2014) (31)
- The Bose-Hubbard Model is QMA-complete (2013) (31)
- Quantum algorithms: Equation solving by simulation (2009) (28)
- Characterization of universal two-qubit Hamiltonians (2010) (27)
- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem (2006) (26)
- Quantum computation of discrete logarithms in semigroups (2013) (24)
- On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems (2005) (24)
- Signaling and scrambling with strongly long-range interactions. (2019) (24)
- Reversible simulation of bipartite product Hamiltonians (2003) (23)
- Exact sampling from nonattractive distributions using summary states. (2000) (23)
- Optimal state discrimination and unstructured search in nonlinear quantum mechanics (2015) (22)
- TWO-WAY QUANTUM COMMUNICATION CHANNELS (2005) (20)
- The computational power of matchgates and the XY interaction on arbitrary graphs (2013) (19)
- Destructive Error Interference in Product-Formula Lattice Simulation. (2019) (19)
- Efficient simulation of sparse Markovian quantum dynamics (2016) (19)
- Quantum Property Testing for Bounded-Degree Graphs (2010) (18)
- Optimal Quantum Adversary Lower Bounds for Ordered Search (2007) (18)
- The Quantum Query Complexity of Read-Many Formulas (2011) (17)
- Quantum exploration algorithms for multi-armed bandits (2020) (16)
- Characterization of universal two-qubit hamiltonian (2011) (15)
- Easy and hard functions for the Boolean hidden shift problem (2013) (15)
- The quantum query complexity of certification (2009) (14)
- Universal simulation of Hamiltonian dynamics for qudits (2001) (14)
- Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice (2022) (14)
- Symmetries, Graph Properties, and Quantum Speedups (2020) (14)
- Levinson's theorem for graphs II (2011) (13)
- Levinson's theorem for graphs (2011) (13)
- Universal computation by multi-particle quantum walk arXiv (2012) (13)
- Optimal Quantum Algorithm for Polynomial Interpolation (2015) (12)
- Product formulas for exponentials of commutators (2012) (12)
- Every NAND formula on N variables can be evaluated in time O(N^{1/2+eps}) (2007) (11)
- A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates (2013) (11)
- Hamiltonian Simulation with Random Inputs. (2021) (10)
- Quantum algorithm for estimating volumes of convex bodies (2019) (10)
- Quantum algorithm for multivariate polynomial interpolation (2017) (9)
- Complexity of the XY antiferromagnet at fixed magnetization (2015) (8)
- Two-message verification of quantum computation (2019) (8)
- Every NAND formula of size N can be evaluated in time O ( N 1 2 + ε ) on a quantum computer (2008) (7)
- Spatial search and the Dirac equation (5 pages) (2004) (7)
- Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions (2020) (7)
- Quantum simulation of real-space dynamics (2022) (7)
- Quantum Coupon Collector (2020) (7)
- Quantum routing with fast reversals (2021) (6)
- The quantum query complexity of implementing black-box unitary transformations (2009) (5)
- Interpolatability distinguishes LOCC from separable von Neumann measurements (2013) (5)
- Efficient product formulas for commutators and applications to quantum simulation (2021) (4)
- Quantum query complexity with matrix-vector products (2021) (4)
- Simulation of keV clusters incident on gold targets (1998) (4)
- Nearly optimal time-independent reversal of a spin chain (2020) (4)
- Can graph properties have exponential quantum speedup? (2020) (3)
- Quantum Routing with Teleportation (2022) (3)
- A model for MeV Cn track damage in YIG (1998) (3)
- Advantages and limitations of quantum routing (2022) (3)
- Quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs ( preliminary version ) (2009) (2)
- Quantum divide and conquer (2022) (2)
- Automated optimization of large quantum circuits with continuous parameters (2018) (2)
- Quantum algorithms and the power of forgetting (2022) (2)
- Quantum Spectral Methods for Differential Equations (2020) (2)
- Quantum algorithms ( CO 781 / CS 867 / QIC 823 , Winter 2013 ) (2011) (1)
- Momentum switches (2014) (1)
- A Quantum Algorithm for a Class of Nonlinear Differential Equations (2020) (1)
- Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants (2022) (1)
- Supplemental Material for “Signaling and Scrambling with Strongly Long-Range Interactions” (2019) (0)
- Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision (2017) (0)
- M ay 2 01 8 Faster quantum simulation by randomization (2018) (0)
- Discrete-query quantum algorithm for NAND trees. (arXiv:quant-ph/0702160v2 UPDATED) (2019) (0)
- qu an tph ] 2 3 Ju n 20 20 Symmetries , graph properties , and quantum speedups (2020) (0)
- Finding quantum algorithms via convex optimization (2007) (0)
- J an 2 01 9 Nearly optimal lattice simulation by product formulas (2019) (0)
- 37 82 v 2 [ qu an tph ] 15 F eb 2 01 3 Universal computation by multi-particle quantum walk (2013) (0)
- Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers (2009) (0)
- Signaling and scrambling for strongly long-range interacting quantum systems (2020) (0)
- Continuous time quantum algorithms (2003) (0)
- Quantum advantage deferred (2017) (0)
- 16 0 v 2 6 S ep 2 01 9 Discrete-query quantum algorithm for NAND trees (2019) (0)
- Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography (2009) (0)
- Lieb-Robinson-Type Bounds for Quantum Systems with Strongly Long-Range Interactions (2019) (0)
- High-precision quantum algorithms for ewline partial differential equations (2021) (0)
- 04 12 06 6 v 1 8 D ec 2 00 4 The limitations of nice mutually unbiased bases (2018) (0)
- A Framework for Bounding Nonlocality of State Discrimination (2013) (0)
This paper list is powered by the following services:
Other Resources About Andrew Childs
What Schools Are Affiliated With Andrew Childs?
Andrew Childs is affiliated with the following schools:
