113 research outputs found

    Analysis of New Hampshire Pregnancy Risk Assessment Monitoring System (PRAMS) to Better Understand Breastfeeding Initiation and Duration by Industry Category

    Get PDF
    This supplemental report provides additional information on breastfeeding initiation and duration, and a woman’s job category (industry) as reported to the NH Division of Vital Records Administration via the NH birth certificate. De-identified responses in the NH birth certificate data linked to the responses in the Pregnancy Risk Assessment Monitoring System (PRAMS) survey data provided the opportunity to better understand duration of breastfeeding by a woman’s industry. The findings may be useful to policymakers and employers when framed in terms of the health and economic benefits of breastfeeding to inform workplace policy formation

    Exponential speed-up with a single bit of quantum information: Testing the quantum butterfly effect

    Full text link
    We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so for those maps admitting an efficient gate decomposition, it provides an exponential speed up over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of quantum chaos. Our result also illustrates the role of chaos in the process of decoherence.Comment: 4 pages, 2 eps figure

    Statistical comparison of ensemble implementations of Grover's search algorithm to classical sequential searches

    Full text link
    We compare pseudopure state ensemble implementations, quantified by their initial polarization and ensemble size, of Grover's search algorithm to probabilistic classical sequential search algorithms in terms of their success and failure probabilities. We propose a criterion for quantifying the resources used by the ensemble implementation via the aggregate number of oracle invocations across the entire ensemble and use this as a basis for comparison with classical search algorithms. We determine bounds for a critical polarization such that the ensemble algorithm succeeds with a greater probability than the probabilistic classical sequential search. Our results indicate that the critical polarization scales as N^(-1/4) where N is the database size and that for typical room temperature solution state NMR, the polarization is such that the ensemble implementation of Grover's algorithm would be advantageous for N > 10^2

    What is a Plan of Safe Care? An Introduction to Best Practices in New Hampshire

    Get PDF

    Violence Against Men in New Hampshire

    Get PDF

    Fidelity enhancement by logical qubit encoding

    Full text link
    We demonstrate coherent control of two logical qubits encoded in a decoherence free subspace (DFS) of four dipolar-coupled protons in an NMR quantum information processor. A pseudo-pure fiducial state is created in the DFS, and a unitary logical qubit entangling operator evolves the system to a logical Bell state. The four-spin molecule is partially aligned by a liquid crystal solvent, which introduces strong dipolar couplings among the spins. Although the system Hamiltonian is never fully specified, we demonstrate high fidelity control over the logical degrees of freedom. In fact, the DFS encoding leads to higher fidelity control than is available in the full four-spin Hilbert space.Comment: 10 pages, 2 figure

    Polarization Requirements for Ensemble Implementations of Quantum Algorithms with a Single Bit Output

    Full text link
    We compare the failure probabilities of ensemble implementations of quantum algorithms which use pseudo-pure initial states, quantified by their polarization, to those of competing classical probabilistic algorithms. Specifically we consider a class algorithms which require only one bit to output the solution to problems. For large ensemble sizes, we present a general scheme to determine a critical polarization beneath which the quantum algorithm fails with greater probability than its classical competitor. We apply this to the Deutsch-Jozsa algorithm and show that the critical polarization is 86.6%.Comment: 11 pages, 3 figure

    Violence Against Women in New Hampshire

    Get PDF
    • …
    corecore