Table of contents

Quantum Memory–Query Tradeoffs

A graduate path from hybrid data encoding to capacity bounds and feasible quantum advantage

Read each section in order. Every title can be opened as a TheoryTrace document.

• Cover
• Copyright
• How to read this book
• Introduction
• Chapter 1: The Resource Question in Hybrid Quantum Algorithms
• Chapter 2: Quantum Information Prerequisites
• Chapter 3: Classical and Quantum Models of Numerical Data
• Chapter 4: Query Complexity as Execution Time
• Chapter 5: Digital Qubit Storage and Exact Encodings
• Chapter 6: Continuous Phase Rotations as Analog Quantum Information
• Chapter 7: Hybrid Quantum Data Encoding
• Chapter 8: Precision, Resolution, and Information Capacity
• Chapter 9: From Distinguishability to a Universal Capacity Bound
• Chapter 10: Interpreting Equation 1
• Chapter 11: Lower-Bound Techniques for Hybrid Encodings
• Chapter 12: Single-Channel Scaling and Exponential Slowdown
• Chapter 13: Multi-Channel Encoding and Divided Query Exponents
• Chapter 14: Optimal Allocation Across Digital and Phase Resources
• Chapter 15: Constructive Encoding Schemes
• Chapter 16: Decoding, Estimation, and Error Propagation
• Chapter 17: Noise, Calibration, and Robust Capacity
• Chapter 18: Hybrid Encodings Inside Quantum Algorithms
• Chapter 19: Financial Value-at-Risk as a Feasibility Test
• Chapter 20: Boundary Between Quantum Advantage and Classical Supercomputing
• Chapter 21: Design Rules for Near-Term and Fault-Tolerant Implementations
• Chapter 22: Open Problems and Research Directions
• Conclusion