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

International Journal of Quantum Chemistry

Fast preparation method of effective pure states for NMR‐quantum computer with controlled‐not gates

Minaru Kawamura, Ryuichi Sawae, Takashi Kumaya, Kenichi Takarabe, Yoshinori Manmoto, Toshio Sakata

Published Aug 30, 2004• 7 citations
Publisher

Abstract

Abstract A fast method to prepare effective pure states for NMR‐quantum computer in homo‐nuclear spin system is proposed. The temporal averaging method has been introduced to prepare an effective pure state in NMR‐quantum computer, but the method requires many experiments, whose number increases exponentially with the number of quantum bits (qubits), and it seems that a huge number of logical gates are required. The proposed method avoids this problem by eliminating a part of elements in the density matrices. This method requires only one ancillary qubit and two different experiments; the steps have been confirmed to be proportional to the number of qubits up to four‐qubit. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004

DOI
10.1002/qua.20297

Related papers

Quantum circuits for an effective pure state in NMR quantum computer

Yoshiyuki Mori, Ryuichi Sawae, Minaru Kawamura +2 more

Abstract In nuclear magnetic resonance (NMR) quantum computing systems, it is very important to prepare an effective pure state rather than a true pure state. Our main objective is to present a general algorithm that provides quantum circuits for preparing an effective pure state from any mixed state, consisting only of controlled‐not (CNOT) quantum gates for homonuclear spin systems. Our algorithm is based on the product operator approach and could be applicable to NMR quantum computing systems with more than eight qubits. Optimization of the number of controlled‐not quantum gates is discussed. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005

International Journal of Quantum Chemistry•Jan 1, 2005•6 citations

Implementation of two‐qubit and three‐qubit quantum computers using liquid‐state nuclear magnetic resonance

Dorothea Golze, Maik Icker, Stefan T. A. Berger

Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.

Concepts in Magnetic Resonance Part A•Jan 1, 2012•7 citations

A convenient method to prepare the effective pure state in a quantum ensemble

Xijia Miao

A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the temporal averaging (Knill, Chuang, and Laflamme, Phys.Rev.A 57, 3348(1998)). The quantum circuit to prepare the effective pure state is designed in a unified and systematical form and is explicitly decomposed completely into a product of a series of one-qubit quantum gates and the two-qubit diagonal quantum gates. The preparation could be programmed and implemented conveniently on an NMR quantum computer.

arXiv:quant-ph/0008094•Aug 23, 2000•4 citations

Effective pure states for bulk quantum computation

Emanuel H. Knill, Isaac L. Chuang, Raymond Laflamme

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) [Science 275, 350 (1997)] and Cory et al. (spatial averaging) [Proc. Natl. Acad. Sci. USA 94, 1634 (1997)] for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla quantum bits, and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high-temperature and low-temperature bulk quantum computing and analyze the signal-to-noise behavior of each. Most of these algorithms require only a constant multiple of the number of experiments needed by the other methods for creating effective pure states.

arXiv:quant-ph/9706053•Physical Review A•May 1, 1998•243 citations

Use of pairs of pseudopure states for NMR quantum computing

B. M. Fung

The premise of nuclear magnetic resonance (NMR) quantum computing is that pseudopure quantum states, for which the populations of all energy levels but one are equal, can be used instead of pure quantum states. However, for systems with a large number of quantum bits (qubits), it would require elaborate pulse sequences with many steps to prepare these pseudopure states. To overcome this problem, a method using pairs of pseudopure states (POPS) instead of individual pseudopure states as the basis for NMR quantum computing is introduced here. The POPS approach has a significant advantage over the existing methods that, regardless of the number of qubits, only a single step is needed to prepare each pair of pseudopure states. A detailed analysis of a 16-level spin system is given, and the results of applying a ${c}^{2}$-NOT quantum logic gate (a controlled-NOT gate conditional upon the state of two other qubits) to all the POPS in the system are presented.

Physical Review A•Jan 12, 2001•28 citations

Preparation of pseudo-pure states by line-selective pulses in Nuclear Magnetic Resonance

Xinhua Peng, Xiwen Zhu, Ximing Fang +4 more

A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in a single experiment much efficiently. The signal intensity with the pseudo-pure state prepared in this way is the same as that of temporal averaging. Our method is suitable for the system with arbitrary numbers of qubits. As an example of application, a highly structured search algorithm—-Hogg’s algorithm was also performed on the pseudo-pure state | 00 〉 prepared by our method.

•Dec 8, 2000•39 citations
Abstract A fast method to prepare effective pure states for NMR‐quantum computer in homo‐nuclear spin system is proposed. The temporal averaging method has been introduced to prepare an effective pure state in NMR‐quantum computer, but the method requires many experiments, whose number increases exponentially with the number of quantum bits (qubits), and it seems that a huge number of logical gates are required. The proposed method avoids this problem by eliminating a part of elements in the density matrices. This method requires only one ancillary qubit and two different experiments; the steps have been confirmed to be proportional to the number of qubits up to four‐qubit. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004
Abstract In nuclear magnetic resonance (NMR) quantum computing systems, it is very important to prepare an effective pure state rather than a true pure state. Our main objective is to present a general algorithm that provides quantum circuits for preparing an effective pure state from any mixed state, consisting only of controlled‐not (CNOT) quantum gates for homonuclear spin systems. Our algorithm is based on the product operator approach and could be applicable to NMR quantum computing systems with more than eight qubits. Optimization of the number of controlled‐not quantum gates is discussed. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005
Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.
A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the temporal averaging (Knill, Chuang, and Laflamme, Phys.Rev.A 57, 3348(1998)). The quantum circuit to prepare the effective pure state is designed in a unified and systematical form and is explicitly decomposed completely into a product of a series of one-qubit quantum gates and the two-qubit diagonal quantum gates. The preparation could be programmed and implemented conveniently on an NMR quantum computer.
In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) [Science 275, 350 (1997)] and Cory et al. (spatial averaging) [Proc. Natl. Acad. Sci. USA 94, 1634 (1997)] for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla quantum bits, and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high-temperature and low-temperature bulk quantum computing and analyze the signal-to-noise behavior of each. Most of these algorithms require only a constant multiple of the number of experiments needed by the other methods for creating effective pure states.
The premise of nuclear magnetic resonance (NMR) quantum computing is that pseudopure quantum states, for which the populations of all energy levels but one are equal, can be used instead of pure quantum states. However, for systems with a large number of quantum bits (qubits), it would require elaborate pulse sequences with many steps to prepare these pseudopure states. To overcome this problem, a method using pairs of pseudopure states (POPS) instead of individual pseudopure states as the basis for NMR quantum computing is introduced here. The POPS approach has a significant advantage over the existing methods that, regardless of the number of qubits, only a single step is needed to prepare each pair of pseudopure states. A detailed analysis of a 16-level spin system is given, and the results of applying a c2{c}^{2}c2-NOT quantum logic gate (a controlled-NOT gate conditional upon the state of two other qubits) to all the POPS in the system are presented.
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in a single experiment much efficiently. The signal intensity with the pseudo-pure state prepared in this way is the same as that of temporal averaging. Our method is suitable for the system with arbitrary numbers of qubits. As an example of application, a highly structured search algorithm—-Hogg’s algorithm was also performed on the pseudo-pure state | 00 〉 prepared by our method.