Abstract
AbstractThe complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum systems can be modelled by considering a collection of qubits subjected to sequences of random unitary gates. Here we investigate how the complexity of these random quantum circuits increases by considering how to construct a unitary operation from Haar-random two-qubit quantum gates. Implementing the unitary operation exactly requires a minimal number of gates—this is the operation’s exact circuit complexity. We prove a conjecture that this complexity grows linearly, before saturating when the number of applied gates reaches a threshold that grows exponentially with the number of qubits. Our proof overcomes difficulties in establishing lower bounds for the exact circuit complexity by combining differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits.
Funder
Deutsche Forschungsgemeinschaft
Foundational Questions Institute
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy
Reference53 articles.
1. Susskind, L. Computational complexity and black hole horizons. Fortsch. Phys. 64, 24–43 (2016).
2. Stanford, D. & Susskind, L. Complexity and shock wave geometries. Phys. Rev. D. 90, 126007 (2014).
3. Brown, A. R., Roberts, D. A., Susskind, L., Swingle, B. & Zhao, Y. Complexity, action and black holes. Phys. Rev. D. 93, 086006 (2016).
4. Brown, A. R. & Susskind, L. Second law of quantum complexity. Phys. Rev. D. 97, 086015 (2018).
5. Bouland, A., Fefferman, B. & Vazirani, U. Computational pseudorandomness, the wormhole growth paradox and constraints on the AdS/CFT duality. In Proc. ITCS'20 (2020).
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献