Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPath-Integral Complexity for Perturbed CFTs
102
0
0.0
(
0
)
Added by
Arpan Bhattacharyya
Publication date
2018
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work, we formulate a path-integral optimization for two dimensional conformal field theories perturbed by relevant operators. We present several evidences how this optimization mechanism works, based on calculations in free field theories as well as general arguments of RG flows in field theories. Our optimization is performed by minimizing the path-integral complexity functional that depends on the metric and also on the relevant couplings. Then, we compute the optimal metric perturbatively and find that it agrees with the time slice of the hyperbolic metric perturbed by a scalar field in the AdS/CFT correspondence. Last but not the least, we estimate contributions to complexity from relevant perturbations.
rate research
Read More
We propose an optimization procedure for Euclidean path-integrals that evaluate CFT wave functionals in arbitrary dimensions. The optimization is performed by minimizing certain functional, which can be interpreted as a measure of computational complexity, with respect to background metrics for the path-integrals. In two dimensional CFTs, this functional is given by the Liouville action. We also formulate the optimization for higher dimensional CFTs and, in various examples, find that the optimized hyperbolic metrics coincide with the time slices of expected gravity duals. Moreover, if we optimize a reduced density matrix, the geometry becomes two copies of the entanglement wedge and reproduces the holographic entanglement entropy. Our approach resembles a continuous tensor network renormalization and provides a concrete realization of the proposed interpretation of AdS/CFT as tensor networks. The present paper is an extended version of our earlier report arXiv:1703.00456 and includes many new results such as evaluations of complexity functionals, energy stress tensor, higher dimensional extensions and time evolutions of thermofield double states.
Monte Carlo studies of many quantum systems face exponentially severe signal-to-noise problems. We show that noise arising from complex phase fluctuations of observables can be reduced without introducing bias using path integral contour deformation techniques. A numerical study of contour deformations for correlation functions in Abelian gauge theory and complex scalar field theory demonstrates that variance can be reduced by orders of magnitude without modifying Monte Carlo sampling.
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of the shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many-body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of a computation, it is notoriously difficult to derive lower bounds on quantum complexity for particular unitaries or states without making additional assumptions. To go further, one may study more generic models of complexity growth. We provide a rigorous connection between complexity growth and unitary $k$-designs, ensembles which capture the randomness of the unitary group. This connection allows us to leverage existing results about design growth to draw conclusions about the growth of complexity. We prove that local random quantum circuits generate unitary transformations whose complexity grows linearly for a long time, mirroring the behavior one expects in chaotic quantum systems and verifying conjectures by Brown and Susskind. Moreover, our results apply under a strong definition of quantum complexity based on optimal distinguishing measurements.
This paper is devoted to the study of the evolution of holographic complexity after a local perturbation of the system at finite temperature. We calculate the complexity using both the complexity=action(CA) and the complexity=volume(CA) conjectures and find that the CV complexity of the total state shows the unbounded late time linear growth. The CA computation shows linear growth with fast saturation to a constant value. We estimate the CV and CA complexity linear growth coefficients and show, that finite temperature leads to violation of the Lloyd bound for CA complexity. Also it is shown that for composite system after the local quench the state with minimal entanglement may correspond to the maximal complexity.
This is the contribution to Quarks2018 conference proceedings. This contribution is devoted to the holographic description of chaos and quantum complexity in the strongly interacting systems out of equilibrium. In the first part of the talk we present different holographic complexity proposals in out-of-equilibrium CFT following the local perturbation. The second part is devoted to the chaotic growth of the local operator size at a finite chemical potential. There are numerous results stating that the chemical potential may lead to the chaos disappearance, and we confirm these results from holographic viewpoint.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
