A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another generalized algorithm where the two phase rotations are π/2 and 3π/2 respectively. Pulse sequences which include non 90 1 degree pulses are given. Typeset using REVTEX 2 Grover’s quantum search algorithm is one of the most important development in quantum computation [1]. It achieves quadratic speedup in searching a marked state in an unordered list over classical searching algorithms. It has many potential applications in various fields of interests, for instance in deciphering the DES encryption code [2] and algorithms that need searching. Typical examples of the algorithms that need searching are the SimonA generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another generalized algorithm where the two phase rotations are π/2 and 3π/2 respectively. Pulse sequences which include non 90 1 degree pulses are given. Typeset using REVTEX 2 Grover’s quantum search algorithm is one of the most important development in quantum computation [1]. It achieves quadratic speedup in searching a marked state in an unordered list over classical searching algorithms. It has many potential applications in various fields of interests, for instance in deciphering the DES encryption code [2] and algorithms that need searching. Typical examples of the algorithms that need searching are the Simon

Jan 1, 200837 citations

Implementation of Quantum Algorithms by NMR

Ivan S. Oliveira, Tito José Bonagamba, Roberto S. Sarthour +2 more

Elsevier eBooksJan 1, 20070 citations

NMR implementation of a quantum scheduling algorithm

Jingfu Zhang, Zhi-Heng Lu, Zhiwei Deng +1 more

The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $π/2$ phase rotations replace the selective inversions, in order to make the quantum scheduling algorithm suitable for more cases. Our scheme is realized on a nuclear magnetic resonance (NMR) quantum computer. Experimental results show a good agreement between theory and experiment.The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $π/2$ phase rotations replace the selective inversions, in order to make the quantum scheduling algorithm suitable for more cases. Our scheme is realized on a nuclear magnetic resonance (NMR) quantum computer. Experimental results show a good agreement between theory and experiment.

arXiv:quant-ph/0301033Jan 9, 20030 citations

First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system

Yang Liu, Feihao Zhang

Science China Physics Mechanics and AstronomyApr 8, 20159 citations

Experimental realization of a target-accepting quantum search by NMR

Jae‐Hyun Kim, Jae‐Seung Lee, Soonchil Lee

With a three-bit nuclear magnetic resonance quantum computer, we have experimentally realized a quantum search algorithm that can take a desired function value (or target) t as its input and give the corresponding function argument ${x}_{0}$ such that ${f(x}_{0})=t$ as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.With a three-bit nuclear magnetic resonance quantum computer, we have experimentally realized a quantum search algorithm that can take a desired function value (or target) t as its input and give the corresponding function argument ${x}_{0}$ such that ${f(x}_{0})=t$ as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.

Physical Review AApr 24, 20029 citations

Quantum Computation with NMR

Jonathan A. Jones

WORLD SCIENTIFIC eBooksJan 1, 20012 citations

π/2

phase rotations replace the selective inversions, in order to make the quantum scheduling algorithm suitable for more cases. Our scheme is realized on a nuclear magnetic resonance (NMR) quantum computer. Experimental results show a good agreement between theory and experiment.

{x}_{0}

such that

{f(x}_{0})=t

as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.