4,352 research outputs found

    Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer

    Get PDF
    We demonstrate the use of an NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch's problem.Comment: 16 pages including 6 figures. Minor clarifications as requested by the referee plus updated references. Journal of Chemical Physics, in press (expected publication date August 1st 1998

    On Quantum Algorithms

    Get PDF
    Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.Comment: 15 pages, 8 figure

    Resonant tunneling magnetoresistance in epitaxial metal-semiconductor heterostructures

    Full text link
    We report on resonant tunneling magnetoresistance via localized states through a ZnSe semiconducting barrier which can reverse the sign of the effective spin polarization of tunneling electrons. Experiments performed on Fe/ZnSe/Fe planar junctions have shown that positive, negative or even its sign-reversible magnetoresistance can be obtained, depending on the bias voltage, the energy of localized states in the ZnSe barrier and spatial symmetry. The averaging of conduction over all localized states in a junction under resonant condition is strongly detrimental to the magnetoresistance

    Approximating Fractional Time Quantum Evolution

    Full text link
    An algorithm is presented for approximating arbitrary powers of a black box unitary operation, Ut\mathcal{U}^t, where tt is a real number, and U\mathcal{U} is a black box implementing an unknown unitary. The complexity of this algorithm is calculated in terms of the number of calls to the black box, the errors in the approximation, and a certain `gap' parameter. For general U\mathcal{U} and large tt, one should apply U\mathcal{U} a total of t\lfloor t \rfloor times followed by our procedure for approximating the fractional power Utt\mathcal{U}^{t-\lfloor t \rfloor}. An example is also given where for large integers tt this method is more efficient than direct application of tt copies of U\mathcal{U}. Further applications and related algorithms are also discussed.Comment: 13 pages, 2 figure

    Future large-scale water-Cherenkov detector

    Full text link
    MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water-Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches and the detection of neutrinos from supernovae, solar, and atmospheric neutrinos, as well as neutrinos from a future beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. This paper provides an overview of the latest studies on the expected performance of MEMPHYS in view of detailed estimates of its physics reach, mainly concerning neutrino beams

    Study of the performance of a large scale water-Cherenkov detector (MEMPHYS)

    Full text link
    MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches, neutrinos from supernovae, solar and atmospheric neutrinos, as well as neutrinos from a future Super-Beam or Beta-Beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. A full simulation of the detector has been performed to evaluate its performance for beam physics. The results are given in terms of "Migration Matrices" of reconstructed versus true neutrino energy, taking into account all the experimental effects.Comment: Updated after JCAP's referee's comment

    Adiabatic Quantum Computing with Phase Modulated Laser Pulses

    Full text link
    Implementation of quantum logical gates for multilevel system is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and Hamiltonian evolution with time to achieve such goals robustly instead of the standard unitary transformation language.Comment: 19 pages, 6 figures, submitted to JOP

    On the robustness of bucket brigade quantum RAM

    Get PDF
    We study the robustness of the bucket brigade quantum random access memory model introduced by Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett. 100, 160501 (2008)]. Due to a result of Regev and Schiff [ICALP '08 pp. 773], we show that for a class of error models the error rate per gate in the bucket brigade quantum memory has to be of order o(2n/2)o(2^{-n/2}) (where N=2nN=2^n is the size of the memory) whenever the memory is used as an oracle for the quantum searching problem. We conjecture that this is the case for any realistic error model that will be encountered in practice, and that for algorithms with super-polynomially many oracle queries the error rate must be super-polynomially small, which further motivates the need for quantum error correction. By contrast, for algorithms such as matrix inversion [Phys. Rev. Lett. 103, 150502 (2009)] or quantum machine learning [Phys. Rev. Lett. 113, 130503 (2014)] that only require a polynomial number of queries, the error rate only needs to be polynomially small and quantum error correction may not be required. We introduce a circuit model for the quantum bucket brigade architecture and argue that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of "active" gates, since all components have to be actively error corrected.Comment: Replaced with the published version. 13 pages, 9 figure

    First Supramolecular Sensors for Phosphonate Anions

    Get PDF
    Fluorescent tripodal anion sensors with a 1,3,5-triethylbenzene core display a turn-on fluorescence response to phosphonate and phosphate anions and may be used as optical sensors. The properties of the receptors and sensors as well as their anion binding behavior were investigated both in solution and in solid state. The turn-on fluorescence response can be leveraged in sensing of phosphate anions and, most importantly, hydrolysis products of the nerve gas sarin, isopropyl methylphosphonate (IMP), and methylphosphonate (MP). The fluorescence signal amplification in the presence of anions allows for application of these molecules in a sensor microarray suitable for high-throughput screening.NSF CHE 0750303, EXP-LA 0731153BGSU (TIE Grant)Chemistr
    corecore