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

Bulletin of the American Physical Society

Optimizing Adiabaticity in NMR

Jonathan Vandermause, Chandrasekhar Ramanathan

Published Mar 15, 2016• 0 citations
OpenAlex

Related papers

Quantum Theory of NMR Adiabatic Pulses and Their Applications.

Yong Ke

•Jan 1, 1993•0 citations

Use of non-adiabatic geometric phase for quantum computing by NMR

Ranabir Das, Santosh Kumar, Anil Kumar

arXiv:quant-ph/0503032•Journal of Magnetic Resonance•Sep 23, 2005•16 citations

NMR realization of adiabatic quantum algorithms for the modified Simon problem

Long Yu, Guanru Feng, Yongchao Tang +2 more

Having the advantages of inherent robustness and fault tolerance, adiabatic quantum algorithms have attracted much attention in recent years. In this paper, we report the NMR experimental realization of adiabatic algorithms for the modified Simon's problem in a NMR quantum information processor. We first realized an adiabatic quantum algorithm by Rao [Phys. Rev. A 67, 052306 (2003)] and then proposed a quantum algorithm by using the method of enhanced symmetry of the Hamiltonian given in Schaller and Schtzhold [Quantum Inf. Comput. 10, 109 (2010)]. We demonstrated this symmetry-enhanced algorithm in experiment. We studied the effects of the number of Trotter evolution steps on the validity of adiabatic evolution and decoherence. In practical applications, a trade-off between pulse imperfection and adiabatic requirement must be made in the Trotter evolution step number. An optimal evolution step number and run time were indicated by our results. The experimental demonstration also showed that the symmetry-enhanced algorithm gave a better performance.

Physical Review A•Jul 9, 2013•11 citations

A prototype quantum computer using nuclear spins in liquid solution

James S. Harris, Isaac L. Chuang, Matthias Steffen

Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.

•Jan 1, 2003•1 citation

Quantum Computing and NMR

Jonathan A. Jones

Springer eBooks•Jan 1, 1999•9 citations

Experimental investigation of a quantum Otto heat engine with shortcuts to adiabaticity implemented using counter-adiabatic driving

Krishna Shende, Matreyee Kandpal, Arvind +1 more

The finite time operation of a quantum Otto heat engine leads to a trade-off between efficiency and output power, which is due to the deviation of the system from the adiabatic path. This trade-off caveat can be bypassed by using the shortcut-to-adiabaticity protocol. We experimentally implemented a quantum Otto heat engine using spin-1/2 nuclei on a nuclear magnetic resonance (NMR) quantum processor. We investigated its performance using the shortcut-to-adiabaticity technique via counter-adiabatic driving with the inclusion of the cost to perform the shortcut. We use two different metrics that incorporate the cost of shortcut-to-adiabaticity to define engine efficiency and experimentally analyze which one is more appropriate for the NMR platform. We found a significant improvement in the performance of the quantum Otto heat engine driven by shortcut-to-adiabaticity, as compared to the non-adiabatic heat engine.

arXiv:2412.20194•Dec 28, 2024•4 citations
Having the advantages of inherent robustness and fault tolerance, adiabatic quantum algorithms have attracted much attention in recent years. In this paper, we report the NMR experimental realization of adiabatic algorithms for the modified Simon's problem in a NMR quantum information processor. We first realized an adiabatic quantum algorithm by Rao [Phys. Rev. A 67, 052306 (2003)] and then proposed a quantum algorithm by using the method of enhanced symmetry of the Hamiltonian given in Schaller and Schtzhold [Quantum Inf. Comput. 10, 109 (2010)]. We demonstrated this symmetry-enhanced algorithm in experiment. We studied the effects of the number of Trotter evolution steps on the validity of adiabatic evolution and decoherence. In practical applications, a trade-off between pulse imperfection and adiabatic requirement must be made in the Trotter evolution step number. An optimal evolution step number and run time were indicated by our results. The experimental demonstration also showed that the symmetry-enhanced algorithm gave a better performance.
Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.
The finite time operation of a quantum Otto heat engine leads to a trade-off between efficiency and output power, which is due to the deviation of the system from the adiabatic path. This trade-off caveat can be bypassed by using the shortcut-to-adiabaticity protocol. We experimentally implemented a quantum Otto heat engine using spin-1/2 nuclei on a nuclear magnetic resonance (NMR) quantum processor. We investigated its performance using the shortcut-to-adiabaticity technique via counter-adiabatic driving with the inclusion of the cost to perform the shortcut. We use two different metrics that incorporate the cost of shortcut-to-adiabaticity to define engine efficiency and experimentally analyze which one is more appropriate for the NMR platform. We found a significant improvement in the performance of the quantum Otto heat engine driven by shortcut-to-adiabaticity, as compared to the non-adiabatic heat engine.