308 research outputs found
Baire reductions and good Borel reducibilities
In reference [8] we have considered a wide class of "well-behaved"
reducibilities for sets of reals. In this paper we continue with the study of
Borel reducibilities by proving a dichotomy theorem for the degree-structures
induced by good Borel reducibilities. This extends and improves the results of
[8] allowing to deal with a larger class of notions of reduction (including,
among others, the Baire class functions).Comment: 21 page
Total Representations
Almost all representations considered in computable analysis are partial. We
provide arguments in favor of total representations (by elements of the Baire
space). Total representations make the well known analogy between numberings
and representations closer, unify some terminology, simplify some technical
details, suggest interesting open questions and new invariants of topological
spaces relevant to computable analysis.Comment: 30 page
Advances and applications of automata on words and trees : abstracts collection
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 "Advances and Applications of Automata on Words and Trees" was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
Exact and Asymptotic Measures of Multipartite Pure State Entanglement
In an effort to simplify the classification of pure entangled states of multi
(m) -partite quantum systems, we study exactly and asymptotically (in n)
reversible transformations among n'th tensor powers of such states (ie n copies
of the state shared among the same m parties) under local quantum operations
and classical communication (LOCC). With regard to exact transformations, we
show that two states whose 1-party entropies agree are either locally-unitarily
(LU) equivalent or else LOCC-incomparable. In particular we show that two
tripartite Greenberger-Horne-Zeilinger (GHZ) states are LOCC-incomparable to
three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among
the three parties. Asymptotic transformations result in a simpler
classification than exact transformations. We show that m-partite pure states
having an m-way Schmidt decomposition are simply parameterizable, with the
partial entropy across any nontrivial partition representing the number of
standard ``Cat'' states (|0^m>+|1^m>) asymptotically interconvertible to the
state in question. For general m-partite states, partial entropies across
different partitions need not be equal, and since partial entropies are
conserved by asymptotically reversible LOCC operations, a multicomponent
entanglement measure is needed, with each scalar component representing a
different kind of entanglement, not asymptotically interconvertible to the
other kinds. In particular the m=4 Cat state is not isentropic to, and
therefore not asymptotically interconvertible to, any combination of bipartite
and tripartite states shared among the four parties. Thus, although the m=4 cat
state can be prepared from bipartite EPR states, the preparation process is
necessarily irreversible, and remains so even asymptotically.Comment: 13 pages including 3 PostScript figures. v3 has updated references
and discussion, to appear Phys. Rev.
Beyond Borel-amenability: scales and superamenable reducibilities
We analyze the degree-structure induced by large reducibilities under the
Axiom of Determinacy. This generalizes the analysis of Borel reducibilities
given in references [1], [6] and [5] e.g. to the projective levels.Comment: 13 page
Tabular degrees in \Ga-recursion theory
AbstractBailey, C. and R. Downey, Tabular degrees in \Ga-recursion theory, Annals of Pure and Applied Logic 55 (1992) 205–236.We introduce several generalizations of the truth-table and weak-truth-table reducibilities to \Ga-recursion theory. A number of examples are given of theorems that lift from \Gw-recursion theory, and of theorems that do not. In particular it is shown that the regular sets theorem fails and that not all natural generalizations of wtt are the same
- …