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

arXiv:quant-ph/0110076 · Physical Review A

Realization of generalized quantum searching using nuclear magnetic resonance

Jingfu Zhang, Zhiheng Lu, Shan Lu, Zhiwei Deng

Published Feb 4, 2002• 19 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.65.034301

Related papers

Study on realization of generalized quantum searching using nuclear magnetic resonance

Jingfu Zhang, Zhi-Heng Lu, Shan Lu +1 more

According to the theoretical results, the quantum searching algorithm can be generalized by replacing the Wash-Hadamard(W-H) transform by almost any quantum operator. We have implemented this generalized algorithm using nuclear magnetic resonance techniques with a solution of chloroform molecules. We find that experimental results represent a good agreement between theory and experiment.

•Oct 12, 2001•0 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

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

张竞夫, 卢志恒, 邓志威 +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.

中国物理B：英文版•Mar 16, 2005•0 citations

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

Experimental Implementation of Fast Quantum Searching

Isaac L. Chuang, Neil Gershenfeld, Mark G. Kubinec

Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover's search algorithm for a system with four states. By performing a tomographic reconstruction of the density matrix during the computation good agreement is seen between theory and experiment. This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then reading out the final state.

Physical Review Letters•Apr 13, 1998•701 citations

Realization of a Quantum Scheduling Algorithm Using Nuclear Magnetic Resonance

ZHANGJing-Fu, DENGZhi-Wei, PANYan-Na +1 more

The quantum scheduling algorithm proposed by Grover is generalized to extend its scope of applications. The generalized algorithm proposed here is realized on a nuclear magnetic resonance quantum computer. The experimental results show that the generalized algorithm can work efficiently in the case that Grover's scheduling algorithm is completely invalid, and represent the quantum advantages when qubits replace classical bits.

Chinese Physics Letters•Jan 1, 2004•0 citations
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.
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.
Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover's search algorithm for a system with four states. By performing a tomographic reconstruction of the density matrix during the computation good agreement is seen between theory and experiment. This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then reading out the final state.