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

Physical Review A

Experimental implementation of a quantum random-walk search algorithm using strongly dipolar coupled spins

Dawei Lu, Jing Zhu, Ping Zou, Xinhua Peng, Yihua Yu, Shanmin Zhang, Qun Chen, Jiangfeng Du

Published Feb 9, 2010• 30 citations
Publisher

Abstract

An important quantum search algorithm based on the quantum random walk performs an oracle search on a database of $N$ items with $O(\sqrt{\mathit{ph}N})$ calls, yielding a speedup similar to the Grover quantum search algorithm. The algorithm was implemented on a quantum information processor of three-qubit liquid-crystal nuclear magnetic resonance (NMR) in the case of finding 1 out of 4, and the diagonal elements' tomography of all the final density matrices was completed with comprehensible one-dimensional NMR spectra. The experimental results agree well with the theoretical predictions.

DOI
10.1103/physreva.81.022308

Related papers

Quantum random-walk search algorithm

Neil Shenvi, Julia Kempe, K. Birgitta Whaley

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with $O(\sqrt{N})$ calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

arXiv:quant-ph/0210064•Physical Review A•May 23, 2003•1,140 citations

White Noise in Quantum Random Walk Search Algorithm

Лей Ма, Du Jiang-Feng, Yun Li +3 more

