For a graph G, and two distinct vertices u v of let $$ n_{{G(u,v)}} n G ( , ) be the number that are closer in to than v. Miklavi? Šparl arXiv:2011.01635v1 define distance-unbalancedness $${{\mathrm{uB}}}(G)$$ uB as sum $$|n_G(u,v)-n_G(v,u)|$$ | - over all unordered pairs G. positive integers up 15, they determine trees T fixed order with smallest largest values $${\mathrm{uB}}(T)$$ respectivel...

We study the efficiency of two-qubit mixed entangled states as resources for quantum teleportation. We first consider two maximally entangled mixed states, viz., the Werner state[1], and a class of states introduced by Munro et al. [2]. We show that the Werner state when used as teleportation channel, gives rise to better average teleportation fidelity compared to the latter class of states for...

A key computation in visual cortex is the extraction of object contours, where the first stage of processing is commonly attributed to V1 simple cells. The standard model of a simple cell-an oriented linear filter followed by a divisive normalization-fits a wide variety of physiological data, but is a poor performing local edge detector when applied to natural images. The brain's ability to fin...