10 citations · 25 across the 5 of their papers we have counts for
6 papers
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…
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
Sabine Burgdorf, Monique Laurent, Teresa Piovesan
We investigate structural properties of the completely positive semidefinite cone , consisting of all the symmetric matrices that admit a Gram repres…
Multi-party zero-error classical channel coding with entanglement
Teresa Piovesan, Giannicola Scarpa, Christian Schaffner
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-pa…
Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
Monique Laurent, Teresa Piovesan
We investigate the completely positive semidefinite cone , a new matrix cone consisting of all matrices that admit a Gram representation by positive s…
Entanglement-assisted zero-error source-channel coding
Jop Briët, Harry Buhrman, Monique Laurent +2
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given corr…
A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees
Teresa Piovesan, Steven Kelk
Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r…