10,265 research outputs found

    Hybridization, polyploidy, and evolutionary transitions between monoecy and dioecy in Bryonia (Cucurbitaceae)

    Get PDF
    Correns’s 1903 (Berichte der Deutschen Botanischen Gesellschaft 21: 133 – 147) crosses between a monoecious and a dioecious species of Bryonia revealed the simple Mendelian inheritance of dioecy and provided the first instance of an XY sex determination system in any organism. Bryonia ranges from the Canary Islands to Central Asia and comprises seven dioecious and three monoecious species; its closest relative, Ecballium elaterium, has dioecious and monoecious populations. We used chloroplast (cp) and nuclear (nr) gene phylogenies to infer sexual system evolution in Bryonia. We also tested for associations between sexual system and ploidy level, based on published and original chromosome counts. Conflicts between cp and nr topologies imply that the dioecious hexaploid B. cretica arose from hybridization(s), probably involving the dioecious diploids B. dioica, B. syriaca, and/or B. multiflora. A tetraploid dioecious endemic on Corsica and Sardinia probably originated from B. dioica via autopolyploidy. While the cp phylogeny resolves few species relationships, the nr tree implies at least two evolutionary changes in sexual system. There is no correlation between sexual system and ploidy level. Molecular clocks suggest that the deepest divergence, between a species on the Canary Islands and the ancestor of all remaining species, occurred ca. 10 million years ago

    Duality of privacy amplification against quantum adversaries and data compression with quantum side information

    Full text link
    We show that the tasks of privacy amplification against quantum adversaries and data compression with quantum side information are dual in the sense that the ability to perform one implies the ability to perform the other. These are two of the most important primitives in classical information theory, and are shown to be connected by complementarity and the uncertainty principle in the quantum setting. Applications include a new uncertainty principle formulated in terms of smooth min- and max-entropies, as well as new conditions for approximate quantum error correction.Comment: v2: Includes a derivation of an entropic uncertainty principle for smooth min- and max-entropies. Discussion of the Holevo-Schumacher-Westmoreland theorem remove

    Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing

    Full text link
    We derive a bound for the security of QKD with finite resources under one-way post-processing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols like Bennett-Brassard 1984 and six-states. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N\sim 10^5 signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates

    One-shot lossy quantum data compression

    Get PDF
    We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known expression for the entanglement-assisted quantum rate distortion function for asymptotically many copies of a memoryless quantum information source. Finally, we give a tight, finite blocklength characterization for the entanglement-assisted minimum qubit compression size of a memoryless isotropic qubit source subject to an average symbol-wise distortion constraint.Comment: 36 page

    Noisy channel coding via privacy amplification and information reconciliation

    Full text link
    We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic tools: privacy amplification and information reconciliation, also known as data compression with side information. We do this in the one-shot scenario of structureless resources, and formulate our results in terms of the smooth min- and max-entropy. In the context of classical information theory, this shows that essentially all two-terminal protocols can be reduced to these two primitives, which are in turn governed by the smooth min- and max-entropies, respectively. In the context of quantum information theory, the recently-established duality of these two protocols means essentially all two-terminal protocols can be constructed using just a single primitive.Comment: 8 pages, 2 figures. v2: final version for publicatio

    Locking of accessible information and implications for the security of quantum cryptography

    Full text link
    The unconditional security of a quantum key distribution protocol is often defined in terms of the accessible information, that is, the maximum mutual information between the distributed key S and the outcome of an optimal measurement on the adversary's (quantum) system. We show that, even if this quantity is small, certain parts of the key S might still be completely insecure when S is used in applications, such as for one-time pad encryption. This flaw is due to a locking property of the accessible information: one additional (physical) bit of information might increase the accessible information by more than one bit.Comment: 5 pages; minor change

    Device for in-situ cleaving of hard crystals

    Get PDF
    Cleaving crystals in a vacuum chamber is a simple method for obtaining atomically flat and clean surfaces for materials that have a preferential cleaving plane. Most in-situ cleavers use parallel cutting edges that are applied from two sides on the sample. We found in ambient experiments that diagonal cutting pliers, where the cleavage force is introduced in a single point instead of a line work very well also for hard materials. Here, we incorporate the diagonal cutting plier principle in a design compatible with ultra-high vacuum requirements. We show optical microscopy (mm scale) and atomic force microscopy (atomic scale) images of NiO(001) surfaces cleaved with this device.Comment: 7 pages, 3 figures Submitted to Review of Scientific Instruments (2005
    corecore