17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      "Spectral Implementation" for creating a labeled pseudo-pure state and the Bernstein-Vazirani's algorithm in a four-qubit nuclear magnetic resonance quantum processor

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          A quantum circuit is introducted to describe the preparation of a labeled pseudo-pure state by mutiplet-component excitation scheme which has been experimentally implemented on a 4-qubit nuclear magnetic resonance quantum processor. Meanwhile, we theoretically analyze and numerically inverstigate the low-power selective single-pulse implementation of a controlled-rotation gate, which manifests its validity in our experiment. Based on the labeled pseudo-pure state prepared, a 3-qubit Bernstein-Vazirani algorithm has been experimentally demonstrated by spectral implementation. The "answers" of the computations are indentified from the split speak positions in the spectra of the observer spin, which are equivalent to projective measurements required by the algorithms.

          Related collections

          Most cited references27

          • Record: found
          • Abstract: not found
          • Article: not found

          Bulk Spin-Resonance Quantum Computation

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Rapid Solution of Problems by Quantum Computation

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Quantum Mechanics helps in searching for a needle in a haystack

              Lov Grover (1997)
              Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any classical algorithm (whether deterministic or probabilistic) will need to access the database a minimum of O(N) times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) accesses to the database.
                Bookmark

                Author and article information

                Journal
                2002-02-01
                2004-02-23
                Article
                10.1063/1.1642579
                quant-ph/0202008
                34c7c6f5-b089-43b7-804e-1e77ed39b462
                History
                Custom metadata
                The Journal of Chemical Physics, Volume 120, Issue 8, pp. 3579-3585, 2004
                7 pages
                quant-ph

                Quantum physics & Field theory
                Quantum physics & Field theory

                Comments

                Comment on this article