| D. Aharonov, "Quantum Computation", e-print quant-ph/9812037. |
.... faster than a conventional computer [8 13] The fact that a QC might be more powerful than an ordinary computer is based on the notion that a quantum system can be in any superposition of states and that interference of these states allows exponentially many computations to be done in parallel [14]. This intrinsic parallelism might be used to solve other di#cult 1 problems as well, such as for example the calculation of the physical properties of quantum many body systems [15 18] In fact, part of Feynman s original motivation to consider QC s was that they might be used as a ....
D. Aharonov, "Quantum Computation", e-print quant-ph/9812037.
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