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

Chinese journal of atomic and molecular physics

Realization quantum network with NMR

Duan Yi

Published Jan 1, 2001• 0 citations
OpenAlex

Abstract

With the technique of opposite phases, the sequence pulse for exact controlled not gate was designed, and the controlled controlled phase shift gate, which is the key gate in Grovers algorithm, and the double controlled not gate were also constructed by employing only two body interaction. The symmetric operators of quantum states were made up. All the above are the tools of the quantum state engineering, therefore, theyare very useful for both theoretic and experimental investigations of quantum computation.

Related papers

Experimental realization of 7-qubit universal perfect controlled-NOT and controlled square-root NOT gates

Daxiu Wei, Xiaodong Yang, Jun Luo +4 more

The controlled-NOT gate and controlled square-root NOT gate play an important role in quantum algorithm. This article reports the experimental results of these two universal quantum logic gates (controlled square-root NOT gate and controlled-NOT gate) on a 7-qubit NMR quantum computer. Further, we propose a simple experimental method to measure and correct the error in the controlled phase-shift gate, which is helpful to construct a more perfect phase-shift gate experimentally and can also be used in more qubits discrete Fourier transformation.

arXiv:quant-ph/0109002•Sep 1, 2001•1 citation

Preparation of pseudopure state in nuclear spin ensemble using CNOT gates combination

Xiaodong, Yang, Daxiu +5 more

Nuclear magnetic resonance (NMR) is one of the experimental schemes for quantum computation. Most initial state of quantum algorithm in NMR computation is the pseudopure state. Until now, there are several methods to prepare pseudopure state. This note, based on the idea of controlled-not (CNOT) gates combination, has analyzed the characteristics of this method in the odd- and even-qubit system. Also, we have designed the pulse sequence for a 4-qubit sample to obtain pseudopure state, and realized it in the experiment. This method reduces the complexity of experiment and gives a high signal-to-noise (S/N) ratio.

中国科学通报：英文版•Jan 1, 2002•0 citations

Orchestrating an NMR quantum computation: the N=3 Deutsch-Jozsa algorithm

David C. Collins, K. W. Kim, William C. Holton +2 more

A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.

arXiv:quant-ph/0105045•May 10, 2001•0 citations

CONSTRUCTION AND APPLICATION OF FOUR-QUBIT SWAP LOGIC GATE IN NMR QUANTUM COMPUTING

Ahmet Gün, İrfan Şaka, Azmi Gençten

In NMR quantum computing, spin states of spin-1/2 nuclei are called qubits. Quantum logic gates are represented by unitary matrices. As a universal gate, controlled-NOT (CNOT) is a two-qubit gate. For the IS (I = 1/2 and S = 1/2) spin system, two-qubit CNOT gate is represented by a 4 × 4 matrix. SWAP logic gate, which exchanges two quantum states, is constructed by CNOT gates. In this study, first, four-qubit CNOT gates are constructed for the IS (I = 3/2, S = 3/2) spin system. Then, by using these CNOT gates, a four-qubit SWAP logic gate is found. As an application and verification, an obtained SWAP logic gate is applied to the matrix representation of product operators for the IS (I = 3/2, S = 3/2) spin system. SWAP logic gate can also be presented by an NMR pulse sequence. By using the product operator theory, the pulse sequence of the SWAP logic gate is applied to product operators of the IS (I = 3/2, S = 3/2) spin system. The expected exchange results are obtained for both the matrix representation and the pulse sequence of SWAP logic gate.

International Journal of Quantum Information•Mar 1, 2011•3 citations

NMR Simulation of the Multi-Qubit Grover Quantum Search Algorithm

Chunhong Lu

Currently,the NMR technology is one of the effective physical systems to realize quantum computation.As the multiple-quantum operator algebra theory mentions,any unitary transformation can be decomposed into a sequence of a limited number of one-qubit quantum gates and two-qubit diagonal gates.Based on these backgrounds,we propose a method to form NMR pulse sequences to realize the multi-qubit Grover quantum search algorithm.Experiments finish the algorithm with three-qubit,on a Quantum Computer Emulator.

Computer Engineering and Science•Jan 1, 2007•1 citation

Programmable Networks for Quantum Algorithms

Norbert Schuch, Jens Siewert

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.

arXiv:quant-ph/0303063•Physical Review Letters•Jul 7, 2003•44 citations
With the technique of opposite phases, the sequence pulse for exact controlled not gate was designed, and the controlled controlled phase shift gate, which is the key gate in Grovers algorithm, and the double controlled not gate were also constructed by employing only two body interaction. The symmetric operators of quantum states were made up. All the above are the tools of the quantum state engineering, therefore, theyare very useful for both theoretic and experimental investigations of quantum computation.
The controlled-NOT gate and controlled square-root NOT gate play an important role in quantum algorithm. This article reports the experimental results of these two universal quantum logic gates (controlled square-root NOT gate and controlled-NOT gate) on a 7-qubit NMR quantum computer. Further, we propose a simple experimental method to measure and correct the error in the controlled phase-shift gate, which is helpful to construct a more perfect phase-shift gate experimentally and can also be used in more qubits discrete Fourier transformation.
Nuclear magnetic resonance (NMR) is one of the experimental schemes for quantum computation. Most initial state of quantum algorithm in NMR computation is the pseudopure state. Until now, there are several methods to prepare pseudopure state. This note, based on the idea of controlled-not (CNOT) gates combination, has analyzed the characteristics of this method in the odd- and even-qubit system. Also, we have designed the pulse sequence for a 4-qubit sample to obtain pseudopure state, and realized it in the experiment. This method reduces the complexity of experiment and gives a high signal-to-noise (S/N) ratio.
A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.
In NMR quantum computing, spin states of spin-1/2 nuclei are called qubits. Quantum logic gates are represented by unitary matrices. As a universal gate, controlled-NOT (CNOT) is a two-qubit gate. For the IS (I = 1/2 and S = 1/2) spin system, two-qubit CNOT gate is represented by a 4 × 4 matrix. SWAP logic gate, which exchanges two quantum states, is constructed by CNOT gates. In this study, first, four-qubit CNOT gates are constructed for the IS (I = 3/2, S = 3/2) spin system. Then, by using these CNOT gates, a four-qubit SWAP logic gate is found. As an application and verification, an obtained SWAP logic gate is applied to the matrix representation of product operators for the IS (I = 3/2, S = 3/2) spin system. SWAP logic gate can also be presented by an NMR pulse sequence. By using the product operator theory, the pulse sequence of the SWAP logic gate is applied to product operators of the IS (I = 3/2, S = 3/2) spin system. The expected exchange results are obtained for both the matrix representation and the pulse sequence of SWAP logic gate.
Currently,the NMR technology is one of the effective physical systems to realize quantum computation.As the multiple-quantum operator algebra theory mentions,any unitary transformation can be decomposed into a sequence of a limited number of one-qubit quantum gates and two-qubit diagonal gates.Based on these backgrounds,we propose a method to form NMR pulse sequences to realize the multi-qubit Grover quantum search algorithm.Experiments finish the algorithm with three-qubit,on a Quantum Computer Emulator.
The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.