research
∙
03/02/2023
Quantum Channel Certification with Incoherent Strategies
In the problem of quantum channel certification, we have black box acces...
share
research
∙
01/22/2023
Lower Bounds on Learning Pauli Channels
Understanding the noise affecting a quantum device is of fundamental imp...
research
∙
06/22/2022
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations
We address the problem of coding for multiple-access channels (MACs) wit...
research
∙
05/12/2022
Sequential algorithms for testing identity and closeness of distributions
What advantage do sequential procedures provide over batch algorithms fo...
research
∙
03/09/2022
Generalised entropy accumulation
Consider a sequential process in which each step outputs a system A_i an...
research
∙
01/31/2022
A lower bound on the space overhead of fault-tolerant quantum computation
The threshold theorem is a fundamental result in the theory of fault-tol...
research
∙
11/16/2021
Larger Corner-Free Sets from Combinatorial Degenerations
There is a large and important collection of Ramsey-type combinatorial p...
research
∙
04/02/2021
Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors
We develop and apply new combinatorial and algebraic tools to understand...
research
∙
10/02/2020
Tight Approximation Guarantees for Concave Coverage Problems
In the maximum coverage problem, we are given subsets T_1, …, T_m of a u...
research
∙
09/12/2019
A chain rule for the quantum relative entropy
The chain rule for the classical relative entropy ensures that the relat...
research
∙
06/04/2019
Learning dynamic polynomial proofs
Polynomial inequalities lie at the heart of many mathematical discipline...
research
∙
05/08/2019
Bounds on Lyapunov exponents
Lyapunov exponents describe the asymptotic behavior of the singular valu...
research
∙
05/02/2019
Tight Approximation Bounds for Maximum Multi-Coverage
In the classic maximum coverage problem, we are given subsets T_1, ..., ...
research
∙
08/11/2018
Constant overhead quantum fault-tolerance with quantum expander codes
We prove that quantum expander codes can be combined with quantum fault-...
research
∙
02/23/2018
Adversarial vulnerability for any classifier
Despite achieving impressive and often superhuman performance on multipl...
research
∙
02/22/2018
Robustness of classifiers to uniform â„“_p and Gaussian noise
We study the robustness of classifiers to various kinds of random noise ...
research
∙
05/26/2017
Analysis of universal adversarial perturbations
Deep networks have recently been shown to be vulnerable to universal per...
research
∙
10/26/2016
Universal adversarial perturbations
Given a state-of-the-art deep neural network classifier, we show the exi...
research
∙
02/09/2015
