Reversibility and the structure of the local state space

The richness of quantum theory's reversible dynamics is one of its unique operational characteristics, with recent results suggesting deep links between the theory's reversible dynamics, its local state space and the degree of non-locality it permits. We explore the delicate interplay between these features, demonstrating that reversibility places strong constraints on both the local and global state space. Firstly, we show that reversible dynamics are trivial (composed of local transformations and permutations of subsytems) in maximally non-local theories whose local state spaces satisfy a dichotomy criterion; this applies to a range of operational models that have previously been studied, such as d-dimensional "hyperballs" and almost all regular polytope systems. By separately deriving a similar result for odd-sided polygons, we show that classical systems are the only regular polytope state spaces whose maximally non-local composites allow for non-trivial reversible dynamics. Secondly, we show that non-trivial reversible dynamics do exist in maximally non-local theories whose state spaces are reducible into two or more smaller spaces. We conjecture that this is a necessary condition for the existence of such dynamics, but that reversible entanglement generation remains impossible even in this scenario.Comment: 12+epsilon pages, 2 figure

Pauli Diagonal Channels Constant on Axes

We define and study the properties of channels which are analogous to unital qubit channels in several ways. A full treatment can be given only when the dimension d is a prime power, in which case each of the (d+1) mutually unbiased bases (MUB) defines an axis. Along each axis the channel looks like a depolarizing channel, but the degree of depolarization depends on the axis. When d is not a prime power, some of our results still hold, particularly in the case of channels with one symmetry axis. We describe the convex structure of this class of channels and the subclass of entanglement breaking channels. We find new bound entangled states for d = 3. For these channels, we show that the multiplicativity conjecture for maximal output p-norm holds for p=2. We also find channels with behavior not exhibited by unital qubit channels, including two pairs of orthogonal bases with equal output entropy in the absence of symmetry. This provides new numerical evidence for the additivity of minimal output entropy

Simpler, faster and shorter labels for distances in graphs

We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to determine the distance between the two nodes. The challenge in such a distance labeling scheme is primarily to minimize the maximum label lenght and secondarily to minimize the time needed to answer distance queries (decoding). Previous schemes have offered different trade-offs between label lengths and query time. This paper presents a simple algorithm with shorter labels and shorter query time than any previous solution, thereby improving the state-of-the-art with respect to both label length and query time in one single algorithm. Our solution addresses several open problems concerning label length and decoding time and is the first improvement of label length for more than three decades. More specifically, we present a distance labeling scheme with label size (log 3)/2 + o(n) (logarithms are in base 2) and O(1) decoding time. This outperforms all existing results with respect to both size and decoding time, including Winkler's (Combinatorica 1983) decade-old result, which uses labels of size (log 3)n and O(n/log n) decoding time, and Gavoille et al. (SODA'01), which uses labels of size 11n + o(n) and O(loglog n) decoding time. In addition, our algorithm is simpler than the previous ones. In the case of integral edge weights of size at most W, we present almost matching upper and lower bounds for label sizes. For r-additive approximation schemes, where distances can be off by an additive constant r, we give both upper and lower bounds. In particular, we present an upper bound for 1-additive approximation schemes which, in the unweighted case, has the same size (ignoring second order terms) as an adjacency scheme: n/2. We also give results for bipartite graphs and for exact and 1-additive distance oracles

Coverage and Connectivity in Three-Dimensional Networks

Most wireless terrestrial networks are designed based on the assumption that the nodes are deployed on a two-dimensional (2D) plane. However, this 2D assumption is not valid in underwater, atmospheric, or space communications. In fact, recent interest in underwater acoustic ad hoc and sensor networks hints at the need to understand how to design networks in 3D. Unfortunately, the design of 3D networks is surprisingly more difficult than the design of 2D networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture required centuries of research to achieve breakthroughs, whereas their 2D counterparts are trivial to solve. In this paper, we consider the coverage and connectivity issues of 3D networks, where the goal is to find a node placement strategy with 100% sensing coverage of a 3D space, while minimizing the number of nodes required for surveillance. Our results indicate that the use of the Voronoi tessellation of 3D space to create truncated octahedral cells results in the best strategy. In this truncated octahedron placement strategy, the transmission range must be at least 1.7889 times the sensing range in order to maintain connectivity among nodes. If the transmission range is between 1.4142 and 1.7889 times the sensing range, then a hexagonal prism placement strategy or a rhombic dodecahedron placement strategy should be used. Although the required number of nodes in the hexagonal prism and the rhombic dodecahedron placement strategies is the same, this number is 43.25% higher than the number of nodes required by the truncated octahedron placement strategy. We verify by simulation that our placement strategies indeed guarantee ubiquitous coverage. We believe that our approach and our results presented in this paper could be used for extending the processes of 2D network design to 3D networks.Comment: To appear in ACM Mobicom 200

A new upper bound on the number of neighborly boxes in R^d

A new upper bound on the number of neighborly boxes in R^d is given. We apply a classical result of Kleitman on the maximum size of sets with a given diameter in discrete hypercubes. We also present results of some computational experiments and an emerging conjecture

Four dimensional topological quantum field theory, Hopf categories, and the canonical bases

We propose a new mwthod of constructing 4D-TQFTs. The method uses a new type of algebraic structure called a Hopf Category. We also outline the construction of a family of Hopf categories related to the quantum groups, using the canonical bases.Comment: 38 page