Linked bibliography for the SEP article "Quantum Computing" by Amit Hagar and Michael Cuffaro

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

  • Aaronson, S., 2013a. Quantum Computing Since Democritus. New York: Cambridge University Press. (Scholar)
  • –––, 2013b. “Why Philosophers Should Care About Computational Complexity,” in Computability: Turing, Gödel, Church, and Beyond, edited by B. J. Copeland, C. J. Posy, and O. Shagrir, 261–327, Cambridge, MA: MIT Press. (Scholar)
  • Adamyan, V. A., C. S. Calude, and B. S. Pavlov, 2004. “Transcending the Limits of Turing Computability,” in Quantum Information and Complexity, 119–37. (Scholar)
  • Adleman, L. M., 1994. “Molecular Computation of Solutions to Combinatorial Problems,” Science, 266: 1021–4. (Scholar)
  • Agrawal, M., N. Kayal, and N. Saxena, 2004. “PRIMES Is in P,” Annals of Mathematics, 160: 781–93. (Scholar)
  • Aharonov, D., 1999. “Quantum Computation,” in Annual Reviews of Computational Physics Vi, 259–346, Singapore: World Scientific. (Scholar)
  • Aharonov, D., and M. Ben-Or, 1997. “Fault-Tolerant Computation with Constant Error,” in Proceedings of the Twenty-Ninth ACM Symposium on the Theory of Computing, Vol. 176. (Scholar)
  • Aharonov, D., V. Jones, and Z. Landau, 2009. “A Polynomial Quantum Algorithm for Approximating the Jones Polynomial,” Algorithmica, 55: 395–421. (Scholar)
  • Aharonov, D., W. Van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, 2008. “Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation,” SIAM Review, 50: 755–87. (Scholar)
  • Albert, D., 1983. “On Quantum Mechanical Automata,” Phys. Lett. A, 98: 249. (Scholar)
  • Alicki, R., D. Lidar, and P. Zinardi, 2006. “Internal Consistency of Fault Tolerant Quantum Error Correction,” Phys. Rev. A, 73: 052311. (Scholar)
  • Alléaume, R., C. Branciard, J. Bouda, T. Debuisschert, M. Dianati, N. Gisin, M. Godfrey, et al., 2014. “Using Quantum Key Distribution for Cryptographic Purposes: A Survey,” Theoretical Computer Science, 560: 62–81. (Scholar)
  • Allen, J. A., J. Barrett, D. C Horsman, C. M. Lee, and R. W. Spekkens, 2017. “Quantum Common Causes and Quantum Causal Models,” Physical Review X, 7: 031021. (Scholar)
  • Andréka, H., J. X. Madarász, I. Németi, P. Németi, and G. Székely, 2018. “Relativistic Computation,” in Cuffaro & Fletcher 2018, 195–218. (Scholar)
  • Arora, S., and B. Barak, 2009. Computational Complexity: A Modern Approach, Cambridge: Cambridge University Press. (Scholar)
  • Barenco, A., C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A Smolin, and H. Weinfurter, 1995. “Elementary Gates for Quantum Computation,” Phys. Rev. A, 52: 3457–67. (Scholar)
  • Bassi, A., S. L. Adler, and E. Ippoliti, 2004. “Towards Quantum Superpositions of a Mirror: Stochastic Collapse Analysis,” Phys. Rev. Lett., 94: 030401. (Scholar)
  • Bennett, C. H., E. Bernstein, G. Brassard, and U. Vazirani, 1997. “Strengths and Weaknesses of Quantum Computing,” SIAM Journal on Computing, 26: 1510–23. (Scholar)
  • Bensaude-Vincent, B., 2009. “The Chemists’ Style of Thinking,” Berichte Zur Wissenschaftsgeschichte, 32: 365–78. (Scholar)
  • Bernien, H., S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, et al., 2017. “Probing Many-Body Dynamics on a 51-Atom Quantum Simulator,” Nature, 551: 579. (Scholar)
  • Bernstein, E., and U. Vazirani, 1997. “Quantum Complexity Theory,” SIAM Journal on Computing, 26: 1411–73. (Scholar)
  • Biham, E., G. Brassard, D. Kenigsberg, and T. Mor, 2004. “Quantum Computing Without Entanglement,” Theoretical Computer Science, 320: 15–33. (Scholar)
  • Bub, J., 2006b. “Quantum Information and Computing,” in Handbook of the Philosophy of Science, Philosophy of Physics, Part A, edited by J. Butterfield and J. Earman, 555–660, Amsterdam: Elsevier. (Scholar)
  • –––, 2010. “Quantum Computation: Where Does the Speed-up Come from?” In Philosophy of Quantum Information and Entanglement, edited by A. Bokulich and G. Jaeger, 231–46, Cambridge: Cambridge University Press. (Scholar)
  • –––, 2016. Bananaworld, Quantum Mechanics for Primates, Oxford: Oxford University Press. (Scholar)
  • Chiribella, G., and R. W. Spekkens, 2016. Quantum Theory: Informational Foundations and Foils, Dordrecht: Springer. (Scholar)
  • Cirac, J. I., and P. Zoller, 1995. “Quantum Computations with Cold Trapped Ions,” Phys. Rev. Lett., 74: 4091–4. (Scholar)
  • Cobham, A., 1965. “The Intrinsic Computational Difficulty of Functions,” in Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, 24–30, Amsterdam: North-Holland. (Scholar)
  • Cook, S. A., 1971. “The Complexity of Theorem-Proving Procedures,” in Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151–58, New York: ACM. (Scholar)
  • Copeland, B. J., 2002. “Hypercomputation,” Minds and Machines, 12: 461–502. (Scholar)
  • –––, 2018. “Zuse’s Thesis, Gandy’s Thesis, and Penrose’s Thesis,” in Cuffaro & Fletcher 2018, 39–59. (Scholar)
  • Costa, F., and S. Shrapnel, 2016. “Quantum Causal Modelling,” New Journal of Physics, 18: 063032. (Scholar)
  • Cuffaro, M. E., 2012. “Many Worlds, the Cluster-State Quantum Computer, and the Problem of the Preferred Basis,” Studies in History and Philosophy of Modern Physics, 43: 35–42. (Scholar)
  • –––, 2015. “How-Possibly Explanations in (Quantum) Computer Science,” Philosophy of Science, 82: 737–48. (Scholar)
  • –––, 2017. “On the Significance of the Gottesman-Knill Theorem,” The British Journal for the Philosophy of Science, 68: 91–121. (Scholar)
  • –––, 2018a. “Reconsidering No-Go-Theorems from a Practical Perspective,” The British Journal for the Philosophy of Science, 69: 633–55. (Scholar)
  • –––, 2018b. “Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer,” in Technology and Mathematics: Philosophical and Historical Investigations, edited by S. O. Hansson, 253–82, Cham: Springer. (Scholar)
  • –––, forthcoming. “Information Causality, the Tsirelson Bound, and the ‘Being-Thus’ of Things,” Studies in History and Philosophy of Modern Physics, first online 13 November 2018; 10.1016/j.shpsb.2018.05.001 (Scholar)
  • Cuffaro, M. E., and S. C. Fletcher (eds.), 2018. Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge: Cambridge University Press. (Scholar)
  • Davis, M., 1958. The Undecidable, New York: Dover. (Scholar)
  • –––, 2003. “The Myth of Hypercomputation,” in Alan Turing, Life and Legacy of a Great Thinker, edited by C. Teuscher, 195–212, New York: Springer. (Scholar)
  • Deutsch, D., 1985. “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer,” Proc. Roy. Soc. Lond. A, 400: 97–117. (Scholar)
  • –––, 1989. “Quantum Computational Networks,” Proc. Roy. Soc. Lond. A, 425: 73–90. (Scholar)
  • –––, 1997. The Fabric of Reality, New York: Penguin. (Scholar)
  • –––, 2013. “The Philosophy of Constructor Theory,” Synthese, 190: 4331–59. (Scholar)
  • Deutsch, D., and R. Jozsa. 1992. “Rapid Solution of Problems by Quantum Computation,” Proc. Roy. Soc. Lond. A, 439: 553–58. (Scholar)
  • Dewdney, A. K., 1984. “On the Spaghetti Computer and Other Analog Gadgets for Problem Solving,” Scientific American, 250: 19–26. (Scholar)
  • DiVincenzo, D., 1995. “Two-Bit Gates Are Universal for Quantum Computation,” Phys. Rev. A, 51: 1015–22. (Scholar)
  • –––, 2000. “The Physical Implementation of Quantum Computation,” Fortschritte Der Physik, 48: 771–83. (Scholar)
  • Duwell, A., 2007. “The Many-Worlds Interpretation and Quantum Computation,” Philosophy of Science, 74: 1007–18. (Scholar)
  • –––, 2018. “How to Make Orthogonal Positions Parallel: Revisiting the Quantum Parallelism Thesis,” in Cuffaro & Fletcher 2018, 83–102. (Scholar)
  • –––, forthcoming. “Understanding Quantum Phenomena and Quantum Theories,” Studies in History and Philosophy of Modern Physics, first online 27 July 2918; doi:10.1016/j.shpsb.2018.06.002 (Scholar)
  • Edmonds, J., 1965. “Paths, Trees, and Flowers,” Canadian Journal of Mathematics, 17: 449–67. (Scholar)
  • Ekert, A., and R. Jozsa, 1996. “Quantum Computation and Shor’s Factoring Algorithm,” Reviews of Modern Physics, 68: 733–53. (Scholar)
  • Farhi, E., J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, 2001. “A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem,” Science 292: 472–75. (Scholar)
  • Felline, L., 2016. “It’s a Matter of Principle: Scientific Explanation in Information‐Theoretic Reconstructions of Quantum Theory,” Dialectica, 70: 549–75. (Scholar)
  • –––, forthcoming-a. “Quantum Theory Is Not Only About Information,” Studies in History and Philosophy of Modern Physics, first online 22 June 2018; doi:10.1016/j.shpsb.2018.03.003
  • –––, forthcomingn-b. “The Measurement Problem and Two Dogmas About Quantum Mechanics,” in Quantum, Probability, Logic: Itamar Pitowsky’s Work and Influence, edited by M. Hemmo and O. Shenker, Dordrecht: Springer.
  • Feynman, R. P., 1982. “Simulating Physics with Computers,” International Journal of Theoretical Physics, 21: 467–88. (Scholar)
  • Fodor, J., 1974. “Special Sciences,” Synthese 2: 97–115. (Scholar)
  • Fodor, J., and Z. Pylyshyn, 1988. “Connectionism and Cognitive Architecture, a Critical Analysis,” Cognition 28: 3–71. (Scholar)
  • Fortnow, L., 1994. “The Role of Relativization in Complexity Theory,” Bulletin of the European Association for Theoretical Computer Science, 52: 229–44. (Scholar)
  • –––, 2003. “One Complexity Theorist’s View of Quantum Computing,” Theoretical Computer Science, 292: 597–610. (Scholar)
  • Freedman, M. H., 1998. “P/NP and the Quantum Field Computer,” Proc. Natl. Acad. Sci., 95: 98–101. (Scholar)
  • Freedman, M. H., A. Kitaev, and Z. Wang, 2002. “Simulation of Topological Field Theories by Quantum Computers,” Communications in Mathematical Physics, 227: 587–603. (Scholar)
  • Gandy, R., 1980. “Church’s Thesis and Principles for Mechanisms,” in The Kleene Symposium (Studies in Logic and the Foundations of Mathematics), edited by J. Barwise, H. J. Keisler, and K. Kunen, 123–48, Amsterdam: Elsevier. (Scholar)
  • Garey, M. R., and D. S. Johnson, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: WH Freeman. (Scholar)
  • Giblin, P., 1993. Primes and Programming, Cambridge: Cambridge University Press. (Scholar)
  • Gödel, K., 1956. “Private Letter to John von Neumann, 20 March 1956; translated by A. S. Wensinger in M. Sipser, “The History and Status of the P Versus NP Question”, in Proceedings of the Twenty-Fourth Annual ACM Symposium Theory of Computing, New York: ACM, 1992, 603–618. (Scholar)
  • Gottesman, D., 1999. “The Heisenberg Representation of Quantum Computers,” in Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, edited by S. P. Corney, R. Delbourgo, and P. D. Jarvis, 32–43, Cambridge, MA: International Press. (Scholar)
  • Gottesman, D., and I. Chuang, 1999. “Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations,” Nature, 402: 390–93. (Scholar)
  • Grover, L. K., 1996. “A Fast Quantum Mechanical Algorithm for Database Search,” in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC ’96), 212–19, New York, NY, USA: Association for Computing Machinery. (Scholar)
  • Hagar, A., 2003. “A Philosopher Looks at Quantum Information Theory,” Philosophy of Science, 70: 752–75. (Scholar)
  • –––, 2007. “Quantum Algorithms: Philosophical Lessons,” Minds & Machines, 17: 233–47. (Scholar)
  • –––, 2009. “Active Fault-Tolerant Quantum Error Correction: The Curse of the Open System,” Philosophy of Science, 76: 506–35. (Scholar)
  • –––, 2016. “Ed Fredkin and the Physics of Information: An Inside Story of an Outsider Scientist,” Information and Culture, 51: 419–43. (Scholar)
  • Hagar, A., and M. Hemmo, 2006. “Explaining the Unobserved: Why Quantum Mechanics Ain’t Only About Information,” Foundations of Physics, 36: 1295–1324. (Scholar)
  • Hagar, A., and A. Korolev, 2007. “Quantum Hypercomputation – Hype or Computation?Philosophy of Science, 74: 347–63. (Scholar)
  • Haroche, S., and J. M. Raimond, 1996. “Quantum Computing: Dream or Nightmare?” Physics Today, 8: 51–52. (Scholar)
  • Hartmanis, J., and R. E. Stearns, 1965. “On the Computational Complexity of Algorithms,” Transactions of the American Mathematical Society, 117: 285–306. (Scholar)
  • Hausman, D. M., and J. Woodward, 1999. “Independence, Invariance, and the Causal Markov Condition,” The British Journal for the Philosophy of Science, 50: 521–83. (Scholar)
  • Henderson, L., forthcoming. “Quantum Reaxiomatisations and Information-Theoretic Interpretations of Quantum Theory,” Studies in History and Philosophy of Modern Physics, first online 9 July 2018; doi:10.1016/j.shpsb.2018.06.003 (Scholar)
  • Hermann, G., 2017. “Natural-Philosophical Foundations of Quantum Mechanics (1935),” in Grete Hermann: Between Physics and Philosophy, edited by E. Crull and G. Bacciagaluppi, translated by E. Crull, 239–78. Dordrecht: Springer. (Scholar)
  • Hewitt-Horsman, C., 2009. “An Introduction to Many Worlds in Quantum Computation,” Foundations of Physics, 39: 869–902. (Scholar)
  • Hogarth, M., 1994. “Non-Turing Computers and Non-Turing Computability,” in PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 126–38. Philosophy of Science Association. (Scholar)
  • Holevo, A. S., 1973. “Bounds for the Quantity of Information Transmitted by a Quantum Communication Channel,” Problemy Peredachi Informatsii, 9: 3–11. English translation in Problems of Information Transmission 9: 177–83, 1973. (Scholar)
  • Horsman, C., A. G. Fowler, S. Devitt, and R. Van Meter, 2012. “Surface Code Quantum Computing by Lattice Surgery,” New Journal of Physics, 14: 123011. (Scholar)
  • Howard, M., J. Wallman, V. Veitch, and J. Emerson, 2014. “Contextuality Supplies the ‘Magic’ for Quantum Computation,” Nature, 510: 351–55. (Scholar)
  • Ingarden, R. S., 1976. “Quantum Information Theory,” Rep. Math. Phys., 10: 43–72. (Scholar)
  • Jozsa, R., 1997. “Entanglement and Quantum Computation,” in The Geometric Universe, edited by S. A. Huggett, L. J. Mason, K. P. Tod, S. T. Tsou, and N. M. J. Woodhouse, Ch. 27. Oxford: Oxford University Press. (Scholar)
  • –––, 2006. “An Introduction to Measurement Based Quantum Computation,” NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-from Theory to Experiment, 199: 137–58. (Scholar)
  • Kieu, T. D., 2002. “Quantum Hypercomputability,” Minds and Machines, 12: 541–61. (Scholar)
  • –––, 2004. “A Reformulation of Hilbert’s Tenth Problem Through Quantum Mechanics,” Proc. Royal Soc. A 460: 1535–45. (Scholar)
  • Koberinski, A., and M. Müller, 2018. “Quantum Theory as a Principle Theory: Insights from an Information Theoretic Reconstruction,”; in Cuffaro & Fletcher 2018, 257–80. (Scholar)
  • Ladyman, J., 2018. “Intension in the Physics of Computation: Lessons from the Debate About Landauer’s Principle,” in Cuffaro & Fletcher (2018), 219–39. (Scholar)
  • Leung, D. W., 2004. “Quantum Computation by Measurements,” International Journal of Quantum Information, 2: 33–43. (Scholar)
  • Levin, L., 2003. “Polynomial Time and Extravagant Models,” Problems of Information Transmission, 39: 2594–7. (Scholar)
  • –––, 1999. “Good Dynamics Versus Bad Kinematics: Is Entanglement Needed for Quantum Computation?” Phys. Rev. Lett., 87: 047901. (Scholar)
  • Lipton, R., 1995. “Using DNA to Solve NP-Complete Problems,” Science, 268: 542–45. (Scholar)
  • Lupacchini, Rossella, 2018. “Church’s Thesis, Turing’s Limits, and Deutsch’s Principle,” in Cuffaro & Fletcher 2018, 60–82. (Scholar)
  • Manin, Y., 1980. Computable and Uncomputable, Moscow: Sovetskoye Radio. (Scholar)
  • Mermin, David N., 2007. Quantum Computer Science: An Introduction, Cambridge University Press. (Scholar)
  • Messiah, A., 1961. Quantum Mechanics, Vol. II, New York: Interscience Publishers. (Scholar)
  • Moore, C., 1990. “Unpredictability and Undecidability in Dynamical Systems,” Phys. Rev. Lett., 64: 2354–7. (Scholar)
  • Myers, J., 1997. “Can a Universal Quantum Computer Be Fully Quantum?” Phys. Rev. Lett., 78: 1823–4. (Scholar)
  • Myrvold, W. C., 2010. “From Physics to Information Theory and Back,” in Philosophy of Quantum Information and Entanglement, edited by Alisa Bokulich and Gregg Jaeger, 181–207, Cambridge: Cambridge University Press. (Scholar)
  • –––, 2011. “Statistical Mechanics and Thermodynamics: A Maxwellian View,” Studies in History and Philosophy of Modern Physics, 42: 237–43. (Scholar)
  • –––, 2016. “Lessons of Bell’s Theorem: Nonlocality, Yes; Action at a Distance, Not Necessarily”. In Mary Bell & Shan Gao (eds.), Quantum Nonlocality and Reality: 50 Years of Bell’s Theorem, pp. 238–260, Cambridge: Cambridge University Press. (Scholar)
  • Nielsen, M., 2003. “Quantum Computation by Measurement and Quantum Memory,” Phys. Lett. A, 308: 96–100. (Scholar)
  • Nielsen, M. A., and I. L. Chuang, 2000. Quantum Computation and Quantum Information, Cambridge: Cambridge University Press. (Scholar)
  • Nielsen, M. A., and C. M. Dawson, 2005. “Fault-Tolerant Quantum Computation with Cluster States,” Physical Review A, 71: 042323. (Scholar)
  • Pearle, P., 1997. “True Collapse and False Collapse,” in Quantum Classical Correspondence: Proceedings of the 4th Drexel Symposium on Quantum Nonintegrability, Philadelphia, Pa, Usa, September 8–11, 1994, edited by D. H. Feng and B. L. Hu, 51–68, Cambridge: International Press. (Scholar)
  • Pitowsky, I., 1989. Quantum Probability — Quantum Logic, Hemsbach: Springer. (Scholar)
  • –––, 1990. “The Physical Church Thesis and Physical Computational Complexity,” Iyyun: The Jerusalem Philosophical Quarterly, 39: 81–99. (Scholar)
  • –––, 1994. “George Boole’s ‘Conditions of Possible Experience’ and the Quantum Puzzle,” British Journal for the Philosophy of Science, 45: 99–125. (Scholar)
  • –––, 1996. “Laplace’s Demon Consults an Oracle: The Computational Complexity of Prediction,” Studies in History and Philosophy of Modern Physics, 27: 161–80. (Scholar)
  • –––, 2002. “Quantum Speed-up of Computations,” Philosophy of Science, 69: S168–S177. (Scholar)
  • Pitowsky, I., and O. Shagrir, 2003. “Physical Hypercomputation and the Church-Turing Thesis,” Minds and Machines, 13: 87–101. (Scholar)
  • Poplavskii, R. P., 1975. “Thermodynamical Models of Information Processing (in Russian),” Uspekhi Fizicheskikh Nauk, 115: 465–501. (Scholar)
  • Pour-el, M., and I. Richards, 1981. “The Wave Equation with Computable Initial Data Such That Its Unique Solution Is Not Computable,” Advances in Mathematics, 29: 215–39. (Scholar)
  • Preskill, J., 1998. “Quantum Computing: Pro and Con,” Proc. Roy. Soc. Lond. A, 454: 469–86. (Scholar)
  • –––, 2018. “Quantum Computing in the NISQ Era and Beyond,” Quantum, 2: 79. (Scholar)
  • Pylyshyn, Z. 1984. Computation and Cognition: Toward a Foundation for Cognitive Science, Cambridge: MIT Press. (Scholar)
  • Rabin, M., 1976. “Probabilistic Algorithms,” in Algorithms and Complexity: New Directions and Recent Results, edited by J. Traub, 23–39, New York: Academic Press. (Scholar)
  • Raussendorf, R., and H. J. Briegel, 2002. “Computational Model Underlying the One-Way Quantum Computer,” Quantum Information and Computation, 2: 443–86. (Scholar)
  • Raussendorf, R., D. E. Browne, and H. J. Briegel, 2003. “Measurement-Based Quantum Computation on Cluster States,” Physical Review A, 68: 022312. (Scholar)
  • Raussendorf, R., J. Harrington, and K. Goyal, 2008. “Topological Fault-Tolerance in Cluster State Quantum Computation,” New Journal of Physics, 9: 1–24. (Scholar)
  • Reichardt, B. W., 2004. “The Quantum Adiabatic Optimization Algorithm and Local Minima,” in Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, 502–10. (Scholar)
  • Rivest, R. L., A. Shamir, and L. Adleman, 1978. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, 21: 120–26. (Scholar)
  • Schlick, M., 1961. “Causality in Contemporary Physics I (1931),” Translated by D. Rynin. The British Journal for the Philosophy of Science, 12: 177–193. (Scholar)
  • –––, 1962. “Causality in Contemporary Physics II (1931),” Translated by D. Rynin. The British Journal for the Philosophy of Science, 12: 281–298. (Scholar)
  • Shor, P. W., 1994. “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,” Proceedings of the 35th Annual Symposium on Foundations of Computer Science (SFCS ’94), 124–34, Washington, D.C.: IEEE Computer Society. (Scholar)
  • Scheme for Reducing Decoherence in Quantum, 1995. “Scheme for Reducing Decoherence in Quantum Computer Memory,” Phys. Rev. A., 52: 2493–6. (Scholar)
  • –––, 2004. “Progress in Quantum Algorithms,” Quantum Information Processing, 3: 5–13. (Scholar)
  • Shor, P., and D. DiVincenzo, 1996. “Fault Tolerant Error Correction with Efficient Quantum Codes,” Phys. Rev. Lett., 77: 3260–3. (Scholar)
  • Shrapnel, S., 2017. “Discovering Quantum Causal Models,” The British Journal for the Philosophy of Science, 70: 1–25. (Scholar)
  • Sieg, W., and J. Byrnes, 1999. “An Abstract Model for Parallel Computations,” The Monist, 82: 150–64. (Scholar)
  • Simon, D. R., 1994. “On the Power of Quantum Computation,” in 1994 Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 116–23, Los Alamitos, CA: IEEE Press. (Scholar)
  • Spekkens, R. W., 2007. “Evidence for the Epistemic View of Quantum States: A Toy Theory,” Phys. Rev. A, 75: 032110. (Scholar)
  • Steane, A. M., 1996. “Multiple Particle Interference and Quantum Error Correction,” Proc. Roy. Soc. Lond. A, 452: 2551–77. (Scholar)
  • –––, 2003. “A Quantum Computer Only Needs One Universe,” Studies in History and Philosophy of Modern Physics, 34: 469–78. (Scholar)
  • Tabakin, F., 2017. “Model Dynamics for Quantum Computing,” Annals of Physics, 383: 33–78. (Scholar)
  • Timpson, C. G., 2013. Quantum Information Theory & the Foundations of Quantum Mechanics, Oxford: Oxford University Press. (Scholar)
  • Turing, A. M., 1936. “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society. Second Series, s2–42: 230–65. (Scholar)
  • Unruh, W. G., 1995. “Maintaining Coherence in Quantum Computers,” Phys. Rev. A, 51: 992–97. (Scholar)
  • Van Fraassen, B. C., 1982. “The Charybdis of Realism: Epistemological Implications of Bell’s Inequality,” Synthese, 52: 25–38. (Scholar)
  • Van Meter, R., and C. Horsman, 2013. “A Blueprint for Building a Quantum Computer,” Communications of the ACM 56: 16–25. (Scholar)
  • Vergis, A., K. Steiglitz, and B. Dickinson, 1986. “The Complexity of Analog Computation,” Mathematics and Computers in Simulation, 28: 91–113. (Scholar)
  • Vidal, G., 2003. “Efficient Classical Simulation of Slightly Entangled Quantum Computations,” Phys. Rev. Lett., 91: 147902. (Scholar)
  • Wallace, D., 2012. The Emergent Multiverse, Oxford: Oxford University Press. (Scholar)
  • –––, 2014. “Thermodynamics as Control Theory,” Entropy, 16: 699–725. (Scholar)
  • Wiesner, S., 1983. “Conjugate Coding,” Sigact News, 18: 78–88. (Scholar)
  • Witten, E., 1989. “Quantum Field Theory and the Jones Polynomial,” Comm. Math. Phys., 121: 351–99. (Scholar)
  • Wolfram, S., 1985. “Undecidability and Intractability in Theoretical Physics,” Phys. Rev. Lett., 54: 735. (Scholar)
  • Woodward, J., 2007. “Causation with a Human Face,” in Causation, Physics, and the Constitution of Reality: Russell’s Republic Revisited, H. Price and R. Corry (eds.), Oxford: Oxford University Press. (Scholar)

Generated Thu Aug 6 04:10:26 2020