default search action
Andrew M. Childs
Person information
- affiliation: University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i37]Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter
, Yi-Kai Liu, Alicia J. Kollár
Efficiently verifiable quantum advantage on near-term analog quantum simulators. CoRR abs/2403.08195 (2024) - 2023
- [c25]Andrew M. Childs
Quantum Algorithms and the Power of Forgetting. ITCS 2023: 37:1-37:22 - [i36]Dong An, Andrew M. Childs, Lin Lin:
Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters. CoRR abs/2312.03916 (2023) - 2022
- [j31]Andrew M. Childs
Quantum simulation of real-space dynamics. Quantum 6: 860 (2022) - [c24]Andrew M. Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, Ruizhe Zhang:
Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants. NeurIPS 2022 - [i35]Andrew M. Childs, Jiaqi Leng, Tongyang Li, Jin-Peng Liu, Chenyi Zhang:
Quantum simulation of real-space dynamics. CoRR abs/2203.17006 (2022) - [i34]Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, Eddie Schoute:
Advantages and limitations of quantum routing. CoRR abs/2206.01766 (2022) - [i33]Andrew M. Childs, Robin Kothari
Quantum divide and conquer. CoRR abs/2210.06419 (2022) - [i32]Andrew M. Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, Ruizhe Zhang:
Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants. CoRR abs/2210.06539 (2022) - [i31]Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani:
Quantum algorithms and the power of forgetting. CoRR abs/2211.12447 (2022) - 2021
- [j30]Jin-Peng Liu
Efficient quantum algorithm for dissipative nonlinear differential equations. Proc. Natl. Acad. Sci. USA 118(35): e2026805118 (2021) - [j29]Aniruddha Bapat
Quantum routing with fast reversals. Quantum 5: 533 (2021) - [j28]Andrew M. Childs
High-precision quantum algorithms for partial differential equations. Quantum 5: 574 (2021) - [c23]Daochen Wang, Xuchen You, Tongyang Li, Andrew M. Childs
Quantum Exploration Algorithms for Multi-Armed Bandits. AAAI 2021: 10102-10110 - [c22]Andrew M. Childs
Quantum Query Complexity with Matrix-Vector Products. ICALP 2021: 55:1-55:19 - [i30]Andrew M. Childs, Shih-Han Hung, Tongyang Li:
Quantum query complexity with matrix-vector products. CoRR abs/2102.11349 (2021) - [i29]Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, Samuel King, Eddie Schoute
Quantum routing with fast reversals. CoRR abs/2103.03264 (2021) - 2020
- [j27]Shouvanik Chakrabarti, Andrew M. Childs
Quantum algorithms and lower bounds for convex optimization. Quantum 4: 221 (2020) - [j26]Dominic W. Berry
Time-dependent Hamiltonian simulation withL1-norm scaling. Quantum 4: 254 (2020) - [c21]Shalev Ben-David, Andrew M. Childs
Symmetries, Graph Properties, and Quantum Speedups. FOCS 2020: 649-660 - [c20]Gorjan Alagic, Andrew M. Childs
Non-interactive Classical Verification of Quantum Computation. TCC (3) 2020: 153-180 - [c19]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs
Quantum Coupon Collector. TQC 2020: 10:1-10:17 - [i28]Andrew M. Childs, Daochen Wang:
Can graph properties have exponential quantum speedup? CoRR abs/2001.10520 (2020) - [i27]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. CoRR abs/2002.07688 (2020) - [i26]Andrew M. Childs, Jin-Peng Liu, Aaron Ostrander:
High-precision quantum algorithms for partial differential equations. CoRR abs/2002.07868 (2020) - [i25]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, graph properties, and quantum speedups. CoRR abs/2006.12760 (2020) - [i24]Andrew Y. Guo, Abhinav Deshpande
Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions. CoRR abs/2007.00662 (2020) - [i23]Daochen Wang, Xuchen You, Tongyang Li, Andrew M. Childs:
Quantum exploration algorithms for multi-armed bandits. CoRR abs/2007.07049 (2020) - [i22]Jin-Peng Liu, Herman Øie Kolden, Hari K. Krovi, Nuno F. Loureiro, Konstantina Trivisa, Andrew M. Childs:
Efficient quantum algorithm for dissipative nonlinear differential equations. CoRR abs/2011.03185 (2020) - [i21]Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung:
Non-interactive classical verification of quantum computation. IACR Cryptol. ePrint Arch. 2020: 1422 (2020)
2010 – 2019
- 2019
- [c18]Andrew M. Childs
Circuit Transformations for Quantum Architectures. TQC 2019: 3:1-3:24 - [i20]Andrew M. Childs, Yuan Su:
Nearly optimal lattice simulation by product formulas. CoRR abs/1901.00564 (2019) - [i19]Andrew M. Childs, Jin-Peng Liu:
Quantum spectral methods for differential equations. CoRR abs/1901.00961 (2019) - [i18]Andrew M. Childs, Eddie Schoute, Cem M. Unsal:
Circuit Transformations for Quantum Architectures. CoRR abs/1902.09102 (2019) - [i17]Dominic W. Berry, Andrew M. Childs, Yuan Su
Time-dependent Hamiltonian simulation with $L^1$-norm scaling. CoRR abs/1906.07115 (2019) - [i16]Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung, Tongyang Li
Quantum algorithm for estimating volumes of convex bodies. CoRR abs/1908.03903 (2019) - [i15]Gorjan Alagic, Andrew M. Childs, Shih-Han Hung:
Two-message verification of quantum computation. CoRR abs/1911.08101 (2019) - [i14]Andrew M. Childs, Yuan Su
A Theory of Trotter Error. CoRR abs/1912.08854 (2019) - 2018
- [j25]Andrew M. Childs
Toward the first quantum simulation with quantum speedup. Proc. Natl. Acad. Sci. USA 115(38): 9456-9461 (2018) - [i13]Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li
Quantum algorithms and lower bounds for convex optimization. CoRR abs/1809.01731 (2018) - 2017
- [j24]Andrew M. Childs
Efficient simulation of sparse Markovian quantum dynamics. Quantum Inf. Comput. 17(11&12): 901-947 (2017) - [j23]Andrew M. Childs
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision. SIAM J. Comput. 46(6): 1920-1950 (2017) - [i12]Jianxin Chen, Andrew M. Childs, Shih-Han Hung:
Quantum algorithm for multivariate polynomial interpolation. CoRR abs/1701.03990 (2017) - [i11]Yun Seong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, Dmitri Maslov
Automated optimization of large quantum circuits with continuous parameters. CoRR abs/1710.07345 (2017) - 2016
- [j22]Andrew M. Childs
Complexity of the XY antiferromagnet at fixed magnetization. Quantum Inf. Comput. 16(1&2): 1-18 (2016) - [c17]Andrew M. Childs
Optimal Quantum Algorithm for Polynomial Interpolation. ICALP 2016: 16:1-16:13 - 2015
- [j21]Andrew M. Childs
Momentum switches. Quantum Inf. Comput. 15(7&8): 601-621 (2015) - [j20]Andrew M. Childs
The Bose-Hubbard Model is QMA-complete. Theory Comput. 11: 491-603 (2015) - [c16]Dominic W. Berry
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. FOCS 2015: 792-809 - [i10]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal quantum algorithm for polynomial interpolation. CoRR abs/1509.09271 (2015) - 2014
- [j19]Andrew M. Childs
Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1): 1-29 (2014) - [j18]Andrew M. Childs, Gábor Ivanyos:
Quantum computation of discrete logarithms in semigroups. J. Math. Cryptol. 8(4): 405-416 (2014) - [j17]Daniel J. Brod, Andrew M. Childs
The computational power of matchgates and the XY interaction on arbitrary graphs. Quantum Inf. Comput. 14(11-12): 901-916 (2014) - [c15]Andrew M. Childs
The Bose-Hubbard Model is QMA-complete. ICALP (1) 2014: 308-319 - [c14]Dominic W. Berry
Exponential improvement in precision for simulating sparse Hamiltonians. STOC 2014: 283-292 - 2013
- [c13]Aleksandrs Belovs, Andrew M. Childs
Time-Efficient Quantum Walks for 3-Distinctness. ICALP (1) 2013: 105-122 - [c12]Andrew M. Childs
Easy and Hard Functions for the Boolean Hidden Shift Problem. TQC 2013: 50-79 - [i9]Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates. CoRR abs/1302.7316 (2013) - [i8]Andrew M. Childs, Robin Kothari, Maris Ozols
Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013) - [i7]Andrew M. Childs, Gábor Ivanyos:
Quantum computation of discrete logarithms in semigroups. CoRR abs/1310.6238 (2013) - [i6]Andrew M. Childs, David Gosset, Zak Webb:
The Bose-Hubbard model is QMA-complete. CoRR abs/1311.3297 (2013) - 2012
- [j16]Dominic W. Berry, Andrew M. Childs:
Black-box hamiltonian simulation and unitary implementation. Quantum Inf. Comput. 12(1-2): 29-62 (2012) - [j15]Andrew M. Childs, Nathan Wiebe:
Hamiltonian simulation using linear combinations of unitary operations. Quantum Inf. Comput. 12(11-12): 901-924 (2012) - [j14]Andrew M. Childs
Quantum Query Complexity of Minor-Closed Graph Properties. SIAM J. Comput. 41(6): 1426-1450 (2012) - [c11]Andrew M. Childs
The Quantum Query Complexity of Read-Many Formulas. ESA 2012: 337-348 - 2011
- [j13]Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols:
Characterization of universal two-qubit Hamiltonians. Quantum Inf. Comput. 11(1&2): 19-39 (2011) - [c10]Andris Ambainis, Andrew M. Childs
Quantum Property Testing for Bounded-Degree Graphs. APPROX-RANDOM 2011: 365-376 - [c9]Andrew M. Childs, Robin Kothari
Quantum query complexity of minor-closed graph properties. STACS 2011: 661-672 - [i5]Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The quantum query complexity of read-many formulas. CoRR abs/1112.0548 (2011) - 2010
- [j12]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. Quantum Inf. Comput. 10(3&4): 181-189 (2010) - [j11]Andrew M. Childs, Robin Kothari:
Limitations on the simulation of non-sparse Hamiltonians. Quantum Inf. Comput. 10(7&8): 669-684 (2010) - [j10]Andris Ambainis, Andrew M. Childs
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer. SIAM J. Comput. 39(6): 2513-2530 (2010) - [c8]Andrew M. Childs, Robin Kothari
Simulating Sparse Hamiltonians with Star Decompositions. TQC 2010: 94-103 - [i4]Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. CoRR abs/1011.1443 (2010) - [i3]Andris Ambainis, Andrew M. Childs, Yi-Kai Liu:
Quantum property testing for bounded-degree graphs. CoRR abs/1012.3174 (2010) - [i2]Andrew M. Childs, David Jao, Vladimir Soukharev:
Constructing elliptic curve isogenies in quantum subexponential time. CoRR abs/1012.4019 (2010)
2000 – 2009
- 2009
- [j9]Andrew M. Childs
Discrete-Query Quantum Algorithm for NAND Trees. Theory Comput. 5(1): 119-123 (2009) - [e1]Andrew M. Childs, Michele Mosca:
Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5906, Springer 2009, ISBN 978-3-642-10697-2 [contents] - [i1]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. CoRR abs/0903.1291 (2009) - 2008
- [c7]Andrew M. Childs, Troy Lee:
Optimal Quantum Adversary Lower Bounds for Ordered Search. ICALP (1) 2008: 869-880 - 2007
- [j8]Andrew M. Childs, Pawel Wocjan:
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Inf. Comput. 7(5): 504-521 (2007) - [c6]Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. FOCS 2007: 363-372 - [c5]Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani:
Quantum Algorithms for Hidden Nonlinear Structures. FOCS 2007: 395-404 - [c4]Andrew M. Childs, Wim van Dam:
Quantum algorithm for a generalized hidden shift problem. SODA 2007: 1225-1232 - [c3]Andrew M. Childs, Aram W. Harrow
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. STACS 2007: 598-609 - 2006
- [j7]Dave Bacon, Andrew M. Childs, Wim van Dam:
Optimal measurements for the dihedral hidden subgroup problem. Chic. J. Theor. Comput. Sci. 2006 (2006) - 2005
- [j6]Andrew M. Childs:
Secure assisted quantum computation. Quantum Inf. Comput. 5(6): 456-466 (2005) - [j5]Andrew M. Childs, Jason M. Eisenberg:
Quantum algorithms for subset finding. Quantum Inf. Comput. 5(7): 593-604 (2005) - [c2]Dave Bacon, Andrew M. Childs, Wim van Dam:
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. FOCS 2005: 469-478 - 2004
- [j4]Andrew M. Childs
Reversible Simulation of Bipartite Product Hamiltonians. IEEE Trans. Inf. Theory 50(6): 1189-1197 (2004) - 2003
- [j3]Andrew M. Childs, Debbie W. Leung, Frank Verstraete, Guifre Vidal:
Asymptotic entanglement capacity of the ising and anisotropic Heisenberg interactions. Quantum Inf. Comput. 3(2): 97-105 (2003) - [c1]Andrew M. Childs
Exponential algorithmic speedup by a quantum walk. STOC 2003: 59-68 - 2002
- [j2]Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann:
Finding cliques by quantum adiabatic evolution. Quantum Inf. Comput. 2(3): 181-191 (2002) - [j1]Andrew M. Childs
An Example of the Difference Between Quantum and Classical Random Walks. Quantum Inf. Process. 1(1-2): 35-43 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: