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/0301033

NMR implementation of a quantum scheduling algorithm

Jingfu Zhang, Zhi-Heng Lu, Zhiwei Deng, Hui Wang

Published Jan 9, 2003• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0301033

Related papers

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•20 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

Realization of a Quantum Scheduling Algorithm Using Nuclear Magnetic Resonance

Zhang Jing-Fu, Zhiwei Deng, Pan Yan-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•Jul 1, 2004•3 citations

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

Research on Quantum Searching Algorithms Based on Phase Shifts

Zhong Pu-Cha, Wan‐Su Bao

One iterative in Grover's original quantum search algorithm consists of two Hadamard–Walsh transformations, a selective amplitude inversion and a diffusion amplitude inversion. We concentrate on the relation among the probability of success of the algorithm, the phase shifts, the number of target items and the number of iterations via replacing the two amplitude inversions by phase shifts of an arbitrary ϕ = ϕ(0 ⩽ ϕ, ϕ ⩽ 2π). Then, according to the relation we find out the optimal phase shifts when the number of iterations is given. We present a new quantum search algorithm based on the optimal phase shifts of 1.018 after 0.5π/ iterations. The new algorithm can obtain either a single target item or multiple target items in the search space with the probability of success at least 93.43%.

Chinese Physics Letters•Jul 29, 2008•7 citations

Phase matching in quantum searching

Gui‐Lu Long, Yan Li, Wei Lin Zhang +2 more

Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ 〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. When phase matching is obtained, we found that the generalized quantum search is still a rotation in 2-dimensional space, but with a small angle β ′ ≈ (2sin θ 2)β, where θ is the angle of phase rotation of the marked state and 2β is the angle of U(2) rotation when the phase rotations are the inversions in the original version. We give also a simple explanation of the phase matching requirement.

•Jan 1, 1999•113 citations
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.
One iterative in Grover's original quantum search algorithm consists of two Hadamard–Walsh transformations, a selective amplitude inversion and a diffusion amplitude inversion. We concentrate on the relation among the probability of success of the algorithm, the phase shifts, the number of target items and the number of iterations via replacing the two amplitude inversions by phase shifts of an arbitrary ϕ = ϕ(0 ⩽ ϕ, ϕ ⩽ 2π). Then, according to the relation we find out the optimal phase shifts when the number of iterations is given. We present a new quantum search algorithm based on the optimal phase shifts of 1.018 after 0.5π/ iterations. The new algorithm can obtain either a single target item or multiple target items in the search space with the probability of success at least 93.43%.
Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ 〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. When phase matching is obtained, we found that the generalized quantum search is still a rotation in 2-dimensional space, but with a small angle β ′ ≈ (2sin θ 2)β, where θ is the angle of phase rotation of the marked state and 2β is the angle of U(2) rotation when the phase rotations are the inversions in the original version. We give also a simple explanation of the phase matching requirement.