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

International Journal of Quantum Chemistry

Study of decoherence in a NMR quantum computer using tetrafluoropyridine

M. Tei, Yoichi Mizuno, Yoshinori Manmoto, Ryuichi Sawae, Kenichi Takarabe

Published Jan 1, 2003• 7 citations
Publisher

Abstract

Abstract Recently, quantum algorithms have been realized on a quantum computer by using a nuclear magnetic resonance technique. The nuclear magnetic resonance quantum computer (NMR‐QC) consists of nuclear spins of molecules that are coupled by J‐coupling to each other and the nuclear spins take a role of quantum bits (qubits). In performing quantum algorithms on NMR‐QC, the decoherence effects are a key problem. We studied the decoherence effects in the four‐qubit NMR‐QC using the fluorine nuclear spins of tetrafluoropyridine molecules. The nitrogen nuclear spin in the tetrafluoropyridine molecule increases the transverse relaxation rate of nearby fluorine nuclear spins about 10 times because of its quadrupole moment. In this study we evaluated the decoherence effects in the NMR‐QC by utilizing controlled‐not quantum gates. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem, 2003

DOI
10.1002/qua.10686

Related papers

Implementation of two‐qubit and three‐qubit quantum computers using liquid‐state nuclear magnetic resonance

Dorothea Golze, Maik Icker, Stefan T. A. Berger

Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.

Concepts in Magnetic Resonance Part A•Jan 1, 2012•7 citations

Experimental quantum computation with nuclear spins in liquid solution

James S. Harris, Lieven M. K. Vandersypen

Quantum computation offers the extraordinary promise of solving mathematical and physical problems which are simply beyond the reach of classical computers. However, the experimental realization of quantum computers is extremely challenging, because of the need to initialize, manipulate and measure the state of a set of coupled quantum systems while maintaining fragile quantum coherence. In this thesis work, we have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of experiments which culminated in the implementation of the simplest instance of Shor’s quantum algorithm for prime factorization (15 = 3 × 5), using a seven-spin molecule. This algorithm achieves an exponential advantage over the best known classical factoring algorithms and its implementation represents a milestone in the experimental exploration of quantum computation. These remarkable successes have been made possible by the synthesis of suitable molecules and the development of many novel techniques for initialization, coherent control and readout of the state of multiple coupled nuclear spins. Furthermore, we devised and implemented a model to simulate both unitary and decoherence processes in these systems, in order to study and quantify the impact of various technological as well as fundamental sources of errors. In summary, this work has given us a much needed practical appreciation of what it takes to build a quantum computer. Furthermore, while liquid NMR quantum computing has well-understood scaling limitations, many of the techniques that originated from this research may find use in other, perhaps more scalable quantum computer implementations.

•Jan 1, 2001•14 citations

Nuclear Spins as Quantum Testbeds: Singlet States, Quantum Correlations, and Delayed-choice Experiments

Soumya S. Roy

Nuclear Magnetic Resonance (NMR) forms a natural test-bed to perform quantum information processing (QIP) and has so far proven to be one of the most successful quantum information processors. The nuclear spins in a molecule treated as quantum bits or qubits which are the basic building blocks of a quantum computer. The development of NMR over half a century puts it in a platform where we can utilize its excellent control techniques over an ensemble of spin systems and perform quantum computation in a highly controlled way. Apart from a successful quantum information processor, NMR is also a highly powerful quantum platform where many of the potentially challenging quantum mechanical experiments can be performed.

arXiv:1210.7522•Oct 28, 2012•1 citation

Approaching five-bit NMR quantum computing

Raimund Marx, Amr F. Fahmy, John M. Myers +2 more

Nuclear-magnetic-resonance (NMR) quantum computation is a fruitful arena in which to develop and demonstrate an enhanced capability for quantum control over molecular systems, regardless of the prospects, which may be limited, for building a quantum computer superior to a conventional computer for any computing task. We demonstrate a five-bit NMR quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism, an example of the Deutsch-Jozsa problem. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule containing four distinct nuclear species, and the use of a multichannel spectrometer. Radio-frequency pulse sequences are described to execute controlled-NOT gates on two adjoining spins while leaving the other three spins essentially unaffected.

Physical Review A•Jun 15, 2000•106 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

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

J. A. Jones, M. Mosca

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.

arXiv:quant-ph/9801027•The Journal of Chemical Physics•Aug 1, 1998•399 citations
Abstract Recently, quantum algorithms have been realized on a quantum computer by using a nuclear magnetic resonance technique. The nuclear magnetic resonance quantum computer (NMR‐QC) consists of nuclear spins of molecules that are coupled by J‐coupling to each other and the nuclear spins take a role of quantum bits (qubits). In performing quantum algorithms on NMR‐QC, the decoherence effects are a key problem. We studied the decoherence effects in the four‐qubit NMR‐QC using the fluorine nuclear spins of tetrafluoropyridine molecules. The nitrogen nuclear spin in the tetrafluoropyridine molecule increases the transverse relaxation rate of nearby fluorine nuclear spins about 10 times because of its quadrupole moment. In this study we evaluated the decoherence effects in the NMR‐QC by utilizing controlled‐not quantum gates. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem, 2003
Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.
Quantum computation offers the extraordinary promise of solving mathematical and physical problems which are simply beyond the reach of classical computers. However, the experimental realization of quantum computers is extremely challenging, because of the need to initialize, manipulate and measure the state of a set of coupled quantum systems while maintaining fragile quantum coherence. In this thesis work, we have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of experiments which culminated in the implementation of the simplest instance of Shor’s quantum algorithm for prime factorization (15 = 3 × 5), using a seven-spin molecule. This algorithm achieves an exponential advantage over the best known classical factoring algorithms and its implementation represents a milestone in the experimental exploration of quantum computation. These remarkable successes have been made possible by the synthesis of suitable molecules and the development of many novel techniques for initialization, coherent control and readout of the state of multiple coupled nuclear spins. Furthermore, we devised and implemented a model to simulate both unitary and decoherence processes in these systems, in order to study and quantify the impact of various technological as well as fundamental sources of errors. In summary, this work has given us a much needed practical appreciation of what it takes to build a quantum computer. Furthermore, while liquid NMR quantum computing has well-understood scaling limitations, many of the techniques that originated from this research may find use in other, perhaps more scalable quantum computer implementations.
Nuclear Magnetic Resonance (NMR) forms a natural test-bed to perform quantum information processing (QIP) and has so far proven to be one of the most successful quantum information processors. The nuclear spins in a molecule treated as quantum bits or qubits which are the basic building blocks of a quantum computer. The development of NMR over half a century puts it in a platform where we can utilize its excellent control techniques over an ensemble of spin systems and perform quantum computation in a highly controlled way. Apart from a successful quantum information processor, NMR is also a highly powerful quantum platform where many of the potentially challenging quantum mechanical experiments can be performed.
Nuclear-magnetic-resonance (NMR) quantum computation is a fruitful arena in which to develop and demonstrate an enhanced capability for quantum control over molecular systems, regardless of the prospects, which may be limited, for building a quantum computer superior to a conventional computer for any computing task. We demonstrate a five-bit NMR quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism, an example of the Deutsch-Jozsa problem. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule containing four distinct nuclear species, and the use of a multichannel spectrometer. Radio-frequency pulse sequences are described to execute controlled-NOT gates on two adjoining spins while leaving the other three spins essentially unaffected.
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.
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.