340 research outputs found

    Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels

    Full text link
    We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede's dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity. These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In he final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.Comment: 49 pages, no figures, final version of our papers arXiv:1010.0418v2 and arXiv:1010.0418. Published "Online First" in Communications in Mathematical Physics, 201

    The invalidity of a strong capacity for a quantum channel with memory

    Get PDF
    The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both the direct part of the channel coding theorem and the strong converse for the channel. Here we consider the strong converse theorem for the periodic quantum channel and show some rather surprising results. We first show that the strong converse does not hold in general for this channel and therefore the channel does not have a strong capacity. Instead, we find that there is a scale of capacities corresponding to error probabilities between integer multiples of the inverse of the periodicity of the channel. A similar scale also exists for the random channel.Comment: 7 pages, double column. Comments welcome. Repeated equation removed and one reference adde

    Cryogenic scanning force microscopy of quantum Hall samples: Adiabatic transport originating in anisotropic depletion at contact interfaces

    Full text link
    Anisotropic magneto resistances and intrinsic adiabatic transport features are generated on quantum Hall samples based on an (Al,Ga)As/GaAs heterostructure with alloyed Au/Ge/Ni contacts. We succeed to probe the microscopic origin of these transport features with a cryogenic scanning force microscope (SFM) by measuring the local potential distribution within the two-dimensional electron system (2DES). These local measurements reveal the presence of an incompressible strip in front of contacts with insulating properties depending on the orientation of the contact/2DES interface line relatively to the crystal axes of the heterostructure. Such an observation gives another microscopic meaning to the term 'non-ideal contact' used in context with the Landauer-B\"uttiker formalism applied to the quantum Hall effect.Comment: 5 pages, 4 figure

    Secrecy Results for Compound Wiretap Channels

    Full text link
    We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterion, and with a decoder that is robust against the effect of randomisation in the encoding. This relieves us from the need of decoding the randomisation parameter which is in general not possible within this model. Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information and derive a multi-letter expression for the capacity in this communication scenario.Comment: 25 pages, 1 figure. Accepted for publication in the journal "Problems of Information Transmission". Some of the results were presented at the ITW 2011 Paraty [arXiv:1103.0135] and published in the conference paper available at the IEEE Xplor

    Investigations on unconventional aspects in the quantum Hall regime of narrow gate defined channels

    Full text link
    We report on theoretical and experimental investigations of the integer quantized Hall effect in narrow channels at various mobilities. The Hall bars are defined electrostatically in two-dimensional electron systems by biasing metal gates on the surfaces of GaAs/AlGaAs heterostructures. In the low mobility regime the classical Hall resistance line is proportional to the magnetic field as measured in the high temperature limit and cuts through the center of each Hall plateau. For high mobility samples we observe in linear response measurements, that this symmetry is broken and the classical Hall line cuts the plateaus not at the center but at higher magnetic fields near the edges of the plateaus. These experimental results confirm the unconventional predictions of a model for the quantum Hall effect taking into account mutual screening of charge carriers within the Hall bar. The theory is based on solving the Poisson and Schr\"odinger equations in a self-consistent manner.Comment: EP2DS-17 Proceedings, 6 Pages, 2 Figure

    Realistic modelling of quantum point contacts subject to high magnetic fields and with current bias at out of linear response regime

    Full text link
    The electron and current density distributions in the close proximity of quantum point contacts (QPCs) are investigated. A three dimensional Poisson equation is solved self-consistently to obtain the electron density and potential profile in the absence of an external magnetic field for gate and etching defined devices. We observe the surface charges and their apparent effect on the confinement potential, when considering the (deeply) etched QPCs. In the presence of an external magnetic field, we investigate the formation of the incompressible strips and their influence on the current distribution both in the linear response and out of linear response regime. A spatial asymmetry of the current carrying incompressible strips, induced by the large source drain voltages, is reported for such devices in the non-linear regime.Comment: 16 Pages, 9 Figures, submitted to PR

    Incompressible strips in dissipative Hall bars as origin of quantized Hall plateaus

    Full text link
    We study the current and charge distribution in a two dimensional electron system, under the conditions of the integer quantized Hall effect, on the basis of a quasi-local transport model, that includes non-linear screening effects on the conductivity via the self-consistently calculated density profile. The existence of ``incompressible strips'' with integer Landau level filling factor is investigated within a Hartree-type approximation, and non-local effects on the conductivity along those strips are simulated by a suitable averaging procedure. This allows us to calculate the Hall and the longitudinal resistance as continuous functions of the magnetic field B, with plateaus of finite widths and the well-known, exactly quantized values. We emphasize the close relation between these plateaus and the existence of incompressible strips, and we show that for B values within these plateaus the potential variation across the Hall bar is very different from that for B values between adjacent plateaus, in agreement with recent experiments.Comment: 13 pages, 11 figures, All color onlin

    Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model

    Full text link
    Two robots stand at the origin of the infinite line and are tasked with searching collaboratively for an exit at an unknown location on the line. They can travel at maximum speed bb and can change speed or direction at any time. The two robots can communicate with each other at any distance and at any time. The task is completed when the last robot arrives at the exit and evacuates. We study time-energy tradeoffs for the above evacuation problem. The evacuation time is the time it takes the last robot to reach the exit. The energy it takes for a robot to travel a distance xx at speed ss is measured as xs2xs^2. The total and makespan evacuation energies are respectively the sum and maximum of the energy consumption of the two robots while executing the evacuation algorithm. Assuming that the maximum speed is bb, and the evacuation time is at most cdcd, where dd is the distance of the exit from the origin, we study the problem of minimizing the total energy consumption of the robots. We prove that the problem is solvable only for bc3bc \geq 3. For the case bc=3bc=3, we give an optimal algorithm, and give upper bounds on the energy for the case bc>3bc>3. We also consider the problem of minimizing the evacuation time when the available energy is bounded by Δ\Delta. Surprisingly, when Δ\Delta is a constant, independent of the distance dd of the exit from the origin, we prove that evacuation is possible in time O(d3/2logd)O(d^{3/2}\log d), and this is optimal up to a logarithmic factor. When Δ\Delta is linear in dd, we give upper bounds on the evacuation time.Comment: This is the full version of the paper with the same title which will appear in the proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO'19) L'Aquila, Italy during July 1-4, 201

    Structural Routability of n-Pairs Information Networks

    Full text link
    Information does not generally behave like a conservative fluid flow in communication networks with multiple sources and sinks. However, it is often conceptually and practically useful to be able to associate separate data streams with each source-sink pair, with only routing and no coding performed at the network nodes. This raises the question of whether there is a nontrivial class of network topologies for which achievability is always equivalent to routability, for any combination of source signals and positive channel capacities. This chapter considers possibly cyclic, directed, errorless networks with n source-sink pairs and mutually independent source signals. The concept of downward dominance is introduced and it is shown that, if the network topology is downward dominated, then the achievability of a given combination of source signals and channel capacities implies the existence of a feasible multicommodity flow.Comment: The final publication is available at link.springer.com http://link.springer.com/chapter/10.1007/978-3-319-02150-8_
    corecore