Optimal Quantum de Finetti Theorems via Argmax Rounding
F. G. Jeronimo, P. Wu, H. Xu
Theoretical computer science
Pei Wu
Assistant Professor
Department of Computer Science and Engineering · Penn State University
Biography
I am broadly interested in complexity theory, including quantum complexity, Sum-of-Squares optimization, and query and communication complexity.
I obtained my Ph.D. in Computer Science from the University of California, Los Angeles, where I was fortunate to be advised by Alexander Sherstov.
I spent two years as a postdoctoral member at the Institute for Advanced Study under the supervision of Avi Wigderson, followed by one year as a postdoctoral researcher at the Weizmann Institute, hosted by Thomas Vidick.
Selected publications
Coherence in Property Testing: Quantum-Classical Collapses and Separations
F. G. Jeronimo, N. Magrafta, J. Slote, P. Wu
An Optimal “It Ain’t Over till It’s Over” Theorem
R. Eldan, A. Wigderson, P. Wu
More papers, slides, and talks
Dimension Independent Disentanglers from Unentanglement and Applications
F. G. Jeronimo, P. Wu
The Power of Unentangled Proofs with Non-negative Amplitudes
F. G. Jeronimo, P. Wu
QIP 2024 contributed talk
An Optimal Separation of Randomized and Quantum Query Complexity
A. A. Sherstov, A. A. Storozhenko, and P. Wu
QIP 2021 contributed talk
Near-Optimal Lower Bounds on the Threshold Degree and Sign-rank of AC0
A. A. Sherstov, P. Wu
Invited to appear in SIAM Journal on Computing (special issue for STOC 2019)
Optimal Interactive Coding for Insertions, Deletions, and Substitutions
A. A. Sherstov, P. Wu
IEEE Transactions on Information Theory, 65(10):5971–6000, 2019.
Recorded talks
Contact
Office
W315 Westgate BuildingState College, PA 16802