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

Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance

Ranabir Das, Anil Kumar

Published Oct 12, 2004• 9 citations
arXivHTMLPDF

Abstract

Quantum information processing has been effectively demonstrated on a small number of qubits by nuclear magnetic resonance. An important subroutine in any computing is the readout of the output. "Spectral implementation" originally suggested by Z. L. Madi, R. Bruschweiler, and R. R. Ernst [J. Chem. Phys. 109, 10603 (1999)], provides an elegant method of readout with the use of an extra "observer" qubit. At the end of computation, detection of the observer qubit provides the output via the multiplet structure of its spectrum. In spectral implementation by two-dimensional experiment the observer qubit retains the memory of input state during computation, thereby providing correlated information on input and output, in the same spectrum. Spectral implementation of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm are demonstrated here in three- and four-qubit systems.

DOI
10.1063/1.1795674

Related papers

Approximate Quantum Counting on an NMR Ensemble Quantum Computer

Jonathan A. Jones, Michele Mosca

We demonstrate the implementation of a quantum algorithm for estimating the number of matching items in a search operation using a two qubit nuclear magnetic resonance (NMR) quantum computer.

arXiv:quant-ph/9808056•Physical Review Letters•Aug 2, 1999•65 citations

Quantum information processing by nuclear magnetic resonance on quadrupolar nuclei

J. Teles, Eduardo Ribeiro DeAzevedo, Jair C. C. Freitas +3 more

Nuclear magnetic resonance is viewed as an important technique for the implementation of many quantum information algorithms and protocols. Although the most straightforward approach is to use the two-level system composed of spin 1/2 nuclei as qubits, quadrupolar nuclei, which possess a spin greater than 1/2, are being used as an alternative. In this study, we show some unique features of quadrupolar systems for quantum information processing, with an emphasis on the ability to execute efficient quantum state tomography (QST) using only global rotations of the spin system, whose performance is shown in detail. By preparing suitable states and implementing logical operations by numerically optimized pulses together with the QST method, we follow the stepwise execution of Grover's algorithm. We also review some work in the literature concerning the relaxation of pseudo-pure states in spin 3/2 systems as well as its modelling in both the Redfield and Kraus formalisms. These data are used to discuss differences in the behaviour of the quantum correlations observed for two-qubit systems implemented by spin 1/2 and quadrupolar spin 3/2 systems, also presented in the literature. The possibilities and advantages of using nuclear quadrupole resonance experiments for quantum information processing are also discussed.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 3, 2012•15 citations

"Spectral Implementation" for creating pseudo-pure states and a three-qubit Bernstein-Vazirani's algorithm in NMR

Xinhua Peng, Xiwen Zhu, Ximing Fang +3 more

Based on ''spectral implementation'' proposed by Madi et al. (J. Chem. Phys. 109, 10603, 1998), we have experimentally realized a pseudo-pure state by the line-selective excitation and a three-qubit Bernstein-Vazirani's algorithm using a carbon-13 analine sample in NMR. The superiority of quantum computation to classical counterpart is well displayed.

•Feb 1, 2002•0 citations

“Spectral implementation” for creating a labeled pseudo-pure state and the Bernstein–Vazirani algorithm in a four-qubit nuclear magnetic resonance quantum processor

Xinhua Peng, Xiwen Zhu, Ximing Fang +3 more

A quantum circuit is introduced to describe the preparation of a labeled pseudo-pure state by multiplet-component excitation scheme which has been experimentally implemented on a 4-qubit nuclear magnetic resonance quantum processor. Meanwhile, we theoretically analyze and numerically investigate the low-power selective single-pulse implementation of a controlled-rotation gate, which manifests its validity in our experiment. Based on the labeled pseudo-pure state prepared, a 3-qubit Bernstein-Vazirani algorithm has been experimentally demonstrated by spectral implementation. The "answers" of the computations are identified from the split peak positions in the spectra of the observer spin, which are equivalent to projective measurements required by the algorithms.

arXiv:quant-ph/0202008•The Journal of Chemical Physics•Feb 18, 2004•12 citations

Quantum information processing by nuclear magnetic resonance on quadrupolar nuclei

B Y J Oão, T Eles, E Duardo +6 more

