Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeometry of quantum complexity
211
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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 $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.
rate research
Read More
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.
Motivated by the increasing connections between information theory and high-energy physics, particularly in the context of the AdS/CFT correspondence, we explore the information geometry associated to a variety of simple systems. By studying their Fisher metrics, we derive some general lessons that may have important implications for the application of information geometry in holography. We begin by demonstrating that the symmetries of the physical theory under study play a strong role in the resulting geometry, and that the appearance of an AdS metric is a relatively general feature. We then investigate what information the Fisher metric retains about the physics of the underlying theory by studying the geometry for both the classical 2d Ising model and the corresponding 1d free fermion theory, and find that the curvature diverges precisely at the phase transition on both sides. We discuss the differences that result from placing a metric on the space of theories vs. states, using the example of coherent free fermion states. We compare the latter to the metric on the space of coherent free boson states and show that in both cases the metric is determined by the symmetries of the corresponding density matrix. We also clarify some misconceptions in the literature pertaining to different notions of flatness associated to metric and non-metric connections, with implications for how one interprets the curvature of the geometry. Our results indicate that in general, caution is needed when connecting the AdS geometry arising from certain models with the AdS/CFT correspondence, and seek to provide a useful collection of guidelines for future progress in this exciting area.
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry, first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we demonstrate many of the attractive features of complexity geometry using the example of a single qubit, which turns out to be rich enough to be illustrative but simple enough to be illuminating.
We propose a modification to Nielsens circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in the geodesic distance and spatial volume, unlike in the original proposal. The optimized ST iteration order is correlated with the error tolerance and plays the role of an anti-de Sitter (AdS) radial coordinate. The density of gates is shown to be monotonic with the tolerance and a holographic interpretation using path-integral optimization is given.
We investigate general features of the evolution of holographic subregion complexity (HSC) on Vaidya-AdS metric with a general form. The spacetime is dual to a sudden quench process in quantum system and HSC is a measure of the ``difference between two mixed states. Based on the subregion CV (Complexity equals Volume) conjecture and in the large size limit, we extract out three distinct stages during the evolution of HSC: the stage of linear growth at the early time, the stage of linear growth with a slightly small rate during the intermediate time and the stage of linear decrease at the late time. The growth rates of the first two stages are compared with the Lloyd bound. We find that with some choices of certain parameter, the Lloyd bound is always saturated at the early time, while at the intermediate stage, the growth rate is always less than the Lloyd bound. Moreover, the fact that the behavior of CV conjecture and its version of the subregion in Vaidya spacetime implies that they are different even in the large size limit.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
