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

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

Xijia Miao

Published Aug 23, 2000• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0008094

Related papers

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

Minaru Kawamura, Ryuichi Sawae, Takashi Kumaya +3 more

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

International Journal of Quantum Chemistry•Aug 30, 2004•7 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

Three-Qubit State Preparation: Classification and Explicit Circuits

Yonghae Lee, Taewan Kim

We present a deterministic framework for preparing an arbitrary three-qubit pure state. To leverage entanglement structure in the state-preparation task, we classify three-qubit pure states into five types with respect to a $1|2$ bipartition. Given a target state specified by its amplitudes, we provide concrete criteria and concurrence-based tests that determine its type. For each type, we derive an explicit circuit template composed of elementary single-qubit rotations and CNOT gates, with gate parameters determined systematically from the Schmidt decomposition. The full construction is described step by step from the target amplitudes, with no procedural ambiguity. As an application, we further group frequently encountered three-qubit pure states in quantum information into four classes and provide an explicit circuit for each class. Compared with prior approaches, our circuits are designed for practical use: they admit a direct algorithmic instantiation, use only CNOT gates between adjacent qubits, and for certain classes achieve smaller gate counts and circuit depth.

quant-pharXiv:2603.00845•Physical Review A•Mar 3, 2026•2 citations

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

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

Ensemble quantum computing by NMR spectroscopy: product operators, pseudopure states, and an implementation of quantum error correction

Timothy F. Havel, Shyamal S. Somaroo, David G. Cory

Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 6, 1998•0 citations
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.
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
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.
We present a deterministic framework for preparing an arbitrary three-qubit pure state. To leverage entanglement structure in the state-preparation task, we classify three-qubit pure states into five types with respect to a 1∣21|21∣2 bipartition. Given a target state specified by its amplitudes, we provide concrete criteria and concurrence-based tests that determine its type. For each type, we derive an explicit circuit template composed of elementary single-qubit rotations and CNOT gates, with gate parameters determined systematically from the Schmidt decomposition. The full construction is described step by step from the target amplitudes, with no procedural ambiguity. As an application, we further group frequently encountered three-qubit pure states in quantum information into four classes and provide an explicit circuit for each class. Compared with prior approaches, our circuits are designed for practical use: they admit a direct algorithmic instantiation, use only CNOT gates between adjacent qubits, and for certain classes achieve smaller gate counts and circuit depth.
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
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.
Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.