9,188 research outputs found

    Stronger uncertainty relations with improvable upper and lower bounds

    Full text link
    We utilize quantum superposition principle to establish the improvable upper and lower bounds on the stronger uncertainty relation, i.e., the "weighted-like" sum of the variances of observables. Our bounds include some free parameters which not only guarantee the nontrivial bounds but also can effectively control the bounds as tightly as one expects. Especially, these parameters don't obviously depend on the state and observables. It also implies one advantage of our method that any nontrivial bound can always be more improvable. In addition, we generalize both bounds to the uncertainty relation with multiple observables, but the perfect tightness is not changed. Examples are given to illustrate the improvability of our bounds in each case.Comment: 11 pages, and 2 figure

    Photon statistics on the extreme entanglement

    Full text link
    The effects of photon bunching and antibunching correspond to the classical and quantum features of the electromagnetic field, respectively. No direct evidence suggests whether these effects can be potentially related to quantum entanglement. Here we design a cavity quantum electrodynamics model with two atoms trapped in to demonstrate the connections between the steady-state photon statistics and the two-atom entanglement . It is found that within the weak dissipations and to some good approximation, the local maximal two-atom entanglements perfectly correspond to not only the quantum feature of the electromagnetic field---the optimal photon antibunching, but also the classical feature---the optimal photon bunching. We also analyze the influence of strong dissipations and pure dephasing. An intuitive physical understanding is also given finally.Comment: 12 pages, 4 figure

    Optimal Photon blockade on the maximal atomic coherence

    Full text link
    There is generally no obvious evidence in any direct relation between photon blockade and atomic coherence. Here instead of only illustrating the photon statistics, we show an interesting relation between the steady-state photon blockade and the atomic coherence by designing a weakly driven cavity QED system with a two-level atom trapped. It is shown for the first time that the maximal atomic coherence has a perfect correspondence with the optimal photon blockade. The negative effects of the strong dissipations on photon statistics, atomic coherence and their correspondence are also addressed. The numerical simulation is also given to support all of our results.Comment: 7 pages, 4 figure

    Entropic Uncertainty Principle and Information Exclusion Principle for multiple measurements in the presence of quantum memory

    Full text link
    The Heisenberg uncertainty principle shows that no one can specify the values of the non-commuting canonically conjugated variables simultaneously. However, the uncertainty relation is usually applied to two incompatible measurements. We present tighter bounds on both entropic uncertainty relation and information exclusion principle for multiple measurements in the presence of quantum memory. As applications, three incompatible measurements on Werner state and Horodecki's bound entangled state are investigated in details.Comment: 17 pages, 4 figure

    The Measurement-Disturbance Relation and the Disturbance Trade-off Relation in Terms of Relative Entropy

    Full text link
    We employ quantum relative entropy to establish the relation between the measurement uncertainty and its disturbance on a state in the presence (and absence) of quantum memory. For two incompatible observables, we present the measurement-disturbance relation and the disturbance trade-off relation. We find that without quantum memory the disturbance induced by the measurement is never less than the measurement uncertainty and with quantum memory they depend on the conditional entropy of the measured state. We also generalize these relations to the case with multiple measurements. These relations are demonstrated by two examples.Comment: 6 pages, 4 figure

    Proportional Fairness in Multi-channel Multi-rate Wireless Networks-Part I: The Case of Deterministic Channels

    Full text link
    This is Part I of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part I are threefold. (i) First, we lay down the theoretical foundation for PF. Specifically, we present the fundamental properties and physical/economic interpretation of PF. We show by general mathematical arguments that PF leads to equal airtime allocation to users for the single-channel case; and equal equivalent airtime allocation to users for the multi-channel case, where the equivalent airtime enjoyed by a user is a weighted sum of the airtimes enjoyed by the user on all channels, with the weight of a channel being the price or value of that channel. We also establish the Pareto efficiency of PF solutions. (ii) Second, we derive characteristics of PF solutions that are useful for the construction of PF-optimization algorithms. We present several PF-optimization algorithms, including a fast algorithm that is amenable to parallel implementation. (iii) Third, we study the use of PF utility for capacity allocation in large-scale WiFi networks consisting of many adjacent wireless LANs. We find that the PF solution simultaneously achieves higher system throughput, better fairness, and lower outage probability with respect to the default solution given by today's 802.11 commercial products. Part II of this paper series extends our investigation to the time-varying-channel case in which the data rates enjoyed by users over the channels vary dynamically over tim

    Optomechanically induced transparency in multi-cavity optomechanical system with and without one two-level atom

    Full text link
    We analytically study the optomechanically induced transparency (OMIT) in the NN-cavity system with the \textit{N}th cavity driven by pump, probing laser fields and the \textit{1}st cavity coupled to mechanical oscillator. We also consider that one atom could be trapped in the \textit{i}th cavity. Instead of only illustrating the OMIT in such a system, we are interested in how the number of OMIT windows is influenced by the cavities and the atom and what roles the atom could play in different cavities. In the resolved sideband regime, we find that, the number of cavities precisely determines the maximal number of OMIT windows. It is interesting that, when the two-level atom is trapped in the even-labeled cavity, the central absorptive peak (odd NN) or dip (even NN) is split and forms an extra OMIT window, but if the atom is trapped in the odd-labeled cavity, the central absorptive peak (odd NN) or dip (even NN) is only broadened and thus changes the width of the OMIT windows rather than induces an extra window.Comment: 10 pages, 4 figure

    Is the Radial Profile of the Phase-Space Density of Dark Matter Halos a Power-Law?

    Full text link
    The latest cosmological N-body simulations find two intriguing properties for dark matter haloes: (1) their radial density profile, rho, is better fit by a form that flattens to a constant at the halo center (the Einasto profile) than the widely-used NFW form; (2) the radial profile of the pseudo-phase-space density, rho/sigma3, on the other hand, continues to be well fit by a power law, as seen in earlier lower-resolution simulations. In this paper we use the Jeans equation to argue that (1) and (2) cannot both be true at all radii. We examine the implied radial dependence of rho/sigma3 over 12 orders of magnitude in radius by solving the Jeans equation for a broad range of input rho and velocity anisotropy beta. Independent of beta, we find that rho/sigma3 is approximately a power law only over the limited range of halo radius resolvable by current simulations (down to ~0.1% of the virial radius), and rho/sigma3 deviates significantly from a power-law below this scale for both the Einasto and NFW rho. The same conclusion also applies to a more general density-velocity relation rho/sigma_D^epsilon. Conversely, when we enforce rho/sigma^3 r^{-eta} as an input, none of the physically allowed rho (occurring for the narrow range 1.8<eta<1.9444) follows the Einasto form. We expect the next generation simulations with better spatial resolution to settle the debate: either the Einasto profile will continue to hold and rho/sigma3 will deviate from a power law, or rho/sigma3 will continue as a power law and rho will deviate from its current parameterizations.Comment: 6 pages, 4 figure

    Distributed Triangle Detection via Expander Decomposition

    Full text link
    We present improved distributed algorithms for triangle detection and its variants in the CONGEST model. We show that Triangle Detection, Counting, and Enumeration can be solved in O~(n1/2)\tilde{O}(n^{1/2}) rounds. In contrast, the previous state-of-the-art bounds for Triangle Detection and Enumeration were O~(n2/3)\tilde{O}(n^{2/3}) and O~(n3/4)\tilde{O}(n^{3/4}), respectively, due to Izumi and LeGall (PODC 2017). The main technical novelty in this work is a distributed graph partitioning algorithm. We show that in O~(n1δ)\tilde{O}(n^{1-\delta}) rounds we can partition the edge set of the network G=(V,E)G=(V,E) into three parts E=EmEsErE=E_m\cup E_s\cup E_r such that (a) Each connected component induced by EmE_m has minimum degree Ω(nδ)\Omega(n^\delta) and conductance Ω(1/polylog(n))\Omega(1/\text{poly} \log(n)). As a consequence the mixing time of a random walk within the component is O(polylog(n))O(\text{poly} \log(n)). (b) The subgraph induced by EsE_s has arboricity at most nδn^{\delta}. (c) ErE/6|E_r| \leq |E|/6. All of our algorithms are based on the following generic framework, which we believe is of interest beyond this work. Roughly, we deal with the set EsE_s by an algorithm that is efficient for low-arboricity graphs, and deal with the set ErE_r using recursive calls. For each connected component induced by EmE_m, we are able to simulate congested clique algorithms with small overhead by applying a routing algorithm due to Ghaffari, Kuhn, and Su (PODC 2017) for high conductance graphs

    Quantum Dissonance Is Rejected in an Overlap Measurement Scheme

    Full text link
    The overlap measurement scheme accomplishes to evaluate the overlap of two input quantum states by only measuring an introduced auxiliary qubit, irrespective of the complexity of the two input states. We find a counterintuitive phenomenon that no quantum dissonance can be found, even though the auxiliary qubit might be entangled, classically correlated or even uncorrelated with the two input states based on different types of input states. In principle, this provides an opposite but supplementary example to the remarkable algorithm of the deterministic quantum computation with one qubit in which no entanglement is present. Finally, we consider a simple overlap measurement model to demonstrate the continuous change (including potential sudden death of quantum discord) with the input states from entangled to product states by only adjusting some simple initial parameters.Comment: 5pages and 3 figures,To appear in PR
    corecore