Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9903101 · Physical Review A

Classical model for bulk-ensemble NMR quantum computation

Rüdiger Schack, Carlton M. Caves

Published Dec 1, 1999• 80 citations
arXivHTMLPDF

Abstract

We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.

DOI
10.1103/physreva.60.4354

Related papers

Quantum Mechanical Nature in Liquid NMR Quantum Computing

Long Gui-Lu, Haiyang Yan, Yansong Li +6 more

The quantum nature of bulk ensemble NMR quantum computing — the center of recent heated debate, is addressed. Concepts of the mixed state and entanglement are examined, and the data in a two-qubit liquid NMR quantum computation are analyzed. The main points in this paper are: i) Density matrix describes the "state" of an average particle in an ensemble. It does not describe the state of an individual particle in an ensemble; ii) Entanglement is a property of the wave function of a microscopic particle (such as a molecule in a liquid NMR sample), and separability of the density matrix cannot be used to measure the entanglement of mixed ensemble; iii) The state evolution in bulk-ensemble NMR quantum computation is quantum-mechanical; iv) The coefficient before the effective pure state density matrix, є, is a measure of the simultaneity of the molecules in an ensemble. It reflects the intensity of the NMR signal and has no significance in quantifying the entanglement in the bulk ensemble NMR system. The decomposition of the density matrix into product states is only an indication that the ensemble can be prepared by an ensemble with the particles unentangled. We conclude that effective-pure-state NMR quantum computation is genuine, not just classical simulations.

arXiv:quant-ph/0007077•Communications in Theoretical Physics•Sep 15, 2002•9 citations

Ensemble quantum computing by NMR spectroscopy

David G. Cory, Amr F. Fahmy, Timothy F. Havel

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.

Proceedings of the National Academy of Sciences•Mar 4, 1997•956 citations

Bulk spin quantum computation: toward large-scale quantum computation

Isaac L. Chuang, Lieven M. K. Vandersypen, J. S. Harris

Quantum computation offers the potential for solving specific problems exponentially faster than the best classical machines, by virtue of its non-classical dynamics and information representation. Quantum mechanical bits (called 'qubits') can be both 0 and 1 at the same time, in which case the qubit is said to be in a superposition state. A quantum gate with input 0 or 1 gives the same output as a classical gate, but if the input is 0 and 1 simultaneously, the quantum gate performs the two corresponding operations simultaneously. Similarly, a 2-qubit gate with an input state prepared as a superposition of the 4 combinations 00, 01, 10 and 11, performs four simultaneous computations. In general, an N-qubit gate could perform 2/sup N/ computations at the same time. So as we increase the size of the system, the computational capacity of the apparatus goes up exponentially, compared to linearly for a classical computer. Using commercial NMR-spectrometers, simple quantum circuits are experimentally implemented consisting of multiple cascaded logic gates.

Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference•Nov 27, 2002•2 citations

Scalable NMR Quantum Computation

Leonard J. Schulman, Umesh V. Vazirani

Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially more steps would still be practical. We give an NMR implementation in which the signal-to-noise ratio depends only on features of NMR technology, not the size of the computer. This provides a means for NMR computation techniques to scale to sizes at which the exponential speedup enables quantum computation to solve problems beyond the capabilities of classical computers.

arXiv:quant-ph/9804060•Apr 24, 1998•70 citations

Ensemble quantum computing by NMR spectroscopy: product operators, pseudopure states, and an implementation of quantum error correction

Timothy F. Havel, Shyamal S. Somaroo, David G. Cory

Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 6, 1998•0 citations

Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing

Nicolas C. Menicucci, Carlton M. Caves

We construct a local realistic hidden-variable model that describes the states and dynamics of bulk-ensemble NMR information processing up to about 12 nuclear spins. The existence of such a model rules out violation of any Bell inequality, temporal or otherwise, in present high-temperature, liquid-state NMR experiments. The model does not provide an efficient description in that the number of hidden variables grows exponentially with the number of nuclear spins.

arXiv:quant-ph/0111152•Physical Review Letters•Apr 4, 2002•42 citations
We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.
The quantum nature of bulk ensemble NMR quantum computing — the center of recent heated debate, is addressed. Concepts of the mixed state and entanglement are examined, and the data in a two-qubit liquid NMR quantum computation are analyzed. The main points in this paper are: i) Density matrix describes the "state" of an average particle in an ensemble. It does not describe the state of an individual particle in an ensemble; ii) Entanglement is a property of the wave function of a microscopic particle (such as a molecule in a liquid NMR sample), and separability of the density matrix cannot be used to measure the entanglement of mixed ensemble; iii) The state evolution in bulk-ensemble NMR quantum computation is quantum-mechanical; iv) The coefficient before the effective pure state density matrix, є, is a measure of the simultaneity of the molecules in an ensemble. It reflects the intensity of the NMR signal and has no significance in quantifying the entanglement in the bulk ensemble NMR system. The decomposition of the density matrix into product states is only an indication that the ensemble can be prepared by an ensemble with the particles unentangled. We conclude that effective-pure-state NMR quantum computation is genuine, not just classical simulations.
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.
Quantum computation offers the potential for solving specific problems exponentially faster than the best classical machines, by virtue of its non-classical dynamics and information representation. Quantum mechanical bits (called 'qubits') can be both 0 and 1 at the same time, in which case the qubit is said to be in a superposition state. A quantum gate with input 0 or 1 gives the same output as a classical gate, but if the input is 0 and 1 simultaneously, the quantum gate performs the two corresponding operations simultaneously. Similarly, a 2-qubit gate with an input state prepared as a superposition of the 4 combinations 00, 01, 10 and 11, performs four simultaneous computations. In general, an N-qubit gate could perform 2/sup N/ computations at the same time. So as we increase the size of the system, the computational capacity of the apparatus goes up exponentially, compared to linearly for a classical computer. Using commercial NMR-spectrometers, simple quantum circuits are experimentally implemented consisting of multiple cascaded logic gates.
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially more steps would still be practical. We give an NMR implementation in which the signal-to-noise ratio depends only on features of NMR technology, not the size of the computer. This provides a means for NMR computation techniques to scale to sizes at which the exponential speedup enables quantum computation to solve problems beyond the capabilities of classical computers.
Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.