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/0205180 · Physical Review A

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

Jingfu Zhang, Zhiheng Lu, Shan Lu, Zhiwei Deng

Published Oct 30, 2002• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.66.044308

Related papers

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

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

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

Nonlocal implementation of the Grover algorithm

Wenzhang Liu

At present, state-of-the-art quantum computers using nuclear magnetic resonance (NMR) can only implement 7-qubits. Therefore, some authors have proposed a distributed quantum computer that can integrate more qubits. The nonlocal implementation of the Grover quantum search algorithm was used to analyze the Einstein-Podolsky-Rosen (EPR) pair resources required for the nonlocal implementation. This study describes the details of the implementation in a two-qubit system and the nonlocal implementation of a system with N-qubit numbers. N is the databank size to be searched. The results show that for uncertain circumstances, the required resources in a nonlocal quantum computation are more EPR pairs than in a classical Grover algorithm, even more than in a classical computation; hence, the nonlocal implementation of quantum computation loses its advantage.

Journal of Tsinghua University(Science and Technology)•Jan 1, 2005•0 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
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.
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.
At present, state-of-the-art quantum computers using nuclear magnetic resonance (NMR) can only implement 7-qubits. Therefore, some authors have proposed a distributed quantum computer that can integrate more qubits. The nonlocal implementation of the Grover quantum search algorithm was used to analyze the Einstein-Podolsky-Rosen (EPR) pair resources required for the nonlocal implementation. This study describes the details of the implementation in a two-qubit system and the nonlocal implementation of a system with N-qubit numbers. N is the databank size to be searched. The results show that for uncertain circumstances, the required resources in a nonlocal quantum computation are more EPR pairs than in a classical Grover algorithm, even more than in a classical computation; hence, the nonlocal implementation of quantum computation loses its advantage.