410 research outputs found

    The fundamental limit on the rate of quantum dynamics: the unified bound is tight

    Full text link
    The question of how fast a quantum state can evolve has attracted a considerable attention in connection with quantum measurement, metrology, and information processing. Since only orthogonal states can be unambiguously distinguished, a transition from a state to an orthogonal one can be taken as the elementary step of a computational process. Therefore, such a transition can be interpreted as the operation of "flipping a qubit", and the number of orthogonal states visited by the system per unit time can be viewed as the maximum rate of operation. A lower bound on the orthogonalization time, based on the energy spread DeltaE, was found by Mandelstam and Tamm. Another bound, based on the average energy E, was established by Margolus and Levitin. The bounds coincide, and can be exactly attained by certain initial states if DeltaE=E; however, the problem remained open of what the situation is otherwise. Here we consider the unified bound that takes into account both DeltaE and E. We prove that there exist no initial states that saturate the bound if DeltaE is not equal to E. However, the bound remains tight: for any given values of DeltaE and E, there exists a one-parameter family of initial states that can approach the bound arbitrarily close when the parameter approaches its limit value. The relation between the largest energy level, the average energy, and the orthogonalization time is also discussed. These results establish the fundamental quantum limit on the rate of operation of any information-processing system.Comment: 4 pages 1 PS figure Late

    Thermodynamic cost of reversible computing

    Full text link
    Since reversible computing requires preservation of all information throughout the entire computational process, this implies that all errors that appear as a result of the interaction of the information-carrying system with uncontrolled degrees of freedom must be corrected. But this can only be done at the expense of an increase in the entropy of the environment corresponding to the dissipation, in the form of heat, of the ``noisy'' part of the system's energy. This paper gives an expression of that energy in terms of the effective noise temperature, and analyzes the relationship between the energy dissipation rate and the rate of computation. Finally, a generalized Clausius principle based on the concept of effective temperature is presented.Comment: 5 pages; added two paragraphs and fixed a number of typo

    Distributed super dense coding over noisy channels

    Full text link
    We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly determined

    Distillation protocols: Output entanglement and local mutual information

    Get PDF
    A complementary behavior between local mutual information and average output entanglement is derived for arbitrary bipartite ensembles. This leads to bounds on the yield of entanglement in distillation protocols that involve disinguishing. This bound is saturated in the hashing protocol for distillation, for Bell-diagonal states.Comment: 4 pages, RevTeX, no figures; v2: presentation improved, results unchanged; v3: published versio

    On 1-qubit channels

    Get PDF
    The entropy H_T(rho) of a state rho with respect to a channel T and the Holevo capacity of the channel require the solution of difficult variational problems. For a class of 1-qubit channels, which contains all the extremal ones, the problem can be significantly simplified by associating an Hermitian antilinear operator theta to every channel of the considered class. The concurrence of the channel can be expressed by theta and turns out to be a flat roof. This allows to write down an explicit expression for H_T. Its maximum would give the Holevo (1-shot) capacity.Comment: 12 pages, several printing or latex errors correcte

    Nonorthogonal Quantum States Maximize Classical Information Capacity

    Get PDF
    I demonstrate that, rather unexpectedly, there exist noisy quantum channels for which the optimal classical information transmission rate is achieved only by signaling alphabets consisting of nonorthogonal quantum states.Comment: 5 pages, REVTeX, mild extension of results, much improved presentation, to appear in Physical Review Letter

    Practical quantum key distribution: On the security evaluation with inefficient single-photon detectors

    Full text link
    Quantum Key Distribution with the BB84 protocol has been shown to be unconditionally secure even using weak coherent pulses instead of single-photon signals. The distances that can be covered by these methods are limited due to the loss in the quantum channel (e.g. loss in the optical fiber) and in the single-photon counters of the receivers. One can argue that the loss in the detectors cannot be changed by an eavesdropper in order to increase the covered distance. Here we show that the security analysis of this scenario is not as easy as is commonly assumed, since already two-photon processes allow eavesdropping strategies that outperform the known photon-number splitting attack. For this reason there is, so far, no satisfactory security analysis available in the framework of individual attacks.Comment: 11 pages, 6 figures; Abstract and introduction extended, Appendix added, references update

    Experimental Demonstration of Post-Selection based Continuous Variable Quantum Key Distribution in the Presence of Gaussian Noise

    Full text link
    In realistic continuous variable quantum key distribution protocols, an eavesdropper may exploit the additional Gaussian noise generated during transmission to mask her presence. We present a theoretical framework for a post-selection based protocol which explicitly takes into account excess Gaussian noise. We derive a quantitative expression of the secret key rates based on the Levitin and Holevo bounds. We experimentally demonstrate that the post-selection based scheme is still secure against both individual and collective Gaussian attacks in the presence of this excess noise.Comment: 4 pages, 4 figure
    • …
    corecore