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/0207079 · The Journal of Chemical Physics

Experimental realization of a fetching algorithm in a 7-qubit NMR spin Liouville space computer

Gui Lu Long, Xiao Li

Published Oct 16, 2003• 59 citations
arXivHTMLPDF

Abstract

Using a 7-qubit spin Liouville space computer, we have demonstrated successfully a fetching algorithm that finds marked items using only a single query. The essential idea is the operation of quantum computers in classical parallel. We gave the detailed pulse sequence for coherent control of the 7 qubits. A generalization of the pulse sequences for arbitrary qubit number is also provided.

DOI
10.1063/1.1611177

Related papers

Fetching marked items from an unsorted database in NMR ensemble computing

Xiao Li, Gui‐Lu Long

The speedup of an unsorted database search has always been a challenging problem not only in classical computation but also in quantum computation. We propose a fetching algorithm for a Liouville space nuclear magnetic resonance (NMR) ensemble computing to fetch a marked item from an unsorted database directly. This algorithm achieves the absolute optimum in an unsorted database search problem: a single query. In fact, this algorithm also works well for fetching several unknown numbers of marked items. The computer simulation realization of the algorithm in a three-qubit homonuclear spin system is also presented. In addition, a compromised version of the algorithm, which reduces the demand on the structure of the molecules for the NMR experiment, is also devised.

arXiv:quant-ph/0112162•Physical Review A•Nov 22, 2002•25 citations

One- and two-dimensional ensemble quantum computing in spin Liouville space

Z. L. Mádi, Rafael Brüschweiler, Richard R. Ernst

New concepts are described for nuclear magnetic resonance (NMR) implementations of spin ensemble quantum computing in one and two dimensions. Similarities and differences between ensemble and pure state quantum computing are discussed by using a Liouville space formalism based on polarization and single transition operators. The introduction of an observer spin, that is coupled to the spins carrying the quantum bits, allows a mapping of the states of a quantum computer on a set of transitions between energy levels. This is spectroscopically favorable compared to a mapping on the energy levels themselves. Two complementary parallelization schemes for quantum computing are presented: one exploits the parallel processing feature inherent in multidimensional NMR, while the other employs mixed superposition states represented by operators in Liouville space. The spin swap operation, introduced in this paper, allows a convenient extension of quantum computing to spin systems where not all spin–spin couplings are resolved. The concepts are illustrated by implementations of logic operations and identities consisting of a sequence of basic logic gate operations.

The Journal of Chemical Physics•Dec 22, 1998•92 citations

Implementation of Liouville space search algorithm on strongly dipolar coupled nuclear spins

Tata Gopinath, Anil Kumar

Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified as a qubit. It has recently been demonstrated that n-strongly coupled spins can be collectively treated as an n-qubit system. Application of algorithms in such systems, requires new approaches using transition selective pulses rather than qubit selective pulses. This work develops a modified version of Liouville space search algorithm, which is applicable for strongly as well as weakly coupled spins. All the steps of the algorithm, can be implemented by using transition selective pulses. Experimental implementation is carried out on a strongly dipolar coupled four qubit system.

arXiv:0909.4235•Sep 23, 2009•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•3 citations

Liquid-State NMR Quantum Computer: Hamiltonian Formalism and Experiments

Yasushi Kondo, Mikio Nakahara, Shogo Tanimura

A quantum algorithm is represented as a unitary operator acting on a qubit space and is realized as a time development operator of a controlled quantum system. In a liquid-state NMR quantum computer, spins of nuclei in isolated molecules dissolved in a solvent work as qubits and they are controlled by radio frequency pulses. We reexamine the Hamiltonian describing the spin dynamics and formulate the principle of a liquid-state NMR quantum computer from the viewpoint of Hamiltonian dynamics. We executed the Deutsch-Jozsa algorithm and the Grover database search algorithm as well as a pseudopure state preparation with two-qubit homonucleus molecules to demonstrate the validity of our formalism. Finally we discuss whether a liquid-state NMR quantum computer currently fulfills the DiVincenzo criteria or not.

•Mar 1, 2006•5 citations

Novel Strategy for Database Searching in Spin Liouville Space by NMR Ensemble Computing

Rafael Brüschweiler

Quantum computing by nuclear magnetic resonance using pseudopure spin states is bound by the maximal speed of quantum computing algorithms operating on pure states. In contrast to these quantum computing algorithms, a novel algorithm for searching an unsorted database is presented here that operates on truly mixed states in spin Liouville space. It provides an exponential speedup over Grover's quantum search algorithm with the sensitivity scaling exponentially with the number of spins, as for pseudopure state implementations. The minimal decoherence time required is exponentially shorter than that for Grover's algorithm.

Physical Review Letters•Nov 27, 2000•36 citations
Using a 7-qubit spin Liouville space computer, we have demonstrated successfully a fetching algorithm that finds marked items using only a single query. The essential idea is the operation of quantum computers in classical parallel. We gave the detailed pulse sequence for coherent control of the 7 qubits. A generalization of the pulse sequences for arbitrary qubit number is also provided.
The speedup of an unsorted database search has always been a challenging problem not only in classical computation but also in quantum computation. We propose a fetching algorithm for a Liouville space nuclear magnetic resonance (NMR) ensemble computing to fetch a marked item from an unsorted database directly. This algorithm achieves the absolute optimum in an unsorted database search problem: a single query. In fact, this algorithm also works well for fetching several unknown numbers of marked items. The computer simulation realization of the algorithm in a three-qubit homonuclear spin system is also presented. In addition, a compromised version of the algorithm, which reduces the demand on the structure of the molecules for the NMR experiment, is also devised.
New concepts are described for nuclear magnetic resonance (NMR) implementations of spin ensemble quantum computing in one and two dimensions. Similarities and differences between ensemble and pure state quantum computing are discussed by using a Liouville space formalism based on polarization and single transition operators. The introduction of an observer spin, that is coupled to the spins carrying the quantum bits, allows a mapping of the states of a quantum computer on a set of transitions between energy levels. This is spectroscopically favorable compared to a mapping on the energy levels themselves. Two complementary parallelization schemes for quantum computing are presented: one exploits the parallel processing feature inherent in multidimensional NMR, while the other employs mixed superposition states represented by operators in Liouville space. The spin swap operation, introduced in this paper, allows a convenient extension of quantum computing to spin systems where not all spin–spin couplings are resolved. The concepts are illustrated by implementations of logic operations and identities consisting of a sequence of basic logic gate operations.
Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified as a qubit. It has recently been demonstrated that n-strongly coupled spins can be collectively treated as an n-qubit system. Application of algorithms in such systems, requires new approaches using transition selective pulses rather than qubit selective pulses. This work develops a modified version of Liouville space search algorithm, which is applicable for strongly as well as weakly coupled spins. All the steps of the algorithm, can be implemented by using transition selective pulses. Experimental implementation is carried out on a strongly dipolar coupled four qubit system.
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.
A quantum algorithm is represented as a unitary operator acting on a qubit space and is realized as a time development operator of a controlled quantum system. In a liquid-state NMR quantum computer, spins of nuclei in isolated molecules dissolved in a solvent work as qubits and they are controlled by radio frequency pulses. We reexamine the Hamiltonian describing the spin dynamics and formulate the principle of a liquid-state NMR quantum computer from the viewpoint of Hamiltonian dynamics. We executed the Deutsch-Jozsa algorithm and the Grover database search algorithm as well as a pseudopure state preparation with two-qubit homonucleus molecules to demonstrate the validity of our formalism. Finally we discuss whether a liquid-state NMR quantum computer currently fulfills the DiVincenzo criteria or not.
Quantum computing by nuclear magnetic resonance using pseudopure spin states is bound by the maximal speed of quantum computing algorithms operating on pure states. In contrast to these quantum computing algorithms, a novel algorithm for searching an unsorted database is presented here that operates on truly mixed states in spin Liouville space. It provides an exponential speedup over Grover's quantum search algorithm with the sensitivity scaling exponentially with the number of spins, as for pseudopure state implementations. The minimal decoherence time required is exponentially shorter than that for Grover's algorithm.