Bulk Spin-Resonance Quantum Computation
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...
|Published in:||Science, Vol. 275, No. 5298 (1997), p. 350-356|
|Other Involved Persons:|
|Item Description:||Copyright: Copyright 1997 American Association for the Advancement of Science|
|QR Code:||Show QR Code|