Geometry of quantum complexity
arXiv:2011.07601 · doi:10.1103/PhysRevD.103.106021
Abstract
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for qubits using Nielsen's geometrical approach. We investigate a choice of penalties which, compared to previous definitions, increases in a more progressive way with the number of qubits simultaneously entangled by a given operation. This choice turns out to be free from singularities. We also analyze the relation between operator and state complexities, framing the discussion with the language of Riemannian submersions. This provides a direct relation between geodesics and curvatures in the unitaries and the states spaces, which we also exploit to give a closed-form expression for the metric on the states in terms of the one for the operators. Finally, we study conjugate points for a large number of qubits in the unitary space and we provide a strong indication that maximal complexity scales exponentially with the number of qubits in a certain regime of the penalties space.
arXiv comment41 pages, several figures; v2: journal version; v3: journal title
References in corpus (56)
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- Information in Black Hole Radiation
- Complexity Equals Action
- The entropy of bulk quantum fields and the entanglement wedge of an evaporating black hole
- Complexity and Shock Wave Geometries
- The Page curve of Hawking radiation from semiclassical geometry
- Complexity, action, and black holes
- Quantum Computation as Geometry
- Circuit complexity in quantum field theory
- Towards Complexity for Quantum Field Theory States
- Gravitational action with null boundaries
- The Second Law of Quantum Complexity
- Comments on Holographic Complexity
- On the Time Dependence of Holographic Complexity
- Holographic Complexity
- Complexity of Formation in Holography
- Circuit Complexity in Fermionic Field Theory
- Complexity and entanglement for thermofield double states
- Quantum Computation as Gravity
- Complexity Growth for AdS Black Holes
- Circuit complexity for free fermions
- Quantum Complexity and Negative Curvature
- Optimal control, geometry, and quantum computing
- Complexity as a novel probe of quantum quenches: universal scalings and purifications
- On Volumes of Subregions in Holography and Complexity
- Subsystem Complexity and Holography
- Switchbacks and the Bridge to Nowhere
- Black holes, complexity and quantum chaos
- Quantum Complexity of Time Evolution with Chaotic Hamiltonians
- Quantum Extremal Islands Made Easy, PartIII: Complexity on the Brane
- The Typical-State Paradox: Diagnosing Horizons with Complexity
- Complexity of Mixed States in QFT and Holography
- The Complexity Geometry of a Single Qubit
- The First Law of Complexity
- Topological Complexity in AdS3/CFT2
- Time Evolution of Complexity in Abelian Gauge Theories - And Playing Quantum Othello Game -
- Holographic Complexity And Cosmological Singularities
- Geometry of Complexity in Conformal Field Theory
- Holographic subregion complexity under a thermal quench
- Subregion Action and Complexity
- Aspects of The First Law of Complexity
- A geometric approach to quantum circuit lower bounds
- Conformal field theory complexity from Euler-Arnold equations
- Complexity for Charged Thermofield Double States
- Complexity and action for warped AdS black holes
- Complexity in the presence of a boundary
- Complexity of mixed Gaussian states from Fisher information geometry
- Volume and complexity for warped AdS black holes
- Holographic Purification Complexity
- On volume subregion complexity in Vaidya spacetime
- Computational Complexity and Black Hole Horizons
- On subregion action complexity in AdS and in the BTZ black hole
- Quantum Control via Geometry: An explicit example
- Subsystem complexity in warped AdS
- Black Holes at Exp-time
- Complexity in One- and Two-Qubit Systems