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

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

Daxiu Wei, Xiaodong Yang, Jun Luo, Xianping Sun, Xizhi Zeng, Liu, Maili, Shangwu Ding

Published Sep 1, 2001• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0109002

Related papers

NMR experimental realization of seven-qubit D-J algorithm and controlled phase-shift gates with improved precision

Daxiu Wei, J. L. Luo, Xianping Sun +4 more

In this study, we report the experimental realization of seven-qubit Deutsch-Jozsa (D-J) algorithm and controlled phase-shift gates with improved precision using liquid state nuclear magnetic resonance (NMR). The experimental results have shown that transformationsU f in the seven-qubit D-J algorithm have been implemented with different pulse sequences, and whetherf is constant or balanced is determined by using only a single function call (U f ). Furthermore, we propose an experimental method to measure and correct the error in the controlled phase-shift gate that is simple and feasible in experiments, and can have precise phase shifts. These may offer the possibility of surmounting the difficulties of low signal-to-noise ratio (SNR) in multi-qubit NMR quantum computers, more complicated experimental techniques, and the increase of gate errors due to using a large number of imperfect selective pulses. These are also applied to more complicated quantum algorithms with more qubits, such as quantum Fourier transformation and Shor’s algorithm.

Chinese Science Bulletin•Jan 1, 2003•7 citations

Implementation of Quantum Logic Gates by Nuclear Magnetic Resonance Spectroscopy

Jiangfeng Du, Jihui Wu, Ming-Jun Shi +5 more

Using nuclear magnetic resonance techniques with a solution of cytosine molecules, we show an implementation of certain quantum logic gates (including NOT gate, square-root of NOT gate and controlled-NOT gate), which have central importance in quantum computing. In addition, experimental results show that nuclear magnetic resonance spectroscopy can efficiently measure the result of quantum computing without attendant wave-function collapse.

Chinese Physics Letters•Jan 1, 2000•10 citations

EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE

Kavita Dorai, Dieter Suter

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

arXiv:quant-ph/0211030•International Journal of Quantum Information•May 31, 2005•20 citations

Realization quantum network with NMR

Duan Yi

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.

Chinese journal of atomic and molecular physics•Jan 1, 2001•0 citations

Demonstration of measurement-free universal logical quantum computation

Friederike Butt, Ivan Pogorelov, Robert S. Freund +4 more

The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

Nature Communications•Jan 26, 2026•8 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
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.
In this study, we report the experimental realization of seven-qubit Deutsch-Jozsa (D-J) algorithm and controlled phase-shift gates with improved precision using liquid state nuclear magnetic resonance (NMR). The experimental results have shown that transformationsU f in the seven-qubit D-J algorithm have been implemented with different pulse sequences, and whetherf is constant or balanced is determined by using only a single function call (U f ). Furthermore, we propose an experimental method to measure and correct the error in the controlled phase-shift gate that is simple and feasible in experiments, and can have precise phase shifts. These may offer the possibility of surmounting the difficulties of low signal-to-noise ratio (SNR) in multi-qubit NMR quantum computers, more complicated experimental techniques, and the increase of gate errors due to using a large number of imperfect selective pulses. These are also applied to more complicated quantum algorithms with more qubits, such as quantum Fourier transformation and Shor’s algorithm.
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.
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 ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.
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.