The quantum random walk is a possible approach to construct new quantum search algorithms. It has been shown by Shenvi et al. [Phys. Rev. A 67 (2003) 52307 that a kind of algorithm can perform an oracle search on a database of N items with O ( N 1/2 ) calling to the oracle, yielding a speedup similar to other quantum search algorithms. We study the effect of white or Gaussian noise on this algorithm. The algorithm loses efficiency when noise is added. We also show that noise on the target state plays a more important role than that on other states. Finally we compare the effects of similar types of noise in the quantum random walk search algorithm and Grover's search algorithm.

Chinese Physics Letters•Mar 30, 2006•4 citations

Experimental implementation of a discrete-time quantum random walk on an NMR quantum-information processor

Colm A. Ryan, Martin Laforest, Jean-Christian Boileau +1 more

We present an experimental implementation of the coined discrete-time quantum walk on a square using a three-qubit liquid-state nuclear-magnetic-resonance (NMR) quantum-information processor (QIP). Contrary to its classical counterpart, we observe complete interference after certain steps and a periodicity in the evolution. Complete state tomography has been performed for each of the eight steps, making a full period. The results have extremely high fidelity with the expected states and show clearly the effects of quantum interference in the walk. We also show and discuss the importance of choosing a molecule with a natural Hamiltonian well suited to a NMR QIP by implementing the same algorithm on a second molecule. Finally, we show experimentally that decoherence after each step makes the statistics of the quantum walk tend to that of the classical random walk.

arXiv:quant-ph/0507267•Physical Review A•Dec 9, 2005•279 citations

Quantum Information Processing by NMR using strongly coupled spins

T. S. Mahesh, Neeraj Sinha, Arindam Ghosh +5 more

The enormous theoretical potential of Quantum Information Processing (QIP) is driving the pursuit for its practical realization by various physical techniques. Currently Nuclear Magnetic Resonance (NMR) has been the forerunner by demonstrating a majority of quantum algorithms. In NMR, spin systems consisting of coupled nuclear spins are utilized as qubits. In order to carry out QIP, a spin system has to meet two major requirements: (i) qubit addressability and (ii) mutual coupling among the qubits. It has been demonstrated that the magnitude of the mutual coupling among qubits can be increased by orienting the spin-systems in a liquid crystal matrix and utilizing the residual dipolar couplings. While utilizing residual dipolar couplings may be useful to increase the number of qubits, nuclei of same species (homonuclei) might become strongly coupled. In strongly coupled spin-systems, spins loose their individual identity of being qubits. We propose that even such strongly coupled spin-systems can be used for QIP and the qubit-manipulation can be achieved by transition-selective pulses. We demonstrate experimental preparation of pseudopure states, creation of maximally entangled states, implementation logic gates and implementation of Deutsch-Jozsa (DJ) algorithm in strongly coupled 2,3 and 4 spin systems. The energy levels of the strongly coupled 3 and 4 spin systems were obtained by using a Z-COSY experiment.

arXiv:quant-ph/0212123•Dec 20, 2002•5 citations

Error tolerance in an NMR implementation of Grover’s fixed-point quantum search algorithm

Xiao Li, Jonathan A. Jones

We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.

arXiv:quant-ph/0504054•Physical Review A•Sep 22, 2005•25 citations

Characterization of quantum algorithms by quantum process tomography using quadrupolar spins in solid-state nuclear magnetic resonance

Hermann Kampermann, W. S. Veeman

NMR quantum computing with qubit systems represented by nuclear spins (I=12) in small molecules in liquids has led to the most successful experimental quantum information processors so far. We use the quadrupolar spin-32 sodium nuclei of a NaNO3 single crystal as a virtual two-qubit system. The large quadrupolar coupling in comparison with the environmental interactions and the usage of strongly modulating pulses allow us to manipulate the system fast enough and at the same time keeping the decoherence reasonably slow. The experimental challenge is to characterize the "calculation" behavior of the quantum processor by process tomography which is here adapted to the quadrupolar spin system. The results of a selection of quantum gates and algorithms are presented as well as a detailed analysis of experimental results.

The Journal of Chemical Physics•Jun 1, 2005•47 citations
An important quantum search algorithm based on the quantum random walk performs an oracle search on a database of NNN items with O(phN)O(\sqrt{\mathit{ph}N})O(phN​) calls, yielding a speedup similar to the Grover quantum search algorithm. The algorithm was implemented on a quantum information processor of three-qubit liquid-crystal nuclear magnetic resonance (NMR) in the case of finding 1 out of 4, and the diagonal elements' tomography of all the final density matrices was completed with comprehensible one-dimensional NMR spectra. The experimental results agree well with the theoretical predictions.
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O(N)O(\sqrt{N})O(N​) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.
The quantum random walk is a possible approach to construct new quantum search algorithms. It has been shown by Shenvi et al. [Phys. Rev. A 67 (2003) 52307 that a kind of algorithm can perform an oracle search on a database of N items with O ( N 1/2 ) calling to the oracle, yielding a speedup similar to other quantum search algorithms. We study the effect of white or Gaussian noise on this algorithm. The algorithm loses efficiency when noise is added. We also show that noise on the target state plays a more important role than that on other states. Finally we compare the effects of similar types of noise in the quantum random walk search algorithm and Grover's search algorithm.
We present an experimental implementation of the coined discrete-time quantum walk on a square using a three-qubit liquid-state nuclear-magnetic-resonance (NMR) quantum-information processor (QIP). Contrary to its classical counterpart, we observe complete interference after certain steps and a periodicity in the evolution. Complete state tomography has been performed for each of the eight steps, making a full period. The results have extremely high fidelity with the expected states and show clearly the effects of quantum interference in the walk. We also show and discuss the importance of choosing a molecule with a natural Hamiltonian well suited to a NMR QIP by implementing the same algorithm on a second molecule. Finally, we show experimentally that decoherence after each step makes the statistics of the quantum walk tend to that of the classical random walk.
The enormous theoretical potential of Quantum Information Processing (QIP) is driving the pursuit for its practical realization by various physical techniques. Currently Nuclear Magnetic Resonance (NMR) has been the forerunner by demonstrating a majority of quantum algorithms. In NMR, spin systems consisting of coupled nuclear spins are utilized as qubits. In order to carry out QIP, a spin system has to meet two major requirements: (i) qubit addressability and (ii) mutual coupling among the qubits. It has been demonstrated that the magnitude of the mutual coupling among qubits can be increased by orienting the spin-systems in a liquid crystal matrix and utilizing the residual dipolar couplings. While utilizing residual dipolar couplings may be useful to increase the number of qubits, nuclei of same species (homonuclei) might become strongly coupled. In strongly coupled spin-systems, spins loose their individual identity of being qubits. We propose that even such strongly coupled spin-systems can be used for QIP and the qubit-manipulation can be achieved by transition-selective pulses. We demonstrate experimental preparation of pseudopure states, creation of maximally entangled states, implementation logic gates and implementation of Deutsch-Jozsa (DJ) algorithm in strongly coupled 2,3 and 4 spin systems. The energy levels of the strongly coupled 3 and 4 spin systems were obtained by using a Z-COSY experiment.
We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.
NMR quantum computing with qubit systems represented by nuclear spins (I=12) in small molecules in liquids has led to the most successful experimental quantum information processors so far. We use the quadrupolar spin-32 sodium nuclei of a NaNO3 single crystal as a virtual two-qubit system. The large quadrupolar coupling in comparison with the environmental interactions and the usage of strongly modulating pulses allow us to manipulate the system fast enough and at the same time keeping the decoherence reasonably slow. The experimental challenge is to characterize the "calculation" behavior of the quantum processor by process tomography which is here adapted to the quadrupolar spin system. The results of a selection of quantum gates and algorithms are presented as well as a detailed analysis of experimental results.