62 research outputs found
Low-dimensional quite noisy bound entanglement with cryptographic key
We provide a class of bound entangled states that have positive distillable
secure key rate. The smallest state of this kind is 4 \bigotimes 4. Our class
is a generalization of the class presented in [1] (IEEE Trans. Inf. Theory 54,
2621 (2008); arXiv:quant-ph/0506203). It is much wider, containing, in
particular, states from the boundary of PPT entangled states (all of the states
in the class in [1] were of this kind) but also states inside the set of PPT
entangled states, even, approaching the separable states. This generalization
comes with a price: for the wider class a positive key rate requires, in
general, apart from the one-way Devetak-Winter protocol (used in [1]) also the
recurrence preprocessing and thus effectively is a two-way protocol. We also
analyze the amount of noise that can be admixtured to the states of our class
without losing key distillability property which may be crucial for
experimental realization. The wider class contains key-distillable states with
higher entropy (up to 3.524, as opposed to 2.564 for the class in [1]).Comment: 10 pages, final version for J. Phys. A: Math. Theo
Characterizing Operations Preserving Separability Measures via Linear Preserver Problems
We use classical results from the theory of linear preserver problems to
characterize operators that send the set of pure states with Schmidt rank no
greater than k back into itself, extending known results characterizing
operators that send separable pure states to separable pure states. We also
provide a new proof of an analogous statement in the multipartite setting. We
use these results to develop a bipartite version of a classical result about
the structure of maps that preserve rank-1 operators and then characterize the
isometries for two families of norms that have recently been studied in quantum
information theory. We see in particular that for k at least 2 the operator
norms induced by states with Schmidt rank k are invariant only under local
unitaries, the swap operator and the transpose map. However, in the k = 1 case
there is an additional isometry: the partial transpose map.Comment: 16 pages, typos corrected, references added, proof of Theorem 4.3
simplified and clarifie
Private quantum decoupling and secure disposal of information
Given a bipartite system, correlations between its subsystems can be
understood as information that each one carries about the other. In order to
give a model-independent description of secure information disposal, we propose
the paradigm of private quantum decoupling, corresponding to locally reducing
correlations in a given bipartite quantum state without transferring them to
the environment. In this framework, the concept of private local randomness
naturally arises as a resource, and total correlations get divided into
eliminable and ineliminable ones. We prove upper and lower bounds on the amount
of ineliminable correlations present in an arbitrary bipartite state, and show
that, in tripartite pure states, ineliminable correlations satisfy a monogamy
constraint, making apparent their quantum nature. A relation with entanglement
theory is provided by showing that ineliminable correlations constitute an
entanglement parameter. In the limit of infinitely many copies of the initial
state provided, we compute the regularized ineliminable correlations to be
measured by the coherent information, which is thus equipped with a new
operational interpretation. In particular, our results imply that two
subsystems can be privately decoupled if their joint state is separable.Comment: Child of 0807.3594 v2: minor changes v3: presentation improved, one
figure added v4: extended version with a lot of discussions and examples v5:
published versio
COVIDiSTRESS Global Survey dataset on psychological and behavioural consequences of the COVID-19 outbreak
This N = 173,426 social science dataset was collected through the collaborative COVIDiSTRESS Global Survey – an open science effort to improve understanding of the human experiences of the 2020 COVID-19 pandemic between 30th March and 30th May, 2020. The dataset allows a cross-cultural study of psychological and behavioural responses to the Coronavirus pandemic and associated government measures like cancellation of public functions and stay at home orders implemented in many countries. The dataset contains demographic background variables as well as measures of Asian Disease Problem, perceived stress (PSS-10), availability of social provisions (SPS-10), trust in various authorities, trust in governmental measures to contain the virus (OECD trust), personality traits (BFF-15), information behaviours, agreement with the level of government intervention, and compliance with preventive measures, along with a rich pool of exploratory variables and written experiences. A global consortium from 39 countries and regions worked together to build and translate a survey with variables of shared interests, and recruited participants in 47 languages and dialects. Raw plus cleaned data and dynamic visualizations are available
Transformation of XML data using an unranked tree transducer
Transformation of data documents is of special importance to use XML as the universal data interchange format on the Web. Data transformation is used in many tasks that require data to be transferred between existing, independently created Web-oriented applications. To perform such transformation one can use W3C's XSLT or XQuery. But these languages are devoted to detailed programming of transformation procedures. In this paper we show how data transformation can by specify by means of high-level rule specifications based on uniform unranked tree transducers. We show that our approach is both descriptive and expressive, and we illustrate how it can be used to specify and perform transformations of XML documents
Schema mappings and annotations in semantic integration of XML data in P2P data integration systems
In the paper we discuss the problem of XML data integration in a P2P environment. In this setting each peer stores schema of its local data, mappings between the schema and schemas of some other peers (peer's partners), and schema constraints. The goal of the integration is to answer the queries formulated against arbitrarily chosen peers. The answer consists of data stored in the queried peer as well as data of its direct and indirect partners. We focus on denning and using mappings, schema constraints, and query reformulation in such scenario. We discuss a strategy that allows us to obtain a complete answer with the possibility of discovering missing values. The method is the theoretical foundation of the implementation of SixP2P system (Semantic Integration of XML data in P2P environment)
- …