1. Research
  2. Publications

Publications

Export 12 results:
Author Title Type [ Year(Asc)]
Filters: Author is Robin Kothari  [Clear All Filters]
2020
S. Arunachalam, Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., and de Wolf, R., “Quantum Coupon Collector”, Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics, vol. 158, pp. 10:1-10:17, 2020.
2018
S. Ben-David, Bouland, A., Garg, A., and Kothari, R., “Classical lower bounds from quantum upper bounds”, 2018.
2017
A. M. Childs, Kothari, R., and Somma, R. D., “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”, SIAM Journal on Computing, vol. 46, no. 6, pp. 1920-1950, 2017.
2015
D. W. Berry, Childs, A. M., Cleve, R., Kothari, R., and Somma, R. D., “Simulating Hamiltonian dynamics with a truncated Taylor series”, Physical Review Letters, vol. 114, no. 9, p. 090502, 2015.
D. W. Berry, Childs, A. M., and Kothari, R., “Hamiltonian simulation with nearly optimal dependence on all parameters”, Proceedings of the 56th IEEE Symposium on Foundations of Computer Science, pp. 792-809, 2015.
2014
D. W. Berry, Childs, A. M., Cleve, R., Kothari, R., and Somma, R. D., “Exponential improvement in precision for simulating sparse Hamiltonians”, Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), pp. 283-292, 2014.
2013
A. M. Childs, Kothari, R., Ozols, M., and Roetteler, M., “Easy and hard functions for the Boolean hidden shift problem”, Proceedings of TQC 2013, vol. 22, pp. 50-79, 2013.
A. M. Childs, Jeffery, S., Kothari, R., and Magniez, F., “A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates”, 2013.
2012
A. M. Childs, Kimmel, S., and Kothari, R., “The quantum query complexity of read-many formulas”, Lecture Notes in Computer Science, vol. 7501, pp. 337-348, 2012.
2011
A. M. Childs and Kothari, R., “Quantum query complexity of minor-closed graph properties”, Proc. 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011), Leibniz International Proceedings in Informatics, vol. 9, pp. 661-672, 2011.
2010
A. M. Childs and Kothari, R., “Simulating sparse Hamiltonians with star decompositions”, 2010.
2009
A. M. Childs and Kothari, R., “Limitations on the simulation of non-sparse Hamiltonians”, 2009.