A quantum computer, tapping into the quantum weirdness of the microscopic world, could in theory collapse calculations that would take billions of years on mundane supercomputers into a few seconds. Experimentally, though, quantum computers have been daunting. Now two groups of researchers have come up with a way to realize at least some of that potential by applying nuclear magnetic resonance—a standard technique in medical imaging and chemical analysis—to a liquid as simple as coffee (see Research Article on p. 350 ). By flipping, coupling, and reading out the spins of individual nuclei in the coffee, the strategy can turn it into a quantum logic gate and even a quantum integrated circuit.
A quantum computer, tapping into the quantum weirdness of the microscopic world, could in theory collapse calculations that would take billions of years on mundane supercomputers into a few seconds. Experimentally, though, quantum computers have been daunting. Now two groups of researchers have come up with a way to realize at least some of that potential by applying nuclear magnetic resonance—a standard technique in medical imaging and chemical analysis—to a liquid as simple as coffee (see Research Article on p. 350 ). By flipping, coupling, and reading out the spins of individual nuclei in the coffee, the strategy can turn it into a quantum logic gate and even a quantum integrated circuit.
We show that quantum computation is possible with mixed states instead of pure states as inputs. This is performed by embedding within the mixed state a subspace that transforms like a pure state and that can be identified by labelling it based on logical (spin), temporal, or spatial degrees of freedom. This permits quantum computation to be realized with bulk ensembles far from the ground state. Experimental results are presented for quantum gates and circuits implemented with liquid nuclear magnetic resonance techniques and verified by quantum state tomography.
If a computer could be built from quantum elements, which can exist in superpositions of many states rather than the 1s and 0s of conventional binary logic, then important hard problems could be solved rapidly. One example is the prime number factorization problem at the heart of modern encryption: given the product of two large primes, find the primes themselves. Another important problem is exhaustive search: given an unstructured list of items, quickly find the one that satisfies a certain property. A pair of Research Commentaries in this issue discuss some important new results in which simple quantum computers have been constructed with liquids probed by nuclear magnetic resonance techniques. The first, by
L. K. Grover
of Bell Labs, describes the theoretical situation and the implementation of an algorithm that he designed for exhaustive search. The second, by J. A. Jones of Oxford University, UK, discusses the recent experimental approaches to quantum computing with nuclear magnetic resonance.
Nuclear magnetic resonance (NMR) is a direct macroscopic manifestation of the quantum mechanics of the intrinsic angular momentum of atomic nuclei. It is best known for its extraordinary range of applications, which include molecular structure determination, medical imaging, and measurements of flow and diffusion rates. Most recently, liquid-state NMR spectroscopy has been found to provide a powerful experimental tool for the development and evaluation of the coherent control techniques needed for quantum information processing. This burgeoning new interdisciplinary field has the potential to achieve cryptographic, communications, and computational feats far beyond what is possible with known classical physics. Indeed, NMR has made the demonstration of many of these feats sufficiently simple to be carried out by high school summer interns working in our laboratory (see the last two authors). In this paper the basic principles of quantum information processing by NMR spectroscopy are described, along with several illustrative experiments suitable for incorporation into the undergraduate physics curriculum. These experiments are spin–spin interferometry, an implementation of the quantum Fourier transform, and the quantum simulation of a harmonic oscillator.
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.
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.