| I.L. Chuang, N. Gershenfeld, M.G. Kubinec, and D.W. Leung, \Bulk quantum computation with nuclear magnetic resonance: theory and experiment," Proc. R. Soc. London, Ser. A 454, 447 (1998). |
....300 K) the initial state of the sample is the thermal equilibrium state exp ( H) Z , where H is the Hamiltonian of a single molecule. On a more formal level, the inner workings of an NMR quantum computer can be described using the concept of an e ective pure state, which is de ned as follows [22]. De nition 3.5.1 Let H be a Hilbert space. Consider a unit vector 2 H , a channel T : S(H ) S(H ) and a set fX i g of observables in B(H ) Then the state 2 S(H ) is called an e ective pure state for with respect to T and fX i g if there exists another channel and a constant such ....
....) S(H ) and a set fX i g of observables in B(H ) Then the state 2 S(H ) is called an e ective pure state for with respect to T and fX i g if there exists another channel and a constant such that, for each i, tr [T ( X i ] h j T (X i ) i: 3. 21) 60 Here is a concrete example [22] to illustrate this abstract de nition. Let T be a bistochastic channel, i.e. T (1I) 1I. Then, for any 2 (0; 1) the state : 1 )1I= dimH j ih j (3.22) is an e ective pure state, with T = T , for the pure state j ih j with respect to T and any set of traceless observables. ....
[Article contains additional citation context not shown here]
I.L. Chuang, N. Gershenfeld, M.G. Kubinec, and D.W. Leung, \Bulk quantum computation with nuclear magnetic resonance: theory and experiment," Proc. R. Soc. London, Ser. A 454, 447 (1998).
....based on QTM. In fact, the methods using iron traps, a single photon, or quantum dots are proposed to realize basic elements of quantum computers. Among others, NMR (Nuclear Magnetic Resonance) offers an appealing prospect for implementation of quantum computers because of a number of reasons [3, 4, 5, 6, 8, 9, 11, 10, 13, 14, 15, 16, 17, 18, 19, 20, 21, 24, 25, 27]. But, quantum computations performed on NMR is slightly defferent from those performed on QTMs as mentioned below. 1 One tape cell of a Turing machine can contain a symbol 0 or 1, i.e. one bit of information. On the other hand, one tape cell of a QTM can be in an arbitrary superposition of the ....
Chuang, I. L., Gershenfeld, N., Kubinec, M.G., and Leung, D.W. : "Bulk Quantum Computation with Nuclear Magnetic Resonance : Theory and Experiment", Proc. R. Soc. Lond., Vol. A 454, pp.447-467 (1998). 10
....and observation of quantum dynamics. The most complex demonstrations of quantum information processing to date have in fact been achieved by nuclear magnetic resonance or NMR spectroscopy on the spin 1 2 nuclei in macroscopic liquid samples containing an ensemble of molecules at room temperature. [12, 13, 15, 28]. Under these conditions the state of the nuclear spins is almost completely random, but information can nevertheless be stored in their joint statistics. This information is processed by combining the intra molecular spin Hamiltonian with external radio frequency fields. These fields are ....
I. L. Chuang, N. Gershenfeld, M. G. Kubinec, and D. W. Leung, Bulk quantum computation with nuclear magnetic resonance: Theory and experiment, Proc. R. Soc. Lond. A, 454 (1998), pp. 447-- 467.
No context found.
Chuang, I., Gershenfeld, N., Kubinec, M., Leung, D., "Bulk quantum computation with nuclear magnetic resonance: theory and experiment." Proc. R. Soc. Lond. A 454:447-467.
No context found.
I. L. Chuang, N. Gershenfeld, M. Kubinec, and D. Leung. Bulk quantum computation with nuclear magnetic resonance: Theory and experiments. Proceedings of the Royal Society of London A, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC