7 research outputs found

    A common algebraic description for probabilistic and quantum computations

    Get PDF
    AbstractThrough the study of gate arrays we develop a unified framework to deal with probabilistic and quantum computations, where the former is shown to be a natural special case of the latter. On this basis we show how to encode a probabilistic or quantum gate array into a sum-free tensor formula which satisfies the conditions of the partial trace problem, and vice-versa; that is, given a tensor formula F of order n×1 over a semiring S plus a positive integer k, deciding whether the kth partial trace of the matrix valSn,n(F·FT) fulfills a certain property. We use this to show that a certain promise version of the sum-free partial trace problem is complete for the class pr- BPP (promise BPP) for formulas over the semiring (Q+,+,·) of the positive rational numbers, for pr-BQP (promise BQP) in the case of formulas defined over the field (Q+,+,·), and if the promise is given up, then completeness for PP is shown, regardless whether tensor formulas over positive rationals or rationals in general are used. This suggests that the difference between probabilistic and quantum polytime computers may ultimately lie in the possibility, in the latter case, of having destructive interference between computations occurring in parallel. Moreover, by considering variants of this problem, classes like ⊕P, NP, C=P, its complement co-C=P, the promise version of Valiant's class UP, its generalization promise SPP, and unique polytime US can be characterized by carrying the problem properties and the underlying semiring

    Theory of semi-feasible algorithms

    No full text
    This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference

    Some Computational Problems Related to Pseudo-intents

    No full text
    Abstract. We investigate the computational complexity of several deci-sion, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a subset of its set of pseudo-intents, checking whether this context has an additional pseudo-intent is in conp, and it is at least as hard as checking whether a given simple hypergraph is not saturated. We also show that recognizing the set of pseudo-intents is also in conp, and it is at least as hard as identifying the minimal transver-sals of a given hypergraph. Moreover, we show that if any of these two problems turns out to be conp-hard, then unless p = np, pseudo-intents cannot be enumerated in output polynomial time. We also investigate the complexity of finding subsets of a given Duquenne-Guigues Base from which a given implication follows. We show that checking the existence of such a subset within a specified cardinality bound is np-complete, and counting all such minimal subsets is #p-complete.

    Centenarians and supercentenarians: a black swan. Emerging social, medical and surgical problems

    Get PDF
    <p>Abstract</p> <p>The Black Swan Theory was described by Nassim Nicholas Taleb in his book “The Black Swan”. This theory refers to “high-impact, hard-to-predict, and rare events beyond the realm of normal expectations”. According to Taleb’s criteria, a Black Swan Event is a surprise, it has a major impact and after the fact, the event is rationalized by hindsight, as if it had been expected. For most of human history centenarians were a rare and unpredictable phenomenon. The improvements of the social-environmental conditions, of medical care, and the quality of life caused a general improvement of the health status of the population and a consequent reduction of the overall morbidity and mortality, resulting in an overall increase of life expectancy. The study of centenarians and supercentenarians had the objective to consider this black swan and to evaluate the health, welfare, social and economic consequences of this phenomenon.</p
    corecore