1.1k citations · 4.7k across the 73 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
quant-ph2006
A lower bound on entanglement-assisted quantum communication complexity
Ashley Montanaro, Andreas Winter
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classica…
quant-ph2006★ 3 cited
On the quantum chromatic number of a graph
Peter J. Cameron, Ashley Montanaro, Michael W. Newman +2
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince an inte…
quant-ph2006★ 52 cited
On the distinguishability of random quantum states
Ashley Montanaro
We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner product…