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 Letters

NMR Implementation of a Parallel Search Algorithm

Anatoly K. Khitrin, Vladimir L. Ermakov, B. M. Fung

Published Dec 19, 2002• 16 citations
Publisher

Abstract

Recently it has been shown that the dynamics of a cluster of dipolar-coupled spins can be manipulated to store and process a large amount of information in a parallel way [Chem. Phys. Lett. 360, 161 (2002)]]. Here it is further demonstrated that it is possible to realize a cascade of parallel bitwise operations on a spin cluster so that an algorithm of parallel search can be experimentally implemented by means of nuclear magnetic resonance.

DOI
10.1103/physrevlett.89.277902

Related papers

Implementation of parallel search algorithms using spatial encoding by nuclear magnetic resonance

Rangeet Bhattacharyya, Ranabir Das, K. V. Ramanathan +1 more

Information storage and database search are attractive areas in the field of nuclear magnetic resonance. Among the notable works reported earlier, an implementation of a parallel search algorithm in a dipolar coupled spin cluster has gained considerable attention [A. Khitrin, V. L. Ermakov, and B. M. Fung, Phys. Rev. Lett. 89, 277902 (2002)]. In this paper, we propose and exemplify that spatial encoding can be successfully utilized in realizing such parallel algorithms. We also introduce an improved protocol of the parallel search algorithm, which can be realized using spatial encoding. The methods have been demonstrated to perform a search operation using 215 bits.

Physical Review A•May 11, 2005•9 citations

Spins as qubits

Dieter Suter, T. S. Mahesh

Storing information in quantum mechanical degrees of freedom and processing it by unitary transformation promises a new class of computers that can efficiently solve problems for which no efficient classical algorithms are known. The most straightforward implementation of this type of information processing uses nuclear spins to store the information and nuclear magnetic resonance for processing it. We discuss the basics of quantum information processing by NMR, with an emphasis on two fields of research: the design and implementation of robust logical gate operations and the loss of quantum information, which is known as decoherence.

•Feb 5, 2008•37 citations

Controlling NMR spin systems for quantum computation

Jonathan A. Jones

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.

arXiv:2402.01308•Progress in Nuclear Magnetic Resonance Spectroscopy•Feb 9, 2024•23 citations

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

Dawei Lu, Jing Zhu, Ping Zou +5 more

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.

Physical Review A•Feb 9, 2010•31 citations

Spins as qubits: Quantum information processing by nuclear magnetic resonance

Dieter Suter, T. S. Mahesh

Storing information in quantum mechanical degrees of freedom and processing it by unitary transformation promises a new class of computers that can efficiently solve problems for which no efficient classical algorithms are known. The most straightforward implementation of this type of information processing uses nuclear spins to store the information and nuclear magnetic resonance for processing it. We discuss the basics of quantum information processing by NMR, with an emphasis on two fields of research: the design and implementation of robust logical gate operations and the loss of quantum information, which is known as decoherence.

The Journal of Chemical Physics•Feb 5, 2008•75 citations

Modelling Molecular Technologies for Nuclear Magnetic Resonance Quantum Computing

Mario Simoni

Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.

•Apr 1, 2020•0 citations
Recently it has been shown that the dynamics of a cluster of dipolar-coupled spins can be manipulated to store and process a large amount of information in a parallel way [Chem. Phys. Lett. 360, 161 (2002)]]. Here it is further demonstrated that it is possible to realize a cascade of parallel bitwise operations on a spin cluster so that an algorithm of parallel search can be experimentally implemented by means of nuclear magnetic resonance.
Information storage and database search are attractive areas in the field of nuclear magnetic resonance. Among the notable works reported earlier, an implementation of a parallel search algorithm in a dipolar coupled spin cluster has gained considerable attention [A. Khitrin, V. L. Ermakov, and B. M. Fung, Phys. Rev. Lett. 89, 277902 (2002)]. In this paper, we propose and exemplify that spatial encoding can be successfully utilized in realizing such parallel algorithms. We also introduce an improved protocol of the parallel search algorithm, which can be realized using spatial encoding. The methods have been demonstrated to perform a search operation using 215 bits.
Storing information in quantum mechanical degrees of freedom and processing it by unitary transformation promises a new class of computers that can efficiently solve problems for which no efficient classical algorithms are known. The most straightforward implementation of this type of information processing uses nuclear spins to store the information and nuclear magnetic resonance for processing it. We discuss the basics of quantum information processing by NMR, with an emphasis on two fields of research: the design and implementation of robust logical gate operations and the loss of quantum information, which is known as decoherence.
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.
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.
Storing information in quantum mechanical degrees of freedom and processing it by unitary transformation promises a new class of computers that can efficiently solve problems for which no efficient classical algorithms are known. The most straightforward implementation of this type of information processing uses nuclear spins to store the information and nuclear magnetic resonance for processing it. We discuss the basics of quantum information processing by NMR, with an emphasis on two fields of research: the design and implementation of robust logical gate operations and the loss of quantum information, which is known as decoherence.
Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.