27 citations · 183 across the 26 of their papers we have counts for
15 papers · 1 filter
Testing bosonic and fermionic Gaussian states with a constant number of copies
Jop Briët, Davi Castro-Silva, Michael Walter +1
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of…
Clifford testing: algorithms and lower bounds
Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht +3
We consider the problem of Clifford testing, which asks whether a black-box -qubit unitary is a Clifford unitary or at least -far from every Clifford unitary. We gi…
Grothendieck inequalities characterize converses to the polynomial method
Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorit…
On converses to the polynomial method
Jop Briët, Francisco Escudero Gutiérrez
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorit…
Quasirandom quantum channels
Tom Bannink, Jop Briët, Farrokh Labib +1
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties corre…
Round elimination in exact communication complexity
Jop Briët, Harry Buhrman, Debbie Leung +2
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we conside…