34 citations · 217 across the 27 of their papers we have counts for
31 papers
Fast Quantum Algorithms for Learning Linear Threshold Functions
Aleksandrs Krivcenko, Tuyen Nguyen, Ronald de Wolf
Linear threshold functions are , where the weight vector is a unit vector, is a threshold, and ty…
Generating EPR-pairs from an -party resource state
Sergey Bravyi, Yash Sharma, Mario Szegedy +1
Motivated by quantum network applications over classical channels, we initiate the study of -party resource states from which LOCC protocols can create EPR-pairs between any …
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms
Nikhil Bansal, Makrand Sinha, Ronald de Wolf
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable. This conjecture, if t…
A Guide for New Program Committee Members at Theoretical Computer Science Conferences
Yfke Dulek, Stacey Jeffery, Christian Majenz +3
In theoretical computer science, conferences play an important role in the scientific process. The decisions whether to accept or reject articles is taken by the program committee…
The Role of Symmetry in Quantum Query-to-Communication Simulation
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer +3
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of…
Improved Quantum Boosting
Adam Izdebski, Ronald de Wolf
Boosting is a general method to convert a weak learner (which generates hypotheses that are just slightly better than random) into a strong learner (which generates hypotheses that…