The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
arXiv:1607.05256
Abstract
These are lecture notes from a weeklong course in quantum complexity theory taught at the Bellairs Research Institute in Barbados, February 21-25, 2016. The focus is quantum circuit complexity---i.e., the minimum number of gates needed to prepare a given quantum state or apply a given unitary transformation---as a unifying theme tying together several topics of recent interest in the field. Those topics include the power of quantum proofs and advice states; how to construct quantum money schemes secure against counterfeiting; and the role of complexity in the black-hole information paradox and the AdS/CFT correspondence (through connections made by Harlow-Hayden, Susskind, and others). The course was taught to a mixed audience of theoretical computer scientists and quantum gravity / string theorists, and starts out with a crash course on quantum information and computation in general.
arXiv comment111 pages, 10 figures. Includes a special guest lecture by Adam Bouland and Luke Schaeffer. Enormous thanks to them, Anil Ada, Denis Therien, and the scribes, without whom these notes wouldn't have happened. Comments welcome
Cited by in corpus (29)
- Noether charge, black hole volume, and complexity
- Circuit complexity in interacting QFTs and RG flows
- Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
- Time Evolution of Complexity: A Critique of Three Methods
- Black holes, complexity and quantum chaos
- Complexity of Mixed States in QFT and Holography
- Time Evolution of Complexity in Abelian Gauge Theories - And Playing Quantum Othello Game -
- Principles and symmetries of complexity in quantum field theory
- Holographic Complexity and de Sitter Space
- Circuit Complexity across a Topological Phase Transition
- Aspects of The First Law of Complexity
- On the time dependence of holographic complexity in a dynamical Einstein-dilaton model
- Complexity of Holographic Superconductors
- General Bounds on Holographic Complexity
- Circuit Complexity in Topological Quantum Field Theory
- Semi-Device Independent Quantum Money
- Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
- Complexity Growth Following Multiple Shocks
- Quantum search-to-decision reductions and the state synthesis problem
- Improved quantum data analysis
- Computability Theory of Closed Timelike Curves
- Is volume the holographic dual of fidelity susceptibility?
- Causality Constraint on Circuit Complexity from
- On estimating the entropy of shallow circuit outputs
- Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
- Switchback effect of holographic complexity in multiple-horizon black holes
- Holographic and QFT Complexity with angular momentum
- Quantum Oracle Separations from Complex but Easily Specified States
- Almost Public Quantum Coins