Nuclear magnetic resonance is viewed as an important technique for the implementation of many quantum information algorithms and protocols. Although the most straightforward approach is to use the two-level system composed of spin 1 nuclei as qubits, quadrupolar nuclei, which possess a spin greater than 1 , are being used as an alternative. In this study, we show some unique features of quadrupolar systems for quantum information processing, with an emphasis on the ability to execute efficient quantum state tomography (QST) using only global rotations of the spin system, whose performance is shown in detail. By preparing suitable states and implementing logical operations by numerically optimized pulses together with the QST method, we follow the stepwise execution of Grover’s algorithm. We also review some work in the literature concerning the relaxation of pseudo-pure states in spin 3 systems as well as its modelling in both the Redfield and Kraus formalisms. These data are used to discuss differences in the behaviour of the quantum correlations observed for two-qubit systems implemented by spin 1 and quadrupolar spin 3 systems, also presented in the literature. The possibilities and advantages of using nuclear quadrupole resonance experiments for quantum information processing are also discussed.

•Jan 1, 2015•2 citations

Shortening Grover's search algorithm for an expectation value quantum computer

David C. Collins

Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value implementations of quantum algorithms has been to retain the conventional formulation's unitary operations but modify its initialization and measurement steps appropriately. This naive approach is not optimal for Grover's algorithm and a shortened version for expectation value quantum computers is presented.

arXiv:quant-ph/0209148•Sep 26, 2002•1 citation
Quantum information processing has been effectively demonstrated on a small number of qubits by nuclear magnetic resonance. An important subroutine in any computing is the readout of the output. "Spectral implementation" originally suggested by Z. L. Madi, R. Bruschweiler, and R. R. Ernst [J. Chem. Phys. 109, 10603 (1999)], provides an elegant method of readout with the use of an extra "observer" qubit. At the end of computation, detection of the observer qubit provides the output via the multiplet structure of its spectrum. In spectral implementation by two-dimensional experiment the observer qubit retains the memory of input state during computation, thereby providing correlated information on input and output, in the same spectrum. Spectral implementation of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm are demonstrated here in three- and four-qubit systems.
Nuclear magnetic resonance is viewed as an important technique for the implementation of many quantum information algorithms and protocols. Although the most straightforward approach is to use the two-level system composed of spin 1/2 nuclei as qubits, quadrupolar nuclei, which possess a spin greater than 1/2, are being used as an alternative. In this study, we show some unique features of quadrupolar systems for quantum information processing, with an emphasis on the ability to execute efficient quantum state tomography (QST) using only global rotations of the spin system, whose performance is shown in detail. By preparing suitable states and implementing logical operations by numerically optimized pulses together with the QST method, we follow the stepwise execution of Grover's algorithm. We also review some work in the literature concerning the relaxation of pseudo-pure states in spin 3/2 systems as well as its modelling in both the Redfield and Kraus formalisms. These data are used to discuss differences in the behaviour of the quantum correlations observed for two-qubit systems implemented by spin 1/2 and quadrupolar spin 3/2 systems, also presented in the literature. The possibilities and advantages of using nuclear quadrupole resonance experiments for quantum information processing are also discussed.
A quantum circuit is introduced to describe the preparation of a labeled pseudo-pure state by multiplet-component excitation scheme which has been experimentally implemented on a 4-qubit nuclear magnetic resonance quantum processor. Meanwhile, we theoretically analyze and numerically investigate the low-power selective single-pulse implementation of a controlled-rotation gate, which manifests its validity in our experiment. Based on the labeled pseudo-pure state prepared, a 3-qubit Bernstein-Vazirani algorithm has been experimentally demonstrated by spectral implementation. The "answers" of the computations are identified from the split peak positions in the spectra of the observer spin, which are equivalent to projective measurements required by the algorithms.
Nuclear magnetic resonance is viewed as an important technique for the implementation of many quantum information algorithms and protocols. Although the most straightforward approach is to use the two-level system composed of spin 1 nuclei as qubits, quadrupolar nuclei, which possess a spin greater than 1 , are being used as an alternative. In this study, we show some unique features of quadrupolar systems for quantum information processing, with an emphasis on the ability to execute efficient quantum state tomography (QST) using only global rotations of the spin system, whose performance is shown in detail. By preparing suitable states and implementing logical operations by numerically optimized pulses together with the QST method, we follow the stepwise execution of Grover’s algorithm. We also review some work in the literature concerning the relaxation of pseudo-pure states in spin 3 systems as well as its modelling in both the Redfield and Kraus formalisms. These data are used to discuss differences in the behaviour of the quantum correlations observed for two-qubit systems implemented by spin 1 and quadrupolar spin 3 systems, also presented in the literature. The possibilities and advantages of using nuclear quadrupole resonance experiments for quantum information processing are also discussed.
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value implementations of quantum algorithms has been to retain the conventional formulation's unitary operations but modify its initialization and measurement steps appropriately. This naive approach is not optimal for Grover's algorithm and a shortened version for expectation value quantum computers is presented.