Quantum Algorithms: Philosophical Lessons

Authors:
Amit Hagar
Affiliations:
HPS Department, Indiana University, Bloomington, USA 47405
Venue:
Minds and Machines
Year:
2007

Citing 12
Cited 0

Computation and cognition: toward a foundation for cognitive science

Computation and cognition: toward a foundation for cognitive science
The complexity of analog computation

Mathematics and Computers in Simulation
Molecular computation of solutions to combinatorial problems

Science
Quantum computation and quantum information

Quantum computation and quantum information
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Quantum Hypercomputation

Minds and Machines
Hypercomputation

Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis

Minds and Machines
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Progress in Quantum Algorithms

Quantum Information Processing
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum Hypercomputability?

Minds and Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

I discuss the philosophical implications that the rising new science of quantum computing may have on the philosophy of computer science. While quantum algorithms leave the notion of Turing-Computability intact, they may re-describe the abstract space of computational complexity theory hence militate against the autonomous character of some of the concepts and categories of computer science.