Hartree Postdoctoral Fellow (2014-2017)

3100E Atlantic Building

(301) 314-1763

Shelby Kimmel was a QuICS Hartree Postdoctoral Fellow in quantum information and computer science. Her research was in quantum tomography procedures and quantum query complexity. Kimmel’s research seeks to create procedures for quantum tomography of processes and states that are either more robust (accurate even in the presence of noise) or more efficient than previous procedures. She was also working to understand the limits of quantum computation, and how quantum computing power compares to classical computing power. Kimmel uses tools such as the adversary bound, span programs, and other techniques to put lower and upper bounds on the number of queries a quantum computer or a classical computer must make to solve a problem. Problems involving formula evaluation and graphs are of particular interest to her. Kimmel received her doctorate in physics from MIT in 2014. After QuICS, she continued on as a visiting Assistant Professor in Computer Science at Middlebury.

“Phase retrieval using unitary 2-designs”, in SampTA 2017, 2017. ,

“Experimental demonstration of cheap and accurate phase estimation”, Physical Review Letters, vol. 118, no. 19, p. 190502, 2017. ,

“Hamiltonian Simulation with Optimal Sample Complexity”, npj Quantum Information, vol. 13, no. 3, 2017. ,

“A Quantum Version of Schöning's Algorithm Applied to Quantum 2-SAT”, Quantum Information and Computation, vol. 16, no. 13-14, 2016. ,

“Robust Single-Qubit Process Calibration via Robust Phase Estimation”, Physical Review A, vol. 92, no. 6, p. 062315, 2015. ,

“Demonstration of Robust Quantum Gate Tomography via Randomized Benchmarking”, New Journal of Physics, vol. 17, no. 11, p. 113019, 2015. ,

“Oracles with Costs”, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015), vol. 44, pp. 1-26, 2015. ,

“Robust Extraction of Tomographic Information via Randomized Benchmarking”, Physical Review X, vol. 4, no. 1, 2014. ,

“Quantum Adversary (Upper) Bound”, Chicago Journal of Theoretical Computer Science, vol. 19, no. 1, pp. 1 - 14, 2013. ,

“The quantum query complexity of read-many formulas”, Lecture Notes in Computer Science, vol. 7501, pp. 337-348, 2012. ,

“Super-Polynomial Quantum Speed-ups for Boolean Evaluation Trees with Hidden Structure”, ITCS '12 Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 249-265, 2012. ,

“Entanglement Cost of Nonlocal Measurements”, Physical Review A, vol. 80, no. 1, 2009. ,