Nuclear magnetic resonance quantum computer

Short description: Proposed spin-based quantum computer implementation

Molecule of alanine used in NMR implementation of quantum computing. Qubits are implemented by spin states of the black carbon atoms

Nuclear magnetic resonance quantum computing (NMRQC)[1] is one of the several proposed approaches for constructing a quantum computer, that uses the spin states of nuclei within molecules as qubits. The quantum states are probed through the nuclear magnetic resonances, allowing the system to be implemented as a variation of nuclear magnetic resonance spectroscopy. NMR differs from other implementations of quantum computers in that it uses an ensemble of systems, in this case molecules, rather than a single pure state.

Initially the approach was to use the spin properties of atoms of particular molecules in a liquid sample as qubits - this is known as liquid state NMR (LSNMR). This approach has since been superseded by solid state NMR (SSNMR) as a means of quantum computation.

## Contents

* 1 Liquid state NMR
* 2 Solid state NMR
* 3 History
* 4 Mathematical representation
* 5 See also
* 6 References

## Liquid state NMR

The ideal picture of liquid state NMR (LSNMR) quantum information processing (QIP) is based on a molecule in which some of its atom's nuclei behave as spin-⁠1/2⁠ systems.[2] Depending on which nuclei we are considering they will have different energy levels and different interaction with its neighbours and so we can treat them as distinguishable qubits. In this system we tend to consider the inter-atomic bonds as the source of interactions between qubits and exploit these spin-spin interactions to perform 2-qubit gates such as CNOTs that are necessary for universal quantum computation. In addition to the spin-spin interactions native to the molecule an external magnetic field can be applied (in NMR laboratories) and these impose single qubit gates. By exploiting the fact that different spins will experience different local fields we have control over the individual spins.

The picture described above is far from realistic since we are treating a single molecule. NMR is performed on an ensemble of molecules, usually with as many as 10^15 molecules. This introduces complications to the model, one of which is introduction of decoherence. In particular we have the problem of an open quantum system interacting with a macroscopic number of particles near thermal equilibrium (~mK to ~300 K). This has led the development of decoherence suppression techniques that have spread to other disciplines such as trapped ions. The other significant issue with regards to working close to thermal equilibrium is the mixedness of the state. This required the introduction of ensemble quantum processing, whose principal limitation is that as we introduce more logical qubits into our system we require larger samples in order to attain discernable signals during measurement. Dimethylphosphite can be used for liquid NMR quantum computing providing 2 qubits,[3] and Iodotrifluoroethylene can provide 3 qubits.[4]

## Solid state NMR

Solid state NMR (SSNMR), unlike LSNMR uses a solid state sample, for example a nitrogen vacancy diamond lattice rather than a liquid sample.[5] This has many advantages such as lack of molecular diffusion decoherence, lower temperatures can be achieved to the point of suppressing phonon decoherence and a greater variety of control operations that allow us to overcome one of the major problems of LSNMR that is initialisation. Moreover, as in a crystal structure we can localize precisely the qubits, we can measure each qubit individually, instead of having an ensemble measurement as in LSNMR.

## History

The use of nuclear spins for quantum computing was first discussed by Seth Lloyd and by David DiVincenzo.[6][7][8] Manipulation of nuclear spins for quantum computing using liquid state NMR was introduced independently by Cory, Fahmy and Havel[9][10] and Gershenfeld and Chuang[11] in 1997. Some early success was obtained in performing quantum algorithms in NMR systems due to the relative maturity of NMR technology. For instance, in 2001 researchers at IBM reported the successful implementation of Shor's algorithm in a 7-qubit NMR quantum computer.[12] However, even from the early days, it was recognized that NMR quantum computers would never be very useful due to the poor scaling of the signal-to-noise ratio in such systems.[13] More recent work, particularly by Caves and others, shows that all experiments in liquid state bulk ensemble NMR quantum computing to date do not possess quantum entanglement, thought to be required for quantum computation. Hence NMR quantum computing experiments are likely to have been only classical simulations of a quantum computer.[14]

