Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 1997 Mar 4;94(5):1634-9.
doi: 10.1073/pnas.94.5.1634.

Ensemble quantum computing by NMR spectroscopy

Affiliations

Ensemble quantum computing by NMR spectroscopy

D G Cory et al. Proc Natl Acad Sci U S A. .

Abstract

A quantum computer (QC) can operate in parallel on all its possible inputs at once, but the amount of information that can be extracted from the result is limited by the phenomenon of wave function collapse. We present a new computational model, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof. Such an expectation value QC can solve nondeterministic polynomial-time complete problems in polynomial time. This observation is significant precisely because the computational model can be realized, to a certain extent, by NMR spectroscopy on macroscopic ensembles of quantum spins, namely molecules in a test tube. This is made possible by identifying a manifold of statistical spin states, called pseudo-pure states, the mathematical description of which is isomorphic to that of an isolated spin system. The result is a novel NMR computer that can be programmed much like a QC, but in other respects more closely resembles a DNA computer. Most notably, when applied to intractable combinatorial problems, an NMR computer can use an amount of sample, rather than time, which grows exponentially with the size of the problem. Although NMR computers will be limited by current technology to exhaustive searches over only 15 to 20 bits, searches over as much as 50 bits are in principle possible, and more advanced algorithms could greatly extend the range of applicability of such machines.

PubMed Disclaimer

Figures

Figure 1
Figure 1
The four energy levels associated with two spins α and β, whose resonance frequencies are να and νβ (in Hz). The energy levels when there is no coupling between the spins are shown on the left, and those with a coupling of Jαβ (in Hz) on the right. The allowed transitions between the energy levels are indicated with dashed double-headed arrows.
Figure 2
Figure 2
The simulated NMR spectrum of a two-spin system, with να = 100 Hz, νβ = 400 Hz, and Jαβ = 40 Hz. From left to right, the four peaks in this spectrum correspond to the transitions 0 ↔ 1, 2 ↔ 3, 0 ↔ 2, and 1 ↔ 3 indicated in Fig. 1 (be forewarned, however, that NMR spectroscopists traditionally plot their spectra with frequency increasing from right to left). In practice, this spectrum would be obtained by applying a nonselective π/2 pulse to the equilibrium state and Fourier transforming the resulting signal.

References

    1. Adleman L. Science. 1994;266:1021–1024. - PubMed
    1. Shor P W. Proceedings of the 35th Symposium on Foundations of Computer Science. Los Alamitos, CA: IEEE Press; 1994. pp. 124–134.
    1. Cook S A. Proceedings of the Third Annual ACM Symposium on Theory of Computing. New York: Assoc. for Comput. Machinery; 1971. pp. 151–158.
    1. Karp R M. In: Complexity of Computer Computations. Miller R E, Thatcher J W, editors. New York: Plenum; 1972. pp. 85–103.
    1. Garey M R, Johnson D S. Computers and Intractability. San Francisco: Freeman; 1979.

Publication types

LinkOut - more resources