1.1k citations · 4.7k across the 73 of their papers we have counts for
4 papers · 1 filter
Unbounded Error Quantum Query Complexity
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater th…
Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
Toby Cubitt, Aram W. Harrow, Debbie Leung +2
Complementing recent progress on the additivity conjecture of quantum information theory, showing that the minimum output p-Renyi entropies of channels are not generally additive f…
A lower bound on the probability of error in quantum state discrimination
Ashley Montanaro
We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.
Quantum search of partially ordered sets
Ashley Montanaro
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considere…