2,958 research outputs found

    Near-threshold high-order harmonic spectroscopy with aligned molecules

    Full text link
    We study high-order harmonic generation in aligned molecules close to the ionization threshold. Two distinct contributions to the harmonic signal are observed, which show very different responses to molecular alignment and ellipticity of the driving field. We perform a classical electron trajectory analysis, taking into account the significant influence of the Coulomb potential on the strong-field-driven electron dynamics. The two contributions are related to primary ionization and excitation processes, offering a deeper understanding of the origin of high harmonics near the ionization threshold. This work shows that high harmonic spectroscopy can be extended to the near-threshold spectral range, which is in general spectroscopically rich.Comment: 4 pages, 4 figure

    A quantum central limit theorem for non-equilibrium systems: Exact local relaxation of correlated states

    Full text link
    We prove that quantum many-body systems on a one-dimensional lattice locally relax to Gaussian states under non-equilibrium dynamics generated by a bosonic quadratic Hamiltonian. This is true for a large class of initial states - pure or mixed - which have to satisfy merely weak conditions concerning the decay of correlations. The considered setting is a proven instance of a situation where dynamically evolving closed quantum systems locally appear as if they had truly relaxed, to maximum entropy states for fixed second moments. This furthers the understanding of relaxation in suddenly quenched quantum many-body systems. The proof features a non-commutative central limit theorem for non-i.i.d. random variables, showing convergence to Gaussian characteristic functions, giving rise to trace-norm closeness. We briefly relate our findings to ideas of typicality and concentration of measure.Comment: 27 pages, final versio

    On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems

    Full text link
    We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of 14/15+ϵ14/15+\epsilon and 1/2+ϵ1/2+\epsilon. An OCSP is said to be approximation resistant if it is hard to approximate better than taking a uniformly random ordering. We prove that the Maximum Non-Betweenness Problem is approximation resistant and that there are width-mm approximation-resistant OCSPs accepting only a fraction 1/(m/2)!1 / (m/2)! of assignments. These results provide the first examples of approximation-resistant OCSPs subject only to P \neq \NP

    The Communication Cost of Simulating Bell Correlations

    Full text link
    What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, we show that exact simulation is possible using local hidden variables augmented by just one bit of classical communication. Certain quantum teleportation experiments, which teleport a single qubit, therefore admit a local hidden variables model.Comment: 4 pages, 2 figures; reference adde

    Impossibility of independence amplification in Kolmogorov complexity theory

    Full text link
    The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings xx and yy is dep(x,y)=max{C(x)C(xy),C(y)C(yx)}{\rm dep}(x,y) = \max\{C(x) - C(x \mid y), C(y) - C(y\mid x)\}, where C()C(\cdot) denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor ff such that, for any two nn-bit strings with complexity s(n)s(n) and dependency α(n)\alpha(n), it outputs a string of length s(n)s(n) with complexity s(n)α(n)s(n)- \alpha(n) conditioned by any one of the input strings. It is proven that the above are the optimal parameters a Kolmogorov extractor can achieve. It is shown that independence amplification cannot be effectively realized. Specifically, if (after excluding a trivial case) there exist computable functions f1f_1 and f2f_2 such that dep(f1(x,y),f2(x,y))β(n){\rm dep}(f_1(x,y), f_2(x,y)) \leq \beta(n) for all nn-bit strings xx and yy with dep(x,y)α(n){\rm dep}(x,y) \leq \alpha(n), then β(n)α(n)O(logn)\beta(n) \geq \alpha(n) - O(\log n)

    Taking reasonable pluralism seriously: an internal critique of political liberalism

    Get PDF
    The later Rawls attempts to offer a non-comprehensive, but nonetheless moral justification in political philosophy. Many critics of political liberalism doubt that this is successful, but Rawlsians often complain that such criticisms rely on the unwarranted assumption that one cannot offer a moral justification other than by taking a philosophically comprehensive route. In this article, I internally criticize the justification strategy employed by the later Rawls. I show that he cannot offer us good grounds for the rational hope that citizens will assign political values priority over non-political values in cases of conflict about political matters. I also suggest an alternative approach to justification in political philosophy (that is, a weak realist, Williams-inspired account) that better respects the later Rawls’s concern with non-comprehensiveness and pluralism than either his own view or more comprehensive approaches. Thus, if we take reasonable pluralism seriously, then we should adopt what Shklar aptly called ‘liberalism of fear’. </jats:p
    corecore