1 Introduction
2 Characters and Strings
3 Problems
4 Computability
5 Turing Machines
6 Noncomputable Problems
7 Noncomputable Numbers
8 Formal Mathematics
9 Difficulty Functions
10 Difficult Problems; Best Algorithms
11 A Language for Efficiency
12 Are There Better Languages?
13 Probabilistic Computing
14 Quantum Mechanics
15 Grover Construction
16 Grover Construction: Six Issues
16.1 Initial State
16.2 Final Observation on Hin
16.3 Building the Operator W
16.4 Building the Operator V
16.5 Errors
16.6 What Is the Problem?
17 Quantum-Assisted Computing
18 Quantum-Assisted Computability
19 Quantum-Assisted Difficulty Functions
20 Quantum-Assisted Efficiency I
21 Quantum-Assisted Efficiency II
22 Conclusion
References
Index
For more information, or to order this book, please visit http://www.press.uchicago.edu