- Full text PDF available (2)
In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n and e, we determine the minimum degree distance of a connected graph of order n and size e.
Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle problems, including the GROUP MULTIPLICATION problem, in which the product of an ordered n-tuple of group elements is to… (More)