Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T15:01:23.140Z Has data issue: false hasContentIssue false
  • English
  • Français

The Many-Worlds Interpretation and Quantum Computation

Published online by Cambridge University Press:  01 January 2022

Armond Duwell
Get access Rights & Permissions [Opens in a new window]

Abstract

David Deutsch and others have suggested that the Many-Worlds Interpretation of quantum mechanics is the only interpretation capable of explaining the special efficiency quantum computers seem to enjoy over classical ones. I argue that this view is not tenable. Using a toy algorithm I show that the Many-Worlds Interpretation must crucially use the ontological status of the universal state vector to explain quantum computational efficiency, as opposed to the particular ontology of the MWI, that is, the computational histories of worlds. As such, any other interpretation that treats the state vector as representing real ontological features of a system can explain quantum speedup too.

Type
Philosophy of Physics: Quantum Information and Computation
Information
Philosophy of Science , Volume 74 , Issue 5: Proceedings of the 2006 Biennial Meeting of the Philosophy of Science Association. Part I: Contributed Papers. Edited by Cristina Bicchieri and Jason Alexander , December 2007 , pp. 1007 - 1018
Copyright
Copyright © The Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

‡

Thanks to Soazig Le Bihan for her critical comments on this paper.

References

Clifton, Robert K. (1996), “On What Being a World Takes Away”, On What Being a World Takes Away 63:S151–S158.Google Scholar
Deutsch, David (1997), The Fabric of Reality. New York: Penguin.Google Scholar
Duwell, Armond (2004), How to Teach an Old Dog New Tricks: Quantum Information, Quantum Computing, and the Philosophy of Physics. Ph.D. Dissertation. Pittsburgh: University of Pittsburgh.Google Scholar
Jozsa, Richard (2000), “Quantum Algorithms”, in Boumeester, D., Ekert, A., and Zeilinger, A. (eds.), The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation. Germany: Springer, 104–125.Google Scholar
Mermin, N. David (2000), “The Contemplation of Quantum Computation”, http://www.aip.org/pt/vol-53/iss-7/p11.html.CrossRefGoogle Scholar
Steane, Andrew (2003), “A Quantum Computer Needs Only One Universe”, A Quantum Computer Needs Only One Universe 34:469–478.Google Scholar