12,844 research outputs found

    Structure functions near the chiral limit

    Full text link
    We compute hadron masses and the lowest moments of unpolarized and polarized nucleon structure functions down to pion masses of 300 MeV, in an effort to make unambiguous predictions at the physical light quark mass.Comment: 3 pages, 3 figures, Lattice2002(matrixel

    Bell's inequality tests: from photons to B-mesons

    Full text link
    We analyse the recent claim that a violation of a Bell's inequality has been observed in the BB--meson system [A. Go, {\em Journal of Modern Optics} {\bf 51} (2004) 991]. The results of this experiment are a convincing proof of quantum entanglement in BB--meson pairs similar to that shown by polarization entangled photon pairs. However, we conclude that the tested inequality is not a genuine Bell's inequality and thus cannot discriminate between quantum mechanics and local realistic approaches.Comment: 5 page

    Individual differences and cognitive load

    Get PDF

    Quantum circuit for security proof of quantum key distribution without encryption of error syndrome and noisy processing

    Full text link
    One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.Comment: 8 pages, 2 figures. Typo correcte

    New selection rules for resonant Raman scattering on quantum wires

    Full text link
    The bosonisation technique is used to calculate the resonant Raman spectrum of a quantum wire with two electronic sub-bands occupied. Close to resonance, the cross section at frequencies in the region of the inter sub-band transitions shows distinct peaks in parallel polarisation of the incident and scattered light that are signature of collective higher order spin density excitations. This is in striking contrast to the conventional selection rule for non-resonant Raman scattering according to which spin modes can appear only in perpendicular polarisation. We predict a new selection rule for the excitations observed near resonance, namely that, apart from charge density excitations, only spin modes with positive group velocities can appear as peaks in the spectra in parallel configuration close to resonance. The results are consistent with all of the presently available experimental data.Comment: 7 pages, 2 figure

    A non-perturbative determination of Z_V and b_V for O(a) improved quenched and unquenched Wilson fermions

    Get PDF
    By considering the local vector current between nucleon states and imposing charge conservation we determine, for O(a)O(a) improved Wilson fermions, its renormalisation constant and quark mass improvement coefficient. The computation is performed for both quenched and two flavour unquenched fermions.Comment: 3 pages, 4 figures, Lattice(2002)(improve

    Noisy Monte Carlo: Convergence of Markov chains with approximate transition kernels

    Get PDF
    Monte Carlo algorithms often aim to draw from a distribution π\pi by simulating a Markov chain with transition kernel PP such that π\pi is invariant under PP. However, there are many situations for which it is impractical or impossible to draw from the transition kernel PP. For instance, this is the case with massive datasets, where is it prohibitively expensive to calculate the likelihood and is also the case for intractable likelihood models arising from, for example, Gibbs random fields, such as those found in spatial statistics and network analysis. A natural approach in these cases is to replace PP by an approximation P^\hat{P}. Using theory from the stability of Markov chains we explore a variety of situations where it is possible to quantify how 'close' the chain given by the transition kernel P^\hat{P} is to the chain given by PP. We apply these results to several examples from spatial statistics and network analysis.Comment: This version: results extended to non-uniformly ergodic Markov chain

    International Lattice Data Grid

    Get PDF
    We propose the co-ordination of lattice QCD grid developments in different countries to allow transparent exchange of gauge configurations in future, should participants wish to do so. We describe briefly UKQCD's XML schema for labelling and cataloguing the data. A meeting to further develop these ideas will be held in Edinburgh on 19/20 December 2002, and will be available over AccessGrid.Comment: Lattice2002(plenary

    Sampling constrained probability distributions using Spherical Augmentation

    Full text link
    Statistical models with constrained probability distributions are abundant in machine learning. Some examples include regression models with norm constraints (e.g., Lasso), probit, many copula models, and latent Dirichlet allocation (LDA). Bayesian inference involving probability distributions confined to constrained domains could be quite challenging for commonly used sampling algorithms. In this paper, we propose a novel augmentation technique that handles a wide range of constraints by mapping the constrained domain to a sphere in the augmented space. By moving freely on the surface of this sphere, sampling algorithms handle constraints implicitly and generate proposals that remain within boundaries when mapped back to the original space. Our proposed method, called {Spherical Augmentation}, provides a mathematically natural and computationally efficient framework for sampling from constrained probability distributions. We show the advantages of our method over state-of-the-art sampling algorithms, such as exact Hamiltonian Monte Carlo, using several examples including truncated Gaussian distributions, Bayesian Lasso, Bayesian bridge regression, reconstruction of quantized stationary Gaussian process, and LDA for topic modeling.Comment: 41 pages, 13 figure

    Dynamical chaos and power spectra in toy models of heteropolymers and proteins

    Full text link
    The dynamical chaos in Lennard-Jones toy models of heteropolymers is studied by molecular dynamics simulations. It is shown that two nearby trajectories quickly diverge from each other if the heteropolymer corresponds to a random sequence. For good folders, on the other hand, two nearby trajectories may initially move apart but eventually they come together. Thus good folders are intrinsically non-chaotic. A choice of a distance of the initial conformation from the native state affects the way in which a separation between the twin trajectories behaves in time. This observation allows one to determine the size of a folding funnel in good folders. We study the energy landscapes of the toy models by determining the power spectra and fractal characteristics of the dependence of the potential energy on time. For good folders, folding and unfolding trajectories have distinctly different correlated behaviors at low frequencies.Comment: 8 pages, 9 EPS figures, Phys. Rev. E (in press
    corecore