Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeometry of Krylov Complexity
160
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We develop a geometric approach to operator growth and Krylov complexity in many-body quantum systems governed by symmetries. We start by showing a direct link between a unitary evolution with the Liouvillian and the displacement operator of appropriate generalized coherent states. This connection maps operator growth to a purely classical motion in phase space. The phase spaces are endowed with a natural information metric. We show that, in this geometry, operator growth is represented by geodesics and Krylov complexity is proportional to a volume. This geometric perspective also provides two novel avenues towards computation of Lanczos coefficients and sheds new light on the origin of their maximal growth. We describe the general idea and analyze it in explicit examples among which we reproduce known results from the Sachdev-Ye-Kitaev model, derive operator growth based on SU(2) and Heisenberg-Weyl symmetries, and generalize the discussion to conformal field theories. Finally, we use techniques from quantum optics to study operator evolution with quantum information tools such as entanglement and Renyi entropies, negativity, fidelity, relative entropy and capacity of entanglement.
rate research
Read More
Krylov complexity, or K-complexity for short, has recently emerged as a new probe of chaos in quantum systems. It is a measure of operator growth in Krylov space, which conjecturally bounds the operator growth measured by the out of time ordered correlator (OTOC). We study Krylov complexity in conformal field theories by considering arbitrary 2d CFTs, free field, and holographic models. We find that the bound on OTOC provided by Krylov complexity reduces to bound on chaos of Maldacena, Shenker, and Stanford. In all considered examples including free and rational CFTs Krylov complexity grows exponentially, in stark violation of the expectation that exponential growth signifies chaos.
We investigate the evolution of complexity and entanglement following a quench in a one-dimensional topological system, namely the Su-Schrieffer-Heeger model. We demonstrate that complexity can detect quantum phase transitions and shows signatures of revivals; this observation provides a practical advantage in information processing. We also show that the complexity saturates much faster than the entanglement entropy in this system, and we provide a physical argument for this. Finally, we demonstrate that complexity is a less sensitive probe of topological order, compared with measures of entanglement.
The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving Heisenberg operators. It is particularly important to understand how these microscopically defined measures of complexity are related to notions of complexity defined in terms of a dual holographic geometry, such as complexity-volume (CV) duality. Here we study partially entangled thermal states in the Sachdev-Ye-Kitaev (SYK) model and their dual description in terms of operators inserted in the interior of a black hole in Jackiw-Teitelboim (JT) gravity. We compare a microscopic definition of complexity in the SYK model known as K-complexity to calculations using CV duality in JT gravity and find that both quantities show an exponential-to-linear growth behavior. We also calculate the growth of operator size under time evolution and find connections between size and complexity. While the notion of operator size saturates at the scrambling time, our study suggests that complexity, which is well defined in both quantum systems and gravity theories, can serve as a useful measure of operator evolution at both early and late times.
The quantum complexity of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical computational complexity, it has since been argued to hold a fundamental significance in its own right, as a physical quantity analogous to the thermodynamic entropy. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators. One striking feature of these functions is that they can exhibit non-smooth and even fractal behaviour. We use ideas from Diophantine approximation theory and sub-Riemannian geometry to rigorously quantify this lack of smoothness. Implications for the physical meaning of quantum complexity are discussed.
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 $n$ qubits using Nielsens 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
