Follow
Pei Wu
Title
Cited by
Cited by
Year
Optimal interactive coding for insertions, deletions, and substitutions
AA Sherstov, P Wu
IEEE Transactions on Information Theory 65 (10), 5971-6000, 2019
262019
An optimal separation of randomized and quantum query complexity
AA Sherstov, AA Storozhenko, P Wu
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
252021
Near-optimal lower bounds on the threshold degree and sign-rank of AC0
AA Sherstov, P Wu
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
232019
The power of unentangled quantum proofs with non-negative amplitudes
FG Jeronimo, P Wu
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1629-1642, 2023
62023
Dimension Independent Disentanglers from Unentanglement and Applications
FG Jeronimo, P Wu
arXiv preprint arXiv:2402.15282, 2024
12024
An Optimal “It Ain’t Over Till It’s Over” Theorem
R Eldan, A Wigderson, P Wu
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 853-866, 2023
12023
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
F Granha Jeronimo, P Wu
arXiv e-prints, arXiv: 2402.18790, 2024
2024
Subset States and Pseudorandom States
F Granha Jeronimo, N Magrafta, P Wu
arXiv e-prints, arXiv: 2312.15285, 2023
2023
Communication and Complexity
P Wu
University of California, Los Angeles, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–9