## Mathematical representation

The ensemble is initialized to be the thermal equilibrium state (see quantum statistical mechanics). In mathematical parlance, this state is given by the density matrix:

ρ=e−βHTr⁡(e−βH),

where H is the hamiltonian matrix of an individual molecule and

β=1kT

where k is the Boltzmann constant and T the temperature. That the initial state in NMR quantum computing is in thermal equilibrium is one of the main differences compared to other quantum computing techniques, where they are initialized in a pure state. Nevertheless, suitable mixed states are capable of reflecting quantum dynamics which lead to Gershenfeld and Chuang to term them "pseudo-pure states".[11]

Operations are performed on the ensemble through radio frequency (RF) pulses applied perpendicular to a strong, static magnetic field, created by a very large magnet. See nuclear magnetic resonance.

Consider applying a magnetic field along the z axis, fixing this as the principal quantization axis, on a liquid sample. The Hamiltonian for a single spin would be given by the Zeeman or chemical shift term:

H=μBz=Izω

where Iz is the operator for the z component of the nuclear angular momentum, and ω is the resonance frequency of the spin, which is proportional to the applied magnetic field.

Considering the molecules in the liquid sample to contain two spin-⁠1/2⁠ nuclei, the system Hamiltonian will have two chemical shift terms and a dipole coupling term:

H=ω1Iz1+ω2Iz2+2J12Iz1Iz2

Control of a spin system can be realized by means of selective RF pulses applied perpendicular to the quantization axis. In the case of a two spin system as described above, we can distinguish two types of pulses: "soft" or spin-selective pulses, whose frequency range encompasses one of the resonant frequencies only, and therefore affects only that spin; and "hard" or nonselective pulses whose frequency range is broad enough to contain both resonant frequencies and therefore these pulses couple to both spins. For detailed examples of the effects of pulses on such a spin system, the reader is referred to Section 2 of work by Cory et al.[15]

## See also

* Kane quantum computer

## References

