Log in to access more pages.
Create an account or log in to continue reading more pages.
Log in
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.
- Cover1
- Copyright2
- How to read this book3
- Introduction4
- Chapter 1: The Resource Question in Hybrid Quantum Algorithms5
- Chapter 2: Quantum Information Prerequisites6
- Chapter 3: Classical and Quantum Models of Numerical Data7
- Chapter 4: Query Complexity as Execution Time8
- Chapter 5: Digital Qubit Storage and Exact Encodings9
- Chapter 6: Continuous Phase Rotations as Analog Quantum Information10
- Chapter 7: Hybrid Quantum Data Encoding11
- Chapter 8: Precision, Resolution, and Information Capacity12
- Chapter 9: From Distinguishability to a Universal Capacity Bound13
- Chapter 10: Interpreting Equation 114
- Chapter 11: Lower-Bound Techniques for Hybrid Encodings15
- Chapter 12: Single-Channel Scaling and Exponential Slowdown16
- Chapter 13: Multi-Channel Encoding and Divided Query Exponents17
- Chapter 14: Optimal Allocation Across Digital and Phase Resources18
- Chapter 15: Constructive Encoding Schemes19
- Chapter 16: Decoding, Estimation, and Error Propagation20
- Chapter 17: Noise, Calibration, and Robust Capacity21
- Chapter 18: Hybrid Encodings Inside Quantum Algorithms22
- Chapter 19: Financial Value-at-Risk as a Feasibility Test23
- Chapter 20: Boundary Between Quantum Advantage and Classical Supercomputing24
- Chapter 21: Design Rules for Near-Term and Fault-Tolerant Implementations25
- Chapter 22: Open Problems and Research Directions26
- Conclusion27