Foundations of Science 9 (4) (2004)
|Abstract||In quantum computation non classical features such as superposition states and entanglement are used to solve problems in new ways, impossible on classical digital computers.We illustrate by Deutsch algorithm how a quantum computer can use superposition states to outperform any classical computer. We comment on the view of a quantum computer as a massive parallel computer and recall Amdahls law for a classical parallel computer. We argue that the view on quantum computation as a massive parallel computation disregards the presence of entanglement in a general quantum computation and the non classical way in which parallel results are combined to obtain the final output.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Andreas Hüttemann (2005). Explanation, Emergence and Quantum-Entanglement. Philosophy of Science 72 (1):114-127.
Amit Hagar, Quantum Computing. Stanford Encyclopedia of Philosophy.
Jeffrey Bub (2008). Quantum Computation and Pseudotelepathic Games. Philosophy of Science 75 (4):458-472.
D. N. (2003). Copenhagen Computation. Studies in History and Philosophy of Science Part B 34 (3):511-522.
Michael E. Cuffaro (2012). Many Worlds, the Cluster-State Quantum Computer, and the Problem of the Preferred Basis. Studies in History and Philosophy of Science Part B 43 (1):35-42.
Stuart R. Hameroff (2002). Quantum Computation in Brain Microtubules. Physical Review E 65 (6).
M. A. (2003). A Quantum Computer Only Needs One Universe. Studies in History and Philosophy of Science Part B 34 (3):469-478.
Amit Hagar & Alex Korolev (2007). Quantum Hypercomputation—Hype or Computation? Philosophy of Science 74 (3):347-363.
Added to index2009-01-28
Total downloads11 ( #99,484 of 549,069 )
Recent downloads (6 months)0
How can I increase my downloads?