1. ↑ "Nuclear Magnetic Resonance Quantum Computing (NMRQC)". http://web.physics.ucsb.edu/~msteffen/nmrqc.htm.
2. ↑ Neil Gershenfeld; Isaac L. Chuang (1998). "Quantum computing with molecules". Scientific American 278 (6): 66–71. doi:10.1038/scientificamerican0698-66. Bibcode: 1998SciAm.278f..66G. http://cba.mit.edu/docs/papers/98.06.sciqc.pdf.
3. ↑ https://epjquantumtechnology.springeropen.com/articles/10.1140/epjqt/s40507-021-00109-8
4. ↑ https://ieeexplore.ieee.org/document/9789970
5. ↑ "Diamond Sparkles in Quantum Computing". https://www.aps.org/publications/apsnews/200805/diamond.cfm.
6. ↑ Seth Lloyd (1993). "A Potentially Realizable Quantum Computer". Science 261 (5128): 1569–1571. doi:10.1126/science.261.5128.1569. PMID 17798117. Bibcode: 1993Sci...261.1569L.
7. ↑ David DiVincenzo (1995). "A Two-bit gates are universal for quantum computation". Phys. Rev. A 51 (2): 1015–1022. doi:10.1103/PhysRevA.51.1015. PMID 9911679. Bibcode: 1995PhRvA..51.1015D.
8. ↑ David DiVincenzo (1995). "Quantum computation". Science 270 (5234).
9. ↑ Cory, David G.; Fahmy, Amr F.; Havel, Timothy F. (1996). "Nuclear Magnetic Resonance Spectroscopy: An Experimentally Accessible Paradigm for Quantum Computing" (in en). Phys-Comp 96, Proceedings of the Fourth Workshop on Physics and Computation, edited by T.Toffoli, M.Biafore, and J.Leao (New England Complex Systems Institute. pp. 87–91.
10. ↑ Cory, David G.; Fahmy, Amr F.; Havel, Timothy F. (1997-03-04). "Ensemble quantum computing by NMR spectroscopy" (in en). Proceedings of the National Academy of Sciences 94 (5): 1634–1639. doi:10.1073/pnas.94.5.1634. ISSN 0027-8424. PMID 9050830. Bibcode: 1997PNAS...94.1634C.
11. ↑ 11.0 11.1 Gershenfeld, Neil A.; Chuang, Isaac L. (1997-01-17). "Bulk Spin-Resonance Quantum Computation" (in en). Science 275 (5298): 350–356. doi:10.1126/science.275.5298.350. ISSN 0036-8075. PMID 8994025.
12. ↑ "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance". Nature 414 (6866): 883–887. 2001. doi:10.1038/414883a. PMID 11780055. Bibcode: 2001Natur.414..883V.
13. ↑ Warren WS (1997). "The usefulness of NMR quantum computing". Science 277 (5332): 1688–1689. doi:10.1126/science.277.5332.1688.
14. ↑ "Local realistic model for the dynamics of bulk-ensemble NMR information processing". Physical Review Letters 88 (16). 2002. doi:10.1103/PhysRevLett.88.167901. PMID 11955265. Bibcode: 2002PhRvL..88p7901M.
15. ↑ Cory D. (1998). "Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing". Physica D 120 (1–2): 82–101. doi:10.1016/S0167-2789(98)00046-3. Bibcode: 1998PhyD..120...82C.

* v
* t
* e

Quantum information science

General|

* Quantum computing
* Qubit
* physical vs. logical
* DiVincenzo's criteria
* Quantum information
* Quantum programming
* Quantum processors
* Cloud-based quantum computing
* Timeline of quantum computing

Theorems|

* Bell's theorem
* Gleason's theorem
* Gottesman–Knill theorem
* Holevo's theorem
* Margolus–Levitin theorem
* No-broadcast theorem
* No-cloning theorem
* No-communication theorem
* No-deleting theorem
* No-hiding theorem
* No-teleportation theorem
* PBR theorem
* Quantum threshold theorem

Quantum
communication|

* Quantum capacity
* Classical capacity
* Entanglement-assisted classical capacity
* Quantum channel
* Quantum network
* Quantum cryptography
* Quantum key distribution
* BB84
* SARG04
* Three-stage quantum cryptography protocol
* Quantum teleportation
* Superdense coding
* LOCC
* Entanglement distillation

Quantum algorithms|

* Universal quantum simulator
* Deutsch–Jozsa algorithm
* Grover's algorithm
* Quantum Fourier transform
* Shor's algorithm
* Simon's problem
* Quantum phase estimation algorithm
* Quantum counting algorithm
* Quantum annealing
* Quantum algorithm for linear systems of equations
* Amplitude amplification

Quantum
complexity theory|

* Quantum Turing machine
* EQP
* BQP
* QMA
* PostBQP
* QIP

Quantum
computing models|

* Quantum circuit
* Quantum logic gate
* One-way quantum computer
* cluster state
* Adiabatic quantum computation
* Topological quantum computer

Quantum
error correction|

* Stabilizer codes
* Entanglement-Assisted Quantum Error Correction
* Shor code
* Steane code
* CSS code
* Quantum convolutional codes
* Toric code

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical quantum computing
* KLM protocol
* Boson sampling

|

Ultracold atoms|

* Trapped ion quantum computer
* Optical lattice

Spin-based|

* Nuclear magnetic resonance QC
* Kane QC
* Loss–DiVincenzo QC
* Nitrogen-vacancy center

Superconducting
quantum computing|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Software|

* libquantum
* OpenQASM
* Q#
* Qiskit
* IBM Q Experience

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Nuclear magnetic resonance quantum computer. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Physics:Nuclear_magnetic_resonance_quantum_computer&oldid=4335816"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template