Gus Gutoski, IQC
Juan Jose Garcia Ripoll, Instituto de Física Fundamental
Linmei Liang, National University of Defense Technology, China
Kristan Temme, Massachusetts Institute of Technology
Farzad Qassemi, Université de Sherbrooke
Shengyu Zhang, The Chinese University of Hong Kong
Communication complexity of XOR functions f(x \oplus y) has recently drawn an increasing amount of attention. In this talk, I will discuss some recent progress on this interesting class of functions, including settling communication complexity of all symmetric XOR functions in one-way and SMP model, proving Log-rank conjecture for low-degree polynomials f, and showing tightness of a quantum lower bound in the two-way model.
Dr. Nilanjana Datta, University of Cambridge
Roman Lutchyn, University of California, Berkeley
Luming Duan, University of Michigan
Abstract:
tbd
Ish Dhand, University of Calgary