Quantum Computing since Democritus
Author: Scott Aaronson
Quantum Computing since Democritus by Scott Aaronson offers an intellectual journey through some of the deepest ideas in mathematics, computer science, and physics. Beginning with ancient philosophical ideas about matter and reality, the book develops through logic, set theory, computability, and computational complexity before exploring the foundations of quantum computing. A substantial portion of the book examines computational complexity and its relationship to quantum computation. Topics include the complexity classes P and NP, randomness, cryptography, quantum mechanics, quantum computing, quantum states, entanglement, and decoherence. Aaronson discusses how quantum computation challenges classical ideas about information processing and explores the theoretical boundaries of computational power. The book also extends beyond conventional quantum computing topics to discuss interactive proofs, circuit lower bounds, the anthropic principle, free will, time travel, and the relationship between cosmology and computational complexity. Combining mathematical reasoning, conceptual explanations, and thought-provoking examples, it provides readers with a deeper understanding of the theoretical and philosophical foundations of quantum computing.
Read the introduction- Pages
- 370
- Language
- انگلیسی
- Reading level
- Intermediate
About the book
Quantum Computing since Democritus by Scott Aaronson offers an intellectual journey through some of the deepest ideas in mathematics, computer science, and physics. Beginning with ancient philosophical ideas about matter and reality, the book develops through logic, set theory, computability, and computational complexity before exploring the foundations of quantum computing.
A substantial portion of the book examines computational complexity and its relationship to quantum computation. Topics include the complexity classes P and NP, randomness, cryptography, quantum mechanics, quantum computing, quantum states, entanglement, and decoherence. Aaronson discusses how quantum computation challenges classical ideas about information processing and explores the theoretical boundaries of computational power.
The book also extends beyond conventional quantum computing topics to discuss interactive proofs, circuit lower bounds, the anthropic principle, free will, time travel, and the relationship between cosmology and computational complexity. Combining mathematical reasoning, conceptual explanations, and thought-provoking examples, it provides readers with a deeper understanding of the theoretical and philosophical foundations of quantum computing.
How this book helps
Understanding the mathematical and theoretical foundations of quantum computing.
Analyzing the computational power of quantum systems compared with classical systems.
Studying computational complexity theory and the classification of computational problems.
Investigating the relationship between quantum computation and cryptography.
Exploring fundamental limitations of classical and quantum computation.
Analyzing the role of randomness and quantum information in information processing.
Conducting research in theoretical computer science and quantum information theory.
Exploring the philosophical and theoretical foundations of quantum mechanics and their implications for computation.
What you will learn
Explain the mathematical and theoretical foundations of quantum computing.
Understand and analyze computability and computational complexity.
Describe complexity classes such as P and NP and their relationship to computational problems.
Compare the theoretical computational power of classical and quantum computers.
Analyze the role of randomness in classical and quantum computation.
Explain the relationship between quantum information theory, quantum mechanics, and computation.
Examine entanglement and decoherence from the perspective of quantum information and computation.
Understand the theoretical foundations of cryptography and its relationship to quantum computing.
Discuss the theoretical limitations and boundaries of quantum computation.
Contributors
- Author
- Scott Aaronson
Publication and reading details
- Publisher
- Cambridge University Press
- Language
- انگلیسی
- Pages
- 370
- Print run
- 1
- Format
- Text
- Reading level
- Intermediate
- Category
- quantum computing
Book identifiers
- ISBN
- 9780521199568