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/0606220 · Physical Review A

Single qubit gates with jump and return sequences

M. D. Bowdrey, Jonathan A. Jones

Published Nov 15, 2006• 7 citations
arXivHTMLPDF

Abstract

We discuss the implementation of frequency selective rotations using sequences of hard pulses and delays. These rotations are suitable for implementing single qubit gates in nuclear magnetic resonance (NMR) quantum computers, but can also be used in other related implementations of quantum computing. We also derive methods for implementing hard pulses in the presence of moderate off-resonance effects, and describe a simple procedure for implementing a hard 180\ifmmode^\circ\else\textdegree\fi{} rotation in a two spin system. Finally, we show how these two approaches can be combined to produce more accurate frequency selective rotations.

DOI
10.1103/physreva.74.052324

Related papers

Tackling systematic errors in quantum logic gates with composite rotations

Holly K. Cummins, Gavin Llewellyn, Jonathan A. Jones

We describe the use of composite rotations to combat systematic errors in single-qubit quantum logic gates and discuss three families of composite rotations which can be used to correct off-resonance and pulse length errors. Although developed and described within the context of nuclear magnetic resonance quantum computing, these sequences should be applicable to any implementation of quantum computation.

arXiv:quant-ph/0208092•Physical Review A•Apr 15, 2003•250 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 relationship between ensemble quantum computing logical gates and NMR pulse sequence engineering exemplified by the SWAP operation

Thomas Schulte‐Herbrüggen, Ole Winneche Soørensen

This paper describes how to derive nuclear magnetic resonance (NMR) pulse sequences suitable as ensemble quantum computing logical gates by known systematic tools for design of pulse sequences in NMR spectroscopy. This is in contrast to the current trend of developing NMR pulse sequences for ensemble quantum computing independent of established NMR spectroscopic technology, although many of the pertinent spin manipulations are already known in NMR spectroscopy. The SWAP operation is discussed in detail and one version is only (2J)−1long, which compares favorably with 3(2J)−1 in a recent implementation (Linden N, Barjat H, Kupce E, Freeman R. Chem Phys Lett 1999; 307:198–204). Alternatively, the number of π pulses can be reduced in that sequence. © 2000 John Wiley & Sons, Inc. Concepts Magn Reson 12: 389–395, 2000

Concepts in Magnetic Resonance•Jan 1, 2000•7 citations

The relationship between ensemble quantum computing logical gates and NMR pulse sequence engineering exemplified by the SWAP operation

Thomas Schulte-Herbr�ggen, Ole W. Sørensen

This paper describes how to derive nuclear magnetic resonance (NMR) pulse sequences suitable as ensemble quantum computing logical gates by known systematic tools for design of pulse sequences in NMR spectroscopy. This is in contrast to the current trend of developing NMR pulse sequences for ensemble quantum computing independent of established NMR spectroscopic technology, although many of the pertinent spin manipulations are already known in NMR spectroscopy. The SWAP operation is discussed in detail and one version is only (2J)−1long, which compares favorably with 3(2J)−1 in a recent implementation (Linden N, Barjat H, Kupce E, Freeman R. Chem Phys Lett 1999; 307:198–204). Alternatively, the number of π pulses can be reduced in that sequence. © 2000 John Wiley & Sons, Inc. Concepts Magn Reson 12: 389–395, 2000

Concepts in Magnetic Resonance•Jan 1, 2000•14 citations

Composite pulses in NMR quantum computation

Jonathan A. Jones

I describe the use of techniques based on composite rotations to combat systematic errors in quantum logic gates. Although developed and described within the context of Nuclear Magnetic Resonance (NMR) quantum computing these sequences should be applicable to other implementations of quantum computation.

arXiv:0906.4719•Journal of the Indian Institute of Science•Jun 25, 2009•6 citations

Generalized methods for the development of quantum logic gates for an NMR quantum information processor

Mark D. Price, Shyamal S. Somaroo, A. E. Dunlop +2 more

Logic gates such as the controlled-NOT (c-NOT) and Toffoli gates play a key role in quantum information processing (QIP) and quantum computing. A natural extension of such gates would necessarily operate on one quantum bit (qubit) conditional on the state of the remaining qubits in the system. We show that such selective gates, termed $(\mathrm{controlled}{)}^{n}\ensuremath{-}\mathrm{NOT}$ gates, or ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates, are convenient in nuclear magnetic resonance (NMR) implementations of QIP and are straightforward to implement. NMR pulse sequences for these gates can be built using classical methods as well as insights from geometric algebra. These methods yield equivalent NMR pulse sequences for the generation of ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates for any number of control spins. In this work, a catalog of ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates for systems of as many as 16 spins is provided along with an experimental implementation of a ${\mathrm{c}}^{3}\ensuremath{-}\mathrm{N}\mathrm{O}\mathrm{T}$ gate on a four spin system, ${}^{13}\mathrm{C}$ alanine.

Physical Review A•Oct 1, 1999•65 citations
We discuss the implementation of frequency selective rotations using sequences of hard pulses and delays. These rotations are suitable for implementing single qubit gates in nuclear magnetic resonance (NMR) quantum computers, but can also be used in other related implementations of quantum computing. We also derive methods for implementing hard pulses in the presence of moderate off-resonance effects, and describe a simple procedure for implementing a hard 180\ifmmode^\circ\else\textdegree\fi{} rotation in a two spin system. Finally, we show how these two approaches can be combined to produce more accurate frequency selective rotations.
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.
This paper describes how to derive nuclear magnetic resonance (NMR) pulse sequences suitable as ensemble quantum computing logical gates by known systematic tools for design of pulse sequences in NMR spectroscopy. This is in contrast to the current trend of developing NMR pulse sequences for ensemble quantum computing independent of established NMR spectroscopic technology, although many of the pertinent spin manipulations are already known in NMR spectroscopy. The SWAP operation is discussed in detail and one version is only (2J)−1long, which compares favorably with 3(2J)−1 in a recent implementation (Linden N, Barjat H, Kupce E, Freeman R. Chem Phys Lett 1999; 307:198–204). Alternatively, the number of π pulses can be reduced in that sequence. © 2000 John Wiley & Sons, Inc. Concepts Magn Reson 12: 389–395, 2000
This paper describes how to derive nuclear magnetic resonance (NMR) pulse sequences suitable as ensemble quantum computing logical gates by known systematic tools for design of pulse sequences in NMR spectroscopy. This is in contrast to the current trend of developing NMR pulse sequences for ensemble quantum computing independent of established NMR spectroscopic technology, although many of the pertinent spin manipulations are already known in NMR spectroscopy. The SWAP operation is discussed in detail and one version is only (2J)−1long, which compares favorably with 3(2J)−1 in a recent implementation (Linden N, Barjat H, Kupce E, Freeman R. Chem Phys Lett 1999; 307:198–204). Alternatively, the number of π pulses can be reduced in that sequence. © 2000 John Wiley & Sons, Inc. Concepts Magn Reson 12: 389–395, 2000
Logic gates such as the controlled-NOT (c-NOT) and Toffoli gates play a key role in quantum information processing (QIP) and quantum computing. A natural extension of such gates would necessarily operate on one quantum bit (qubit) conditional on the state of the remaining qubits in the system. We show that such selective gates, termed $(\mathrm{controlled}{)}^{n}\ensuremath{-}\mathrm{NOT}$ gates, or ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates, are convenient in nuclear magnetic resonance (NMR) implementations of QIP and are straightforward to implement. NMR pulse sequences for these gates can be built using classical methods as well as insights from geometric algebra. These methods yield equivalent NMR pulse sequences for the generation of ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates for any number of control spins. In this work, a catalog of ${\mathrm{c}}^{n}\ensuremath{-}\mathrm{NOT}$ gates for systems of as many as 16 spins is provided along with an experimental implementation of a ${\mathrm{c}}^{3}\ensuremath{-}\mathrm{N}\mathrm{O}\mathrm{T}$ gate on a four spin system, 13C{}^{13}\mathrm{C}13C alanine.