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

Quantum Algorithms Using Nuclear Magnetic Resonance Quantum Information Processor

Avik Mitra

Published Oct 1, 2007• 2 citations
OpenAlex

Abstract

The present work, briefly described below, consists of implementation of several quantum algorithms in an NMR Quantum Information Processor. Game theory gives us mathematical tools to analyze situations of conflict between two or more players who take decisions that influence their welfare. Classical game theory has been applied to various fields such as market strategy, communication theory, biological processes, foreign policies. It is interesting to study the behaviour of the games when the players share certain quantum correlations such as entanglement. Various games have been studied under the quantum regime with the hope of obtaining some insight into designing new quantum algorithms. Chapter 2 presents the NMR implementation of three such algorithms. Experimental NMR implementation given in this chapter are: (i) Three qubit ‘Dilemma’ game with corrupt sources’. The Dilemma game deals with the situation where three players have to choose between going/not going to a bar with a seating capacity of two. It is seen that in the players have a higher payoff if they share quantum correlations. However, the pay-off falls rapidly with increasing corruption in the source qubits. Here we report the experimental NMR implementation of the quantum version of the Dilemma game with and without corruption in the source qubits. (ii) Two qubit ‘Ulam’s game’. This is a two player game where one player has to find out the binary number thought by the other player. This problem can be solved with one query if quantum resources are used. This game has been implemented in a two qubit system in an NMR quantum information processor. (iii) Two qubit ‘Battle of Sexes’ game. This game deal with a situation where two players have conflicting choices but a deep desire to be together. This leads to a dilemma in the classical case. Quantum mechanically this dilemma is resolved and a unique solution emerges. The NMR implementation of the quantum version of this game is also given in this chapter. Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover’s search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, if one uses local adiabatic evolutions, their complexity is of the order √N (where N=2n) [37, 38]. In Chapter 3, the NMR implementation of (i) the Deutsch-Jozsa and the (ii) Grover’s search algorithm using local adiabatic evolution has been presented. In adiabatic algorithm, the system is first prepared in the equal superposition of all the possible states which is the ground state of the beginning Hamiltonian. The solution is encoded in the ground state of the final Hamiltonian. The system is evolved under a linear combination of the beginning and the final Hamiltonian. During each step of the…

Related papers

Implementation of adiabatic Deutsch-Jozsa algorithm by Nuclear Magnetic Resonance

Avik Mitra, Arindam Ghosh, Ranabir Das +2 more

Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.

•Mar 5, 2005•0 citations

Experimental implementation of quantum Ulam’s problem in a nuclear magnetic resonance quantum information processor

Avik Mitra, Anil Kumar

The Ulam’s problem is a two person game in which one of the player tries to search, in minimum queries, a number thought by the other player. Classically the problem scales polynomially with the size of the number. The quantum version of the Ulam’s problem has a query complexity that is independent of the dimension of the search space. \nThe experimental implementation of the quantum Ulam’s problem in a Nuclear Magnetic Resonance Information Processor with 3 quantum bits is reported here.

Journal of the Indian Institute of Science•Sep 1, 2009•1 citation

Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level on an NMR quantum-information processor

Kavita Dorai, Arvind, Anil Kumar

We describe the NMR implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits. The algorithm solves a generalization of the Deutsch problem, and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and Grover's search algorithm for two bits.

arXiv:quant-ph/0006103•Physical Review A•Feb 9, 2001•27 citations

Quantum Information Processing By NMR : Relaxation Of Pseudo Pure States, Geometric Phases And Algorithms

Arindam Ghosh

This thesis focuses on two aspects of Quantum Information Processing (QIP) and contains experimental implementation by Nuclear Magnetic Resonance (NMR) spectroscopy. The two aspects are: (i) development of novel methodologies for improved or fault tolerant QIP using longer lived states and geometric phases and (ii) implementation of certain quantum algorithms and theorems by NMR. In the first chapter a general introduction to Quantum Information Processing and its implementation using NMR as well as a description of NMR Hamiltonians and NMR relaxation using Redfield theory and magnetization modes are given. The second chapter contains a study of relaxation of Pseudo Pure States (PPS). PPS are specially prepared initial states from where computation begins. These states, being non-equilibrium states, relax with time and hence introduce error in computation. In this chapter we have studied the role of Cross-Correlations in relaxation of PPS. The third and fourth chapters, respectively report observation of cyclic and non-cyclic geometric phases. When the state of a qubit is subjected to evolution either adiabatically or non-adiabatically along the surface of the Bloch sphere, the qubit sometimes gain a phase factor apart from the dynamic phase. This is known as the Geometric phase, as it depends only on the geometry of the path of evolution. Geometric phase is used in Fault tolerant QIP. In these two chapters we have demonstrated how geometric phases of a qubit can be measured using NMR. The fifth and sixth chapters contain the implementations of “No Deletion” and “No Cloning” (quantum triplicator for partially known states) theorems. No Cloning and No Deletion theorems are closely related. The former states that an unknown quantum states can not be copied perfectly while the later states that an unknown state can not be deleted perfectly either. In these two chapters we have discussed about experimental implementation of the two theorems. The last chapter contains implementation of “Deutsch-Jozsa” algorithm in strongly dipolar coupled spin systems. Dipolar couplings being larger than the scalar couplings provide better opportunity for scaling up to larger number of qubits. However, strongly coupled systems offer few experimental challenges as well. This chapter demonstrates how a strongly coupled system can be used in NMR QIP.

•Aug 1, 2006•0 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•6 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
The present work, briefly described below, consists of implementation of several quantum algorithms in an NMR Quantum Information Processor.
Game theory gives us mathematical tools to analyze situations of conflict between two or more players who take decisions that influence their welfare. Classical game theory has been applied to various fields such as market strategy, communication theory, biological processes, foreign policies. It is interesting to study the behaviour of the games when the players share certain quantum correlations such as entanglement. Various games have been studied under the quantum regime with the hope of obtaining some insight into designing new quantum algorithms. Chapter 2 presents the NMR implementation of three such algorithms. Experimental NMR implementation given in this chapter are:
(i) Three qubit ‘Dilemma’ game with corrupt sources’. The Dilemma game deals with the situation where three players have to choose between going/not going to a bar with a seating capacity of two. It is seen that in the players have a higher payoff if they share quantum correlations. However, the pay-off falls rapidly with increasing corruption in the source qubits. Here we report the experimental NMR implementation of the quantum version of the Dilemma game with and without corruption in the source qubits.
(ii) Two qubit ‘Ulam’s game’. This is a two player game where one player has to find out the binary number thought by the other player. This problem can be solved with one query if quantum resources are used. This game has been implemented in a two qubit system in an NMR quantum information processor.
(iii) Two qubit ‘Battle of Sexes’ game. This game deal with a situation where two players have conflicting choices but a deep desire to be together. This leads to a dilemma in the classical case. Quantum mechanically this dilemma is resolved and a unique solution emerges. The NMR implementation of the quantum version of this game is also given in this chapter.
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover’s search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, if one uses local adiabatic evolutions, their complexity is of the order √N (where N=2n) [37, 38]. In Chapter 3, the NMR implementation of (i) the Deutsch-Jozsa and the (ii) Grover’s search algorithm using local adiabatic evolution has been presented. In adiabatic algorithm, the system is first prepared in the equal superposition of all the possible states which is the ground state of the beginning Hamiltonian. The solution is encoded in the ground state of the final Hamiltonian. The system is evolved under a linear combination of the beginning and the final Hamiltonian. During each step of the…
Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.
This thesis focuses on two aspects of Quantum Information Processing (QIP) and contains experimental implementation by Nuclear Magnetic Resonance (NMR) spectroscopy. The two aspects are: (i) development of novel methodologies for improved or fault tolerant QIP using longer lived states and geometric phases and (ii) implementation of certain quantum algorithms and theorems by NMR. In the first chapter a general introduction to Quantum Information Processing and its implementation using NMR as well as a description of NMR Hamiltonians and NMR relaxation using Redfield theory and magnetization modes are given. The second chapter contains a study of relaxation of Pseudo Pure States (PPS). PPS are specially prepared initial states from where computation begins. These states, being non-equilibrium states, relax with time and hence introduce error in computation. In this chapter we have studied the role of Cross-Correlations in relaxation of PPS. The third and fourth chapters, respectively report observation of cyclic and non-cyclic geometric phases. When the state of a qubit is subjected to evolution either adiabatically or non-adiabatically along the surface of the Bloch sphere, the qubit sometimes gain a phase factor apart from the dynamic phase. This is known as the Geometric phase, as it depends only on the geometry of the path of evolution. Geometric phase is used in Fault tolerant QIP. In these two chapters we have demonstrated how geometric phases of a qubit can be measured using NMR. The fifth and sixth chapters contain the implementations of “No Deletion” and “No Cloning” (quantum triplicator for partially known states) theorems. No Cloning and No Deletion theorems are closely related. The former states that an unknown quantum states can not be copied perfectly while the later states that an unknown state can not be deleted perfectly either. In these two chapters we have discussed about experimental implementation of the two theorems. The last chapter contains implementation of “Deutsch-Jozsa” algorithm in strongly dipolar coupled spin systems. Dipolar couplings being larger than the scalar couplings provide better opportunity for scaling up to larger number of qubits. However, strongly coupled systems offer few experimental challenges as well. This chapter demonstrates how a strongly coupled system can be used in NMR QIP.
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.
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.