NMR quantum computing

Abstract:

A powerful control method in experimental quantum computing is the use of spin echoes, employed to select a desired term in the system’s internal Hamiltonian, while refocusing others. Here, we address a more general problem, describing a method to not only turn on and off particular interactions but also to rescale their strengths so that we can generate any desired effective internal Hamiltonian. We propose an algorithm based on linear programming for achieving time-optimal rescaling solutions in fully coupled systems of tens of qubits, which can be modified to obtain near-time-optimal solutions for rescaling systems with hundreds of qubits.

Abstract:

The task of testing whether quantum theory applies to all physical systems and all scales requires considering situations where a quantum probe interacts with another system that need not obey quantum theory in full. Important examples include the cases where a quantum mass probes the gravitational field, for which a unique quantum theory of gravity does not yet exist, or a quantum field, such as light, interacts with a macroscopic system, such as a biological molecule, which may or may not obey unitary quantum theory. In this context a class of experiments has recently been proposed, where the non-classicality of a physical system that need not obey quantum theory (the gravitational field) can be tested indirectly by detecting whether or not the system is capable of entangling two quantum probes. Here we illustrate some of the subtleties of the argument, to do with the role of locality of interactions and of non-classicality, and perform proof-of-principle experiments illustrating the logic of the proposals, using a Nuclear Magnetic Resonance quantum computational platform with four qubits.

Abstract:

Since 2005, there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as nuclear magnetic resonance quantum information processors. These approaches, which build on the original gradient ascent pulse engineering algorithm, remain computationally intensive because of the need to calculate matrix exponentials for each time step in the control pulse. In this study, we discuss how the propagators for each time step can be approximated using the Trotter–Suzuki formula, and a further speedup achieved by avoiding unnecessary operations. The resulting procedure can provide substantial speed gain with negligible costs in the propagator error, providing a more practical approach to pulse engineering.