Partial order and a T0T_0-topology in a set of finite quantum systems

A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states, density matrices, etc) into their counterparts in the supersystem $\Sigma (n)$ (for $m|n$). The compatibility of these embeddings is studied. The concept of ubiquity is introduced for quantities which fit with this structure. It is shown that various entropic quantities are ubiquitous. The sets of various quantities become $T_0$-topological spaces with the divisor topology, which encapsulates fundamental physical properties. These sets can be converted into directed-complete partial orders (dcpo), by adding `top elements'. The continuity of various maps among these sets is studied

Causal Set Topology

The Causal Set Theory (CST) approach to quantum gravity is motivated by the observation that, associated with any causal spacetime (M,g) is a poset (M,<), with the order relation < corresponding to the spacetime causal relation. Spacetime in CST is assumed to have a fundamental atomicity or discreteness, and is replaced by a locally finite poset, the causal set. In order to obtain a well defined continuum approximation, the causal set must possess the requisite intrinsic topological and geometric properties that characterise a continuum spacetime in the large. The continuum approximation thus sets the stage for the study of topology in CST. We review the status of causal set topology and present some new results relating poset and spacetime topologies. The hope is that in the process, some of the ideas and questions arising from CST will be made accessible to the larger community of computer scientists and mathematicians working on posets.Comment: Typos fixed, references updated. Latex 22 pages, 3 figure

Topological Test Spaces

A test space is the set of outcome-sets associated with a collection of experiments. This notion provides a simple mathematical framework for the study of probabilistic theories -- notably, quantum mechanics -- in which one is faced with incommensurable random quantities. In the case of quantum mechanics, the relevant test space, the set of orthonormal bases of a Hilbert space, carries significant topological structure. This paper inaugurates a general study of topological test spaces. Among other things, we show that any topological test space with a compact space of outcomes is of finite rank. We also generalize results of Meyer and Clifton-Kent by showing that, under very weak assumptions, any second-countable topological test space contains a dense semi-classical test space.Comment: 12 pp., LaTeX 2e. To appear in Int. J. Theor. Phy

Information Theoretic Study of Gaussian Graphical Models and Their Applications

In many problems we are dealing with characterizing a behavior of a complex stochastic system or its response to a set of particular inputs. Such problems span over several topics such as machine learning, complex networks, e.g., social or communication networks; biology, etc. Probabilistic graphical models (PGMs) are powerful tools that offer a compact modeling of complex systems. They are designed to capture the random behavior, i.e., the joint distribution of the system to the best possible accuracy. Our goal is to study certain algebraic and topological properties of a special class of graphical models, known as Gaussian graphs. First, we show that how Gaussian trees can be used to determine a particular complex system\u27s random behavior, i.e., determining a security robustness of a public communication channel characterized by a Gaussian tree. We show that in such public channels the secrecy capacity of the legitimate users Alice and Bob, in the presence of a passive adversary Eve, is strongly dependent on the underlying structure of the channel. This is done by defining a relevant privacy metric to capture the secrecy capacity of a communication and studying topological and algebraic features of a given Gaussian tree to quantify its security robustness. Next, we examine on how one can effectively produce random samples from such Gaussian tree. The primary concern in synthesis problems is about efficiency in terms of the amount of random bits required for synthesis, as well as the modeling complexity of the given stochastic system through which the Gaussian vector is synthesized. This is done through an optimization problem to propose an efficient algorithm by which we can effectively generate such random vectors. We further generalize the optimization formulation from Gaussian trees to Gaussian vectors with arbitrary structures. This is done by introducing a new latent factor model obtained by solving a constrained minimum determinant factor analysis (CMDFA) problem. We discuss the benefits of factor models in machine learning applications and in particular 3D image reconstruction problems, where our newly proposed CMDFA problem may be beneficial

Noncommutative Lattices as Finite Approximations and Their Noncommutative Geometries

Lattice discretizations of continuous manifolds are common tools used in a variety of physical contexts. Conventional discrete approximations, however, cannot capture all aspects of the original manifold, notably its topology. In this paper we discuss an approximation scheme due to Sorkin which correctly reproduces important topological aspects of continuum physics. The approximating topological spaces are partially ordered sets (posets), the partial order encoding the topology. Now, the topology of a manifold $M$ can be reconstructed from the commutative C*-algebra \cc(M) of continuous functions defined on it. In turn, this algebra is generated by continuous probability densities in ordinary quantum physics on $M$. The latter also serve to specify the domains of observables like the Hamiltonian. For a poset, the role of this algebra is assumed by a noncommutative C$^*$-algebra \ca . This fact makes any poset a genuine `noncommutative' (`quantum') space, in the sense that the algebra of its `continuous functions' is a noncommutative C$^*$-algebra. We therefore also have a remarkable connection between finite approximations to quantum physics and noncommutative geometries. We use this connection to develop various approximation methods for doing quantum physics using \ca.Comment: 37 pages, 12 eps figures, uses psbox.tex To appear in J. Geom. and Physics, a problem due to the mailer hopefully solve

On a stronger reconstruction notion for monoids and clones

Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further give a characterization of automatic homeomorphicity for transformation monoids on arbitrary carriers with a dense group of invertibles having automatic homeomorphicity. We then show how to lift automatic action compatibility from groups to monoids and from monoids to clones under fairly weak assumptions. We finally employ these theorems to get automatic action compatibility results for monoids and clones over several well-known countable structures, including the strictly ordered rationals, the directed and undirected version of the random graph, the random tournament and bipartite graph, the generic strictly ordered set, and the directed and undirected versions of the universal homogeneous Henson graphs.Comment: 29 pp; Changes v1-->v2::typos corr.|L3.5+pf extended|Rem3.7 added|C. Pech found out that arg of L5.3-v1 solved Probl2-v1|L5.3, C5.4, Probl2 of v1 removed|C5.2, R5.4 new, contain parts of pf of L5.3-v1|L5.2-v1 is now L5.3,merged with concl of C5.4-v1,L5.3-v2 extends C5.4-v1|abstract, intro updated|ref[24] added|part of L5.3-v1 is L2.1(e)-v2, another part merged with pf of L5.2-v1 => L5.3-v