David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Stanford Encyclopedia of Philosophy (2015)
Combining physics, mathematics and computer science, quantum computing has developed in the past two decades from a visionary idea to one of the most fascinating areas of quantum mechanics. The recent excitement in this lively and speculative domain of research was triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially "speed up" classical computation and factor large numbers into primes much more rapidly (at least in terms of the number of computational steps involved) than any known classical algorithm. Shor's algorithm was soon followed by several other algorithms that aimed to solve combinatorial and algebraic problems, and in the last few years theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor's algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premiss that all known classical worst case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in tremendous attempts to tackle the technological difficulties that await the realization of such a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995, Ekert and Jozsa 1996, Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts.
|Keywords||quantum computation algorithms computational complexity Church-Turing thesis|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Darren Abramson (2011). Philosophy of Mind Is (in Part) Philosophy of Computer Science. Minds and Machines 21 (2):203-219.
Similar books and articles
Guillaume Adenier, A. I͡U Khrennikov & Theo M. Nieuwenhuizen (eds.) (2006). Quantum Theory: Reconsideration of Foundations-3: Växjö, Sweden, 6-11 June 2005. American Institute of Physics.
Guillaume Adenier (ed.) (2007). Quantum Theory, Reconsideration of Foundations 4: Växjö (Sweden), 11-16 June, 2007. American Institute of Physics.
A. M. Steane (2003). A Quantum Computer Only Needs One Universe. Studies in History and Philosophy of Science Part B 34 (3):469-478.
Amit Hagar (2011). The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction. Morgan & Claypool Publishers.
Amit Hagar (2007). Quantum Algorithms: Philosophical Lessons. Minds and Machines 17 (2):233-247.
Amit Hagar & Alex Korolev (2007). Quantum Hypercomputation—Hype or Computation? Philosophy of Science 74 (3):347-363.
Bart D’Hooghe & Jaroslaw Pykacz (2004). Quantum Mechanics and Computation. Foundations of Science 9 (4):387-404.
Stuart R. Hameroff (2002). Quantum Computation in Brain Microtubules. Physical Review E 65 (6):1869--1896.
Tien D. Kieu (2002). Quantum Hypercomputation. Minds and Machines 12 (4):541-561.
Added to index2009-01-28
Total downloads29 ( #88,210 of 1,696,808 )
Recent downloads (6 months)3 ( #187,594 of 1,696,808 )
How can I increase my downloads?