Laura Lewis, from Chester Springs, Pennsylvania, is currently a double major in Mathematics and Computer Science at the California Institute of Technology (Caltech). Laura has done extensive research in quantum cryptography which was the first-ever demonstration of efficient classical verification of quantum computations using interactive protocols. Her new research project proving the best-known sample complexity upper bound for using classical machine learning to predict ground state properties of Hamiltonians was just recently accepted to the 26th Annual Conference on Quantum Information Processing. She is a teaching assistant in computer science and physics courses, which earned her the ASCIT Teaching Award, given to the best teaching assistant at Caltech. Laura is also the editor for the Caltech Undergraduate Research journal, editing and peer reviewing manuscripts in physics and computer science for publication in Caltech’s award-winning collegiate journal. As a Marshall Scholar, Laura plans to study Mathematics in Part III of the Mathematical Tripos at the University of Cambridge and then pursue an MSc in Research at the University of Edinburgh under Professor Elham Kashefi.