Search arXiv⌕ Search

arXiv · quant-ph/9812086

Principles and Demonstrations of Quantum Information Processing by NMR Spectroscopy

Abstract

This paper surveys our recent research on quantum information processing by nuclear magnetic resonance (NMR) spectroscopy. We begin with a geometric introduction to the NMR of an ensemble of indistinguishable spins, and then show how this geometric interpretation is contained within an algebra of multispin product operators. This algebra is used throughout the rest of the paper to demonstrate that it provides a facile framework within which to study quantum information processing more generally. The implementation of quantum algorithms by NMR depends upon the availability of special kinds of mixed states, called pseudo-pure states, and we consider a number of different methods for preparing these states, along with analyses of how they scale with the number of spins. The quantum-mechanical nature of processes involving such macroscopic pseudo-pure states also is a matter of debate, and in order to discuss this issue in concrete terms we present the results of NMR experiments which constitute a macroscopic analogue Hardy's paradox. Finally, a detailed product operator description is given of recent NMR experiments which demonstrate a three-bit quantum error correcting code, using field gradients to implement a precisely-known decoherence model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

T. F. Havel, S. S. Somaroo, C. -H. Tseng, D. G. Cory. 1999-07-03. Principles and Demonstrations of Quantum Information Processing by NMR Spectroscopy. https://arxiv.org/abs/quant-ph/9812086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Entanglement-based quantum communication may prevent tracking the message sender

The possibility of attaining current position of the message sender without person's consent seriously compromises the secrecy of correspondence. Classical communication systems cannot guarantee the security of communication against unwanted location tracking, because the sender must broadcast a signal at the moment of sending the message. The source of the signal could be always located, at least in principle. We show that quantum communication enables sending the message with pre-distributed entangled quantum systems, local weak measurements, time synchronization between the sender and the receiver and classical communication by the message receiver alone, therefore, physically securing the sender's location.

quant-ph↗

Fully Passive Quantum Conference Key Agreement

Quantum Conference Key Agreement (CKA) provides a secure method for multi-party communication. A recently developed interference-based prepare-and-measure quantum CKA possesses the advantages of measurement-device-independence, namely, being immune to side-channels from the detector side. Besides, it achieves good key rate performance, especially for high-loss channels, due to the use of single photon interference. Meanwhile, several fully passive QKD schemes have been proposed, which eliminate all side channels from the source modulation side. We extend the fully passive idea to an interference-based CKA, which has a high level of implementation security for many-user communication.

quant-ph↗

Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer

X-ray absorption spectroscopy (XAS) is a leading technique for understanding structural changes in advanced battery materials such as lithium-excess cathodes. However, extracting critical information like oxidation states from the experimental spectra requires expensive and time-consuming simulations. Building upon a recent proposal to simulate XAS using quantum computers, this work proposes a highly-optimized implementation of the time-domain algorithm for X-ray absorption. Among a host of improvements to Hamiltonian representation, circuit implementation, and measurement strategies, three optimizations are key to the efficiency of the algorithm. The first is the use of product formulas with the compressed double factorized form of the Hamiltonian. The second is recognizing that for spectroscopy applications, it is sufficient to control the error in the eigenvalues of the (approximate) Hamiltonian being implemented by the product formula, rather than the generic error on the full time evolution operator. Using perturbation theory to estimate this eigenvalue error, we find that significantly fewer Trotter steps are needed than expected from the time evolution error bound. The third is the choice of an optimized distribution of samples that takes advantage of the exponentially decaying Lorentzian kernel. Through constant factor resource estimates, we show that a challenging model Li$_4$Mn$_2$O cluster system with 18 spatial orbitals and 22 electrons in the active space can be simulated with 100 logical qubits and less than $4 \times 10^8$ Toffoli gates per circuit. Finally, the algorithm is implemented on a simulator, and the reconstructed spectrum is verified against a classical computational reference. The low cost of our algorithm makes it attractive to use on fault-tolerant quantum devices to accelerate the development and commercialization of high-capacity battery cathodes.

quant-ph↗