A new scheme is proposed which will permit electron spin resonance pulse techniques to be used to realize a quantum computer with a 100 qbits, or more. The computation is performed on effective pure states which correspond to off-diagonal blocks of the density matrix. Described is a scheme which very efficiently performs the preparation stage and which permits ``pseudo-projective measurement'' to be made on the output. With such measurements all members of the ensemble remain coherent.
A new scheme is proposed which will permit electron spin resonance pulse techniques to be used to realize a quantum computer with a 100 qbits, or more. The computation is performed on effective pure states which correspond to off-diagonal blocks of the density matrix. Described is a scheme which very efficiently performs the preparation stage and which permits ``pseudo-projective measurement'' to be made on the output. With such measurements all members of the ensemble remain coherent.
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.
Quantum computation remains an enormously appealing but elusive goal. It is appealing because of its potential to perform superfast algorithms, such as finding prime factors in polynomial time, but also elusive because of the difficulty of simultaneously manipulating quantum degrees of freedom while preventing environmentally induced decoherence. A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density matrix of a much lower dimensional pure state. A complete prescription for quantum computing is given for such a system.
Nuclear spins have long coherence times and are easily manipulated using radio-frequency pulses. Single molecules, with spin-spin couplings provided by electronic bonds, are thus attractive physical systems for performing quantum computation. However, observation of small nuclear induction signals typically requires a large number, , of molecules. This presents fundamental problems for quantum computation, which traditionally requires pure state inputs, and strong measurements. Quantum computation with nuclear magnetic resonance was made possible by the invention of techniques which create effective pure states from thermal mixtures, and algorithmic steps which make strong measurements unnecessary. The theoretical basis for quantum computation with bulk materials, and experimental results demonstrating implementation of simple quantum gates and circuits are described.
As an ensemble scheme of solid-state NMR quantum computers the extension of Kane's many-qubits silicon scheme based on the array of 31 P donor atoms are spaced lengthwise of the strip gates is considered. The possible planar topology of such ensemble quantum computer is suggested. The estimation of the output NMR signal was performed and it was shown that for the number N>=10^5 of ensemble elements involving L~10^3 qubits each, the standard NMR methods are usable. As main mechanisms of decoherence for low temperature (<0.1K), the adiabatic processes of random modulation of qubit resonance frequency determined by secular part of nuclear spin hyperfine interaction with electron magnetic moment of basic atom and dipole-dipole interaction with nuclear moments of neighboring impurity atoms was considered, It was made estimations of allowed concentrations of magnetic impurities and of spin temperature whereby the required decoherence suppression is obtained. Semiclassical decoherence model of two qubit entangled states is also presented. As another variant of the solid-state ensemble quantum computer, the gateless architecture of cellular-automaton with antiferromagnetically ordered electron spins is also discussed here.
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.
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.