Kewen Wu

Kewen Wu is an assistant professor in the Computing and Mathematical Sciences (CMS) Department at the California Institute of Technology. His research interests lie in the general area of theoretical computer science, with a recent focus on provable quantum advantages, Boolean function analysis, and quantum cryptography. Wu received his Ph.D. from UC Berkeley in Spring 2025, where he was advised by Avishay Tal. Before that, he received his B.S. in Computer Science and Math from Peking University. His name written in Chinese is 吴克文, and he may be pronounced as Kevin.

Kewen Wu is a researcher in theoretical computer science, focusing on areas such as quantum computing, complexity theory, and algorithm design. His work explores the theoretical foundations of computational problems, including the development of efficient algorithms and the analysis of their limitations. Wu's research includes topics like the sunflower lemma, quantum state preparation, and the parameterized inapproximability hypothesis. He has contributed to the understanding of quantum advantage, Fourier growth of decision trees, and the complexity of sampling problems. His publications often intersect with computational complexity, quantum algorithms, and the design of efficient data structures.