497 citations · 1.6k across the 74 of their papers we have counts for
3 papers · 1 filter
Better Gap-Hamming Lower Bounds via Better Round Elimination
Joshua Brody, Amit Chakrabarti, Oded Regev +2
Gap Hamming Distance is a well-studied problem in communication complexity, in which Alice and Bob have to decide whether the Hamming distance between their respective n-bit inputs…
Trevisan's extractor in the presence of quantum side information
Anindya De, Christopher Portmann, Thomas Vidick +1
Randomness extraction involves the processing of purely classical information and is therefore usually studied in the framework of classical probability theory. However, such a cla…
Multiplayer XOR games and quantum communication complexity with clique-wise entanglement
Jop Briet, Harry Buhrman, Troy Lee +1
XOR games are a simple computational model with connections to many areas of complexity theory. Perhaps the earliest use of XOR games was in the study of quantum correlations. XOR…