Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

中国物理B：英文版

NMR analogue of the generalized Grover's algorithm of multiple marked states and its application

张竞夫, 卢志恒, 邓志威, 单璐

Published Mar 16, 2005• 0 citations
Publisher

Abstract

The generalized Grover's algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The Walsh-Hadamard transform and the phase inversion are all replaced. NMR analogues of Einstein-Podolsky-Rosen states (pseudo-EPR states) are synthesized using the above algorithm.

DOI
10.1088/1009-1963/12/7/002

Related papers

NMR analogue of the generalized Grover's algorithm of multiple marked states and its application

Zhang Jing-Fu, Zhiheng Lu, Deng Zhi-Wei +1 more

The generalized Grover's algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The Walsh-Hadamard transform and the phase inversion are all replaced. NMR analogues of Einstein-Podolsky-Rosen states (pseudo-EPR states) are synthesized using the above algorithm.

arXiv:quant-ph/0208102•Chinese Physics•Jun 24, 2003•8 citations

Synthesizing NMR analogs of Einstein-Podolsky-Rosen states using the generalized Grover’s algorithm

Jingfu Zhang, Zhiheng Lu, Shan Lu +1 more

By designing a proper unitary operator U, we synthesize nuclear-magnetic-resonance (NMR) analogs of Einstein-Podolsky-Rosen (EPR) states (pseudo-EPR states) using the generalized Grover's algorithm on a NMR quantum computer. Experiments also demonstrate the generalized Grover's algorithm for the case in which there are multiple marked states.

arXiv:quant-ph/0205180•Physical Review A•Oct 30, 2002•15 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.

arXiv:quant-ph/0301033•Jan 9, 2003•0 citations

Realization of generalized quantum searching using nuclear magnetic resonance

Jingfu Zhang, Zhiheng Lu, Shan Lu +1 more

According to the theoretical results, the quantum searching algorithm can be generalized by replacing the Walsh-Hadamard transform by almost any quantum-mechanical operation. We have implemented the generalized algorithm using nuclear magnetic resonance techniques with a solution of chloroform molecules. Experimental results show a good agreement between the theory and experiment.

arXiv:quant-ph/0110076•Physical Review A•Feb 4, 2002•19 citations

Implementation of dense coding using the generalized Grover's algorithm

Jingfu Zhang, Zhiheng Lu, Shan Lu +1 more

Dense coding has been implemented using the generalized Grover's algorithm and its inverse operation. Exploiting the superpositions of two Einstein-Podolsky-Rosen (EPR) states, messages that are possible to be transmitted increase. Our scheme is demonstrated using nuclear magnetic resonance (NMR). Experimental results show a good agreement between theory and experiment.

arXiv:quant-ph/0211004•Nov 1, 2002•0 citations

Experimental NMR Realization of A Generalized Quantum Search Algorithm

G. L. Long, H. Y. Yan, Y. S. Li +8 more

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 Simon

•Jan 1, 2008•37 citations
The generalized Grover's algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The Walsh-Hadamard transform and the phase inversion are all replaced. NMR analogues of Einstein-Podolsky-Rosen states (pseudo-EPR states) are synthesized using the above algorithm.
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π/2π/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.
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 Simon