Dominic W. Berry
Artificial Intelligence · 2005–2020
A researcher in the Science corpus: 13 papers; trusts 31 researchers and is trusted by 37 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 113 citations into it; #4,114 of 35,345 by trust here, #4,170 by citations
- Atomic and Molecular Physics, and Optics — 64 citations into it; #541 of 7,135 by trust here, #1,197 by citations
- Computational Theory and Mathematics — 47 citations into it; #3,112 of 12,182 by trust here, #3,033 by citations
- Numerical Analysis — 7 citations into it; #2,174 of 3,586 by trust here, #1,448 by citations
- Information Systems — 5 citations into it
Whom Dominic W. Berry trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Andrew M. Childs
- Dorit Aharonov
- Aram Wettroth Harrow
- Richard Cleve
- Guang Hao Low
- Lov K. Grover
- Edward Farhi
- Amnon Ta-Shma
- Avinatan Hassidim
- Graeme Ahokas
Who trusts Dominic W. Berry overall
- Andrew M. Childs
- Guang Hao Low
- Nathan Wiebe
- Ryan Babbush
- András Gilyén
- Yuan Su
- Isaac L. Chuang
- Robin Kothari
- Danial Motlagh
- Rolando D. Somma
Papers from Dominic W. Berry's perspective
Ordered by how strongly the researchers Dominic W. Berry 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)
- Creating superpositions that correspond to efficiently integrable probability distributions
- The Complexity of the Local Hamiltonian Problem (Foundations of Software Technology and Theoretical Computer Science)
- Quantum algorithm for linear systems of equations. (Physical Review Letters)
- Quantum Computation and Quantum Information: Bibliography
- An Example of the Difference Between Quantum and Classical Random Walks (Quantum Information Processing)
- Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
- Quantum Arthur–Merlin games (Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.)
- Exponential algorithmic speedup by a quantum walk (Symposium on the Theory of Computing)
Their papers
- Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters (2015) — 524 citations
- Higher order decompositions of ordered operator exponentials (2008) — 188 citations
- Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision (2017) — 303 citations
- Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction (2020) — 338 citations
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity (2018) — 484 citations
- Improved techniques for preparing eigenstates of fermionic Hamiltonians (2017) — 159 citations
- Exponentially more precise quantum simulation of fermions in second quantization (2015) — 137 citations
- Simulating Hamiltonian dynamics with a truncated Taylor series. (2014) — 763 citations
- Exponential improvement in precision for simulating sparse Hamiltonians (2013) — 451 citations
- Entanglement-enhanced measurement of a completely unknown phase (2010) — 145 citations
- High-order quantum algorithm for solving linear differential equations (2010) — 364 citations
- How to perform the most accurate possible phase measurements (2009) — 137 citations
- Efficient Quantum Algorithms for Simulating Sparse Hamiltonians (2005) — 877 citations