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

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 B. J. Copeland, C. J. Posy, & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond, pp. 261–327, Cambridge, MA: MIT Press. (Scholar)
Adamyan, V. A., Calude, C. S., and Pavlov, B. S., 2004, “Transcending the Limits of Turing Computability,” in Quantum Information and Complexity, pp. 119–137. (Scholar)
Adlam, Emily, 2023, “Is There Causation in Fundamental Physics? New Insights from Process Matrices and Quantum Causal Modelling,” Synthese, 201: 152. (Scholar)
Adleman, L. M., 1994, “Molecular Computation of Solutions to Combinatorial Problems,” Science, 266: 1021–1024. (Scholar)
Aharonov, D., 1999, “Quantum Computation,” in Annual Reviews of Computational Physics VI, pp. 259–346, Singapore: World Scientific. (Scholar)
Aharonov, D., and Ben-Or, M., 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., Jones, V., and Landau, Z., 2009, “A Polynomial Quantum Algorithm for Approximating the Jones Polynomial,” Algorithmica, 55: 395–421. (Scholar)
Aharonov, Dorit, Gao, Xun, Landau, Zeph, Liu, Yunchao, and Vazirani, Umesh, 2023, “A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 945–957, New York, NY, USA: Association for Computing Machinery. (Scholar)
Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., and Regev, O., 2008, “Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation,” SIAM Review, 50: 755–787. (Scholar)
Albash, T., and Lidar, D. A., 2018, “Adiabatic Quantum Computation,” Reviews of Modern Physics, 90: 015002-1-01502-64. (Scholar)
Alicki, R., Lidar, D., and Zinardi, P., 2006, “Internal Consistency of Fault Tolerant Quantum Error Correction,” Phys. Rev. A, 73: 052311. (Scholar)
Alléaume, R., Branciard, C., Bouda, J., Debuisschert, T., Dianati, M., Gisin, N., … others, 2014, “Using Quantum Key Distribution for Cryptographic Purposes: A Survey,” Theoretical Computer Science, 560: 62–81. (Scholar)
Allen, J. A., Barrett, J., Horsman, D. C., Lee, C. M., and Spekkens, R. W., 2017, “Quantum Common Causes and Quantum Causal Models,” Physical Review X, 7: 031021. (Scholar)
Andréka, H., Madarász, J. X., Németi, I., Németi, P., and Székely, G., 2018, “Relativistic Computation,” in Cuffaro & Fletcher (2018), pp. 195–218. (Scholar)
Arora, S., and Barak, B., 2009, Computational Complexity: A Modern Approach, Cambridge: Cambridge University Press. (Scholar)
Arute, F., Arya, K., Babbush, R., and coauthors, 2019, “Quantum Supremacy Using a Programmable Superconducting Processor,” Nature, 574: 505–510. (Scholar)
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., … Weinfurter, H., 1995, “Elementary Gates for Quantum Computation,” Phys. Rev. A, 52: 3457–3467. (Scholar)
Bassi, A., Adler, S. L., and Ippoliti, E., 2004, “Towards Quantum Superpositions of a Mirror: Stochastic Collapse Analysis,” Phys. Rev. Lett., 94: 030401. (Scholar)
Bennett, C. H., Bernstein, E., Brassard, G., and Vazirani, U., 1997, “Strengths and Weaknesses of Quantum Computing,” SIAM Journal on Computing, 26: 1510–1523. (Scholar)
Bensaude-Vincent, B., 2009, “The Chemists’ Style of Thinking,” Berichte Zur Wissenschaftsgeschichte, 32: 365–378. (Scholar)
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., … others, 2017, “Probing Many-Body Dynamics on a 51-Atom Quantum Simulator,” Nature, 551: 579. (Scholar)
Bernstein, E., and Vazirani, U., 1997, “Quantum Complexity Theory,” SIAM Journal on Computing, 26: 1411–1473. (Scholar)
Biham, E., Brassard, G., Kenigsberg, D., and Mor, T., 2004, “Quantum Computing Without Entanglement,” Theoretical Computer Science, 320: 15–33. (Scholar)
Boolos, George S., Burgess, John P., and Jeffrey, Richard C., 2007, Computability and Logic, 5th edition, Cambridge: Cambridge University Press. (Scholar)
Brown, B. J., and Roberts, S., 2020, “Universal Fault-Tolerant Measurement-Based Quantum Computation,” Physical Review Research, 2: 033305. (Scholar)
Brown, Christopher Devlin, 2023, “Quantum Computation and the Untenability of a ‘No Fundamental Mentality’ Constraint on Physicalism,” Synthese, 201: 10. (Scholar)
Bub, J., 2006a, “Quantum Computation from a Quantum Logical Perspective.” (Scholar)
–––, 2006b, “Quantum Information and Computing,” in J. Butterfield & J. Earman (eds.), Handbook of the Philosophy of Science, Philosophy of Physics, Part A, pp. 555–660, Amsterdam: Elsevier. (Scholar)
–––, 2010, “Quantum Computation: Where Does the Speed-up Come From?” in A. Bokulich & G. Jaeger (eds.), Philosophy of Quantum Information and Entanglement, pp. 231–246, Cambridge: Cambridge University Press. (Scholar)
–––, 2016, Bananaworld, Quantum Mechanics for Primates, Oxford: Oxford University Press. (Scholar)
Bub, J., and Pitowsky, I., 2010, “Two Dogmas about Quantum Mechanics,” in Simon Saunders, Jonathan Barrett, Adrian Kent, & David Wallace (eds.), Many Worlds? Everett, Quantum Theory, and Reality, pp. 433–459, Oxford: Oxford University Press. (Scholar)
Carnap, Rudolf, 1962, Logical Foundations of Probability, 2nd edition, Chicago: The University of Chicago Press. (Scholar)
Chiribella, G., and Spekkens, R. W., 2016, Quantum Theory: Informational Foundations and Foils, Dordrecht: Springer. (Scholar)
Cirac, J. I., and Zoller, P., 1995, “Quantum Computations with Cold Trapped Ions,” Phys. Rev. Lett., 74: 4091–4094. (Scholar)
Cobham, A., 1965, “The Intrinsic Computational Difficulty of Functions,” in Yehoshua Bar-Hillel (ed.), Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress, pp. 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, pp. 151–158, New York: ACM. (Scholar)
Copeland, B. J., 2002, “Hypercomputation,” Minds and Machines, 12: 461–502. (Scholar)
–––, 2011, “Do Accelerating Turing Machines Compute the Uncomputable?” Minds & Machines, 21: 221–239. (Scholar)
–––, 2018, “Zuse’s Thesis, Gandy’s Thesis, and Penrose’s Thesis,” in Cuffaro & Fletcher (2018), pp. 39–59. (Scholar)
Costa, F., and Shrapnel, S., 2016, “Quantum Causal Modelling,” New Journal of Physics, 18: 063032. (Scholar)
Cubitt, Toby S., Perez-Garcia, David, and Wolf, Michael M., 2015, “Undecidability of the Spectral Gap,” Nature, 528: 207–211. (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–748. (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–655. (Scholar)
–––, 2018b, “Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer,” in S. O. Hansson (ed.), Technology and Mathematics: Philosophical and Historical Investigations, pp. 253–282, Cham: Springer. (Scholar)
–––, 2020, “Information Causality, the Tsirelson Bound, and the ‘Being-Thus’ of Things,” Studies in History and Philosophy of Modern Physics, 72: 266–277. (Scholar)
–––, 2022, “The Philosophy of Quantum Computing,” in E. Miranda (ed.), Quantum Computing in the Arts and Humanities, pp. 107–152, Dordrecht: Springer. (Scholar)
–––, 2023, “The Measurement Problem Is a Feature, Not a Bug – Schematising the Observer and the Concept of an Open System on an Informational, or (Neo-)Bohrian, Approach,” Entropy, 25: 1410. (Scholar)
Cuffaro, M. E., and Fletcher, S. C. (eds.), 2018, Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge: Cambridge University Press. (Scholar)
Dalla Chiara, Maria Luisa, Giuntini, Roberto, Leporini, Roberto, and Sergioli, Giuseppe, 2018, Quantum Computation and Logic: How Quantum Computers Have Inspired Logical Investigations, Cham: Springer. (Scholar)
Davis, M., 1958, The Undecidable, New York: Dover. (Scholar)
–––, 2003, “The Myth of Hypercomputation,” in C. Teuscher (ed.), Alan Turing, Life and Legacy of a Great Thinker, pp. 195–212, New York: Springer. (Scholar)
de Beaudrap, Niel, and Horsman, Dominic, 2020, “The ZX Calculus Is a Language for Surface Code Lattice Surgery,” Quantum, 4: 218. (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–4359. (Scholar)
Deutsch, D., and Jozsa, R., 1992, “Rapid Solution of Problems by Quantum Computation,” Proc. Roy. Soc. Lond. A, 439: 553–558. (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–1022. (Scholar)
–––, 2000, “The Physical Implementation of Quantum Computation,” Fortschritte Der Physik, 48: 771–783. (Scholar)
Dunlap, Lucas, 2022, “Is the Information-Theoretic Interpretation of Quantum Mechanics an Ontic Structural Realist View?” Studies in History and Philosophy of Science, 91: 41–48. (Scholar)
Duwell, A., 2007, “The Many-Worlds Interpretation and Quantum Computation,” Philosophy of Science, 74: 1007–1018. (Scholar)
–––, 2018, “How to Make Orthogonal Positions Parallel: Revisiting the Quantum Parallelism Thesis,” in Cuffaro & Fletcher (2018), pp. 83–102. (Scholar)
–––, 2020, “Understanding Quantum Phenomena and Quantum Theories,” Studies in History and Philosophy of Modern Physics, 72: 278–291. (Scholar)
–––, 2021, Physics and Computation, Cambridge: Cambridge University Press. (Scholar)
Edmonds, J., 1965, “Paths, Trees, and Flowers,” Canadian Journal of Mathematics, 17: 449–467. (Scholar)
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., and Preda, D., 2001, “A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem,” Science, 292: 472–475. (Scholar)
Felline, L., 2016, “It’s a Matter of Principle: Scientific Explanation in Information‐theoretic Reconstructions of Quantum Theory,” Dialectica, 70: 549–575. (Scholar)
–––, 2020, “The Measurement Problem and Two Dogmas about Quantum Mechanics,” in M. Hemmo & O. Shenker (eds.), Quantum, Probability, Logic: Itamar Pitowsky’s Work and Influence, pp. 285–304, Cham: Springer. (Scholar)
Feynman, R. P., 1982, “Simulating Physics with Computers,” International Journal of Theoretical Physics, 21: 467–488. (Scholar)
Fodor, J., 1974, “Special Sciences,” Synthese, 2: 97–115. (Scholar)
Fodor, J., and Pylyshyn, Z., 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–244. (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., Kitaev, A., and Wang, Z., 2002, “Simulation of Topological Field Theories by Quantum Computers,” Communications in Mathematical Physics, 227: 587–603. (Scholar)
Fuchs, Christopher A., 2002, “Quantum Mechanics as Quantum Information (and Only a Little More).” (Scholar)
Gandy, R., 1980, “Church’s Thesis and Principles for Mechanisms,” in J. Barwise, H. J. Keisler, & K. Kunen (eds.), The Kleene Symposium, pp. 123–148, Amsterdam: Elsevier. (Scholar)
Garey, M. R., and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: WH Freeman. (Scholar)
Geroch, R., 2009, Perspectives in Computation, Cambridge: Cambridge University Press. (Scholar)
Giblin, P., 1993, Primes and Programming, Cambridge: Cambridge University Press. (Scholar)
Gottesman, D., and Chuang, I., 1999, “Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations,” Nature, 402: 390–393. (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, pp. 212–219, New York, NY, USA: Association for Computing Machinery. (Scholar)
Hagar, A., 2003, “A Philosopher Looks at Quantum Information Theory,” Philosophy of Science, 70: 752–775. (Scholar)
–––, 2007, “Quantum Algorithms: Philosophical Lessons,” Minds & Machines, 17: 233–247. (Scholar)
–––, 2009, “Active Fault-Tolerant Quantum Error Correction: The Curse of the Open System,” Philosophy of Science, 76: 506–535. (Scholar)
–––, 2016, “Ed Fredkin and the Physics of Information: An Inside Story of an Outsider Scientist,” Information and Culture, 51: 419–443. (Scholar)
Hagar, A., and Hemmo, M., 2006, “Explaining the Unobserved: Why Quantum Mechanics Ain’t Only about Information,” Foundations of Physics, 36: 1295–1324. (Scholar)
Hagar, A., and Korolev, A., 2007, “Quantum Hypercomputation – Hype or Computation?” Philosophy of Science, 74: 347–363. (Scholar)
Hangleiter, D., Carolan, J., and Thébault, K. P. Y., 2022, Analogue Quantum Simulation: A New Instrument for Scientific Understanding, Cham: Springer. (Scholar)
Hartmanis, J., and Stearns, R. E., 1965, “On the Computational Complexity of Algorithms,” Transactions of the American Mathematical Society, 117: 285–306. (Scholar)
Hausman, D. M., and Woodward, J., 1999, “Independence, Invariance, and the Causal Markov Condition,” The British Journal for the Philosophy of Science, 50: 521–583. (Scholar)
Henderson, L., 2020, “Quantum Reaxiomatisations and Information-Theoretic Interpretations of Quantum Theory,” Studies in History and Philosophy of Modern Physics, 72: 292–300. (Scholar)
Hermann, G., 2017, “Natural-Philosophical Foundations of Quantum Mechanics (1935),” in E. Crull & G. Bacciagaluppi (eds.), E. Crull (trans.), Grete Hermann: Between Physics and Philosophy, pp. 239–278, 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, pp. 126–138, 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–183, 1973. (Scholar)
Horsman, C., Fowler, A. G., Devitt, S., and Van Meter, R., 2012, “Surface Code Quantum Computing by Lattice Surgery,” New Journal of Physics, 14: 123011. (Scholar)
Howard, M., Wallman, J., Veitch, V., and Emerson, J., 2014, “Contextuality Supplies the ‘Magic’ for Quantum Computation,” Nature, 510: 351–355. (Scholar)
Ingarden, R. S., 1976, “Quantum Information Theory,” Rep. Math. Phys., 10: 43–72. (Scholar)
Janas, Michael, Cuffaro, Michael E., and Janssen, Michel, 2022, Understanding Quantum Raffles: Quantum Mechanics on an Informational Approach: Structure and Interpretation, Cham: Springer-Verlag. (Scholar)
Johnson, M., Amin, M., Gildert, S.others, 2011, “Quantum Annealing with Manufactured Spins,” Nature, 473: 194–198. (Scholar)
Jozsa, R., 1997, “Entanglement and Quantum Computation,” in S. A. Huggett, L. J. Mason, K. P. Tod, S. T. Tsou, & N. M. J. Woodhouse (eds.), The Geometric Universe, pp. Ch. 27, Oxford: Oxford University Press. (Scholar)
Kieu, T. D., 2002, “Quantum Hypercomputability,” Minds and Machines, 12: 541–561. (Scholar)
–––, 2004, “A Reformulation of Hilbert’s Tenth Problem Through Quantum Mechanics,” Proc. Royal Soc. A, 460: 1535–1545. (Scholar)
Koberinski, Adam, and Müller, Markus P., 2018, “Quantum Theory as a Principle Theory: Insights from an Information Theoretic Reconstruction,” in Cuffaro & Fletcher (2018), pp. 257–280. (Scholar)
Ladyman, J., 2018, “Intension in the Physics of Computation: Lessons from the Debate about Landauer’s Principle,” in Cuffaro & Fletcher (2018), pp. 219–239. (Scholar)
Lahtinen, Ville, and Pachos, Jiannis K., 2017, “A Short Introduction to Topological Quantum Computation,” SciPost Physics, 3: 021. (Scholar)
Lau, Jonathan Wei Zhong, Lim, Kian Hwee, Shrotriya, Harshank, and Kwek, Leong Chuan, 2022, “NISQ Computing: Where Are We and Where Do We Go?” Association of Asia Pacific Physical Societies Bulletin, 32: 27. (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–2597. (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–545. (Scholar)
Lorenz, Robin, 2022, “Quantum Causal Models: The Merits of the Spirit of Reichenbach’s Principle for Understanding Quantum Causal Structure,” Synthese, 200: 424. (Scholar)
Lupacchini, Rossella, 2018, “Church’s Thesis, Turing’s Limits, and Deutsch’s Principle,” in Cuffaro & Fletcher (2018), op. cit., pp. 60–82. (Scholar)
Maley, Corey J., 2023, “Analogue Computation and Representation,” The British Journal for the Philosophy of Science, 74: 739–769. (Scholar)
Manin, Y., 1980, Computable and Uncomputable, Moscow: Sovetskoye Radio. (Scholar)
Marletto, Chiara, 2022, “The Information-Theoretic Foundation of Thermodynamic Work Extraction,” Journal of Physics Communications, 6: 055012. (Scholar)
Marletto, Chiara, Vedral, Vlatko, Knoll, Laura T., Piacentini, Fabrizio, Bernardi, Ettore, Rebufello, Enrico, … Genovese, Marco, 2022, “Emergence of Constructor-Based Irreversibility in Quantum Systems: Theory and Experiment,” Physical Review Letters, 128: 080401. (Scholar)
Martín-López, Enrique, Laing, Anthony, Lawson, Thomas, Alvarez, Roberto, Zhou, Xiao-Qi, and O’Brien, Jeremy L., 2012, “Experimental Realization of Shor’s Quantum Factoring Algorithm Using Qubit Recycling,” Nature Photonics, 6: 773–776. (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–2357. (Scholar)
Myers, J., 1997, “Can a Universal Quantum Computer Be Fully Quantum?” Phys. Rev. Lett., 78: 1823–1824. (Scholar)
Myrvold, W. C., 2011, “Statistical Mechanics and Thermodynamics: A Maxwellian View,” Studies in History and Philosophy of Modern Physics, 42: 237–243. (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)
–––, 2010, “From Physics to Information Theory and Back,” in Alisa Bokulich & Gregg Jaeger (eds.), Philosophy of Quantum Information and Entanglement, pp. 181–207, 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 Chuang, I. L., 2010, Quantum Computation and Quantum Information 10th anniversary., Cambridge: Cambridge University Press. (Scholar)
Nielsen, M. A., and Dawson, C. M., 2005, “Fault-Tolerant Quantum Computation with Cluster States,” Physical Review A, 71: 042323. (Scholar)
Pan, Feng, Chen, Keyang, and Zhang, Pan, 2022, “Solving the Sampling Problem of the Sycamore Quantum Circuits,” Physical Review Letters, 129: 090502. (Scholar)
Papayannopoulos, Philippos, 2020, “Computing and Modelling: Analog Vs. Analogue,” Studies in History and Philosophy of Science, 83: 103–120. (Scholar)
–––, 2023, “On Algorithms, Effective Procedures, and Their Definitions,” Philosophia Mathematica, 31: 291–329. (Scholar)
Pearle, P., 1997, “True Collapse and False Collapse,” in D. H. Feng & B. L. Hu (eds.), Quantum Classical Correspondence: Proceedings of the 4th Drexel Symposium on Quantum Nonintegrability, Philadelphia, PA, USA, September 8–11, 1994, pp. 51–68, Cambridge: International Press. (Scholar)
Pitowsky, I., 1990, “The Physical Church Thesis and Physical Computational Complexity,” Iyyun: The Jerusalem Philosophical Quarterly, 39: 81–99. (Scholar)
–––, 1996, “Laplace’s Demon Consults an Oracle: The Computational Complexity of Prediction,” Studies in History and Philosophy of Modern Physics, 27: 161–180. (Scholar)
–––, 2002, “Quantum Speed-up of Computations,” Philosophy of Science, 69: S168–S177. (Scholar)
Pitowsky, I., and Shagrir, O., 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 Richards, I., 1981, “The Wave Equation with Computable Initial Data Such That Its Unique Solution Is Not Computable,” Advances in Mathematics, 29: 215–239. (Scholar)
Preskill, J., 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 J. Traub (ed.), Algorithms and Complexity: New Directions and Recent Results, pp. 23–39, New York: Academic Press. (Scholar)
Raussendorf, R., and Briegel, H. J., 2002, “Computational Model Underlying the One-Way Quantum Computer,” Quantum Information and Computation, 2: 443–486. (Scholar)
Raussendorf, R., Browne, D. E., and Briegel, H. J., 2003, “Measurement-Based Quantum Computation on Cluster States,” Physical Review A, 68: 022312. (Scholar)
Raussendorf, R., Harrington, J., and Goyal, K., 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, pp. 502–510. (Scholar)
Rivest, R. L., Shamir, A., and Adleman, L., 1978, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, 21: 120–126. (Scholar)
Schlick, M., 1961, “Causality in Contemporary Physics I (1931),” The British Journal for the Philosophy of Science, 12: 177–193. (Scholar)
–––, 1962, “Causality in Contemporary Physics II (1931),” The British Journal for the Philosophy of Science, 12: 281–298. (Scholar)
Schmitz, Timothy, 2023, “On Epistemically Useful Physical Computation,” Philosophy of Science, 90: 974–984. (Scholar)
Shor, P., 1995, “Scheme for Reducing Decoherence in Quantum Computer Memory,” Phys. Rev. A., 52: 2493–2496. (Scholar)
–––, 1994, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,” Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on, 124–134. (Scholar)
Shor, P., and DiVincenzo, D., 1996, “Fault Tolerant Error Correction with Efficient Quantum Codes,” Phys. Rev. Lett., 77: 3260–3263. (Scholar)
Shrapnel, S., 2017, “Discovering Quantum Causal Models,” The British Journal for the Philosophy of Science, 70: 1–25. (Scholar)
Sieg, W., and Byrnes, J., 1999, “An Abstract Model for Parallel Computations,” The Monist, 82: 150–164. (Scholar)
Simon, D. R., 1994, “On the Power of Quantum Computation,” in 1994 Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 116–123, Los Alamitos, CA: IEEE Press. (Scholar)
Skosana, Unathi, and Tame, Mark, 2021, “Demonstration of Shor’s Factoring Algorithm for N = 21 on IBM Quantum Processors,” Scientific Reports, 11: 16599. (Scholar)
Spekkens, R. W., 2007, “Evidence for the Epistemic View of Quantum States: A Toy Theory,” Phys. Rev. A, 75: 032110. (Scholar)
Sprevak, Mark, 2022, “Not All Computational Methods Are Effective Methods,” Philosophies, 7: 113. (Scholar)
Steane, A. M., 1996, “Multiple Particle Interference and Quantum Error Correction,” Proc. Roy. Soc. Lond. A, 452: 2551–2577. (Scholar)
–––, 2003, “A Quantum Computer Only Needs One Universe,” Studies in History and Philosophy of Modern Physics, 34: 469–478. (Scholar)
Tabakin, F., 2017, “Model Dynamics for Quantum Computing,” Annals of Physics, 383: 33–78. (Scholar)
Tacchino, F., Chiesa, A., Carretta, S., and Gerace, D., 2020, “Quantum Computers as Universal Quantum Simulators: State-of-Art and Perspectives,” Advanced Quantum Technologies, 3: 1900052. (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–265. (Scholar)
Unruh, W. G., 1995, “Maintaining Coherence in Quantum Computers,” Phys. Rev. A, 51: 992–997. (Scholar)
Van Meter, R., and Horsman, C., 2013, “A Blueprint for Building a Quantum Computer,” Communications of the ACM, 56: 16–25. (Scholar)
Vergis, A., Steiglitz, K., and Dickinson, B., 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–399. (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 H. Price & R. Corry (eds.), Causation, Physics, and the Constitution of Reality: Russell’s Republic Revisited, Oxford: Oxford University Press. (Scholar)

Generated Mon Mar 17 07:00:32 2025

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...