اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRenormalized Circuit Complexity
119
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 consider the circuit complexity of free bosons, or equivalently free fermions, in 1+1 dimensions. Motivated by the results of [1] and [2, 3] who found different behavior in the complexity of free bosons and fermions, in any dimension, we consider
the 1+1 dimensional case where, thanks to the bosonisation equivalence, we can consider the same state from both the bosonic and the fermionic perspectives. In this way the discrepancy can be attributed to a different choice of the set of gates allowed in the circuit. We study the effect in two classes of states: i) bosonic-coherent / fermionic-gaussian states; ii) states that are both bosonic- and fermionic-gaussian. We consider the complexity relative to the ground state. In the first class, the different results can be reconciled admitting a mode-dependent cost function in one of the descriptions. The differences in the second class are more important, in terms of the cutoff-dependence and the overall behavior of the complexity.
We consider circuit complexity in certain interacting scalar quantum field theories, mainly focusing on the $phi^4$ theory. We work out the circuit complexity for evolving from a nearly Gaussian unentangled reference state to the entangled ground sta
te of the theory. Our approach uses Nielsens geometric method, which translates into working out the geodesic equation arising from a certain cost functional. We present a general method, making use of integral transforms, to do the required lattice sums analytically and give explicit expressions for the $d=2,3$ cases. Our method enables a study of circuit complexity in the epsilon expansion for the Wilson-Fisher fixed point. We find that with increasing dimensionality the circuit depth increases in the presence of the $phi^4$ interaction eventually causing the perturbative calculation to breakdown. We discuss how circuit complexity relates with the renormalization group.
We construct renormalized holographic entanglement entropy (HEE) and subregion complexity (HSC) in the CV conjecture for asymptotically AdS$_4$ and AdS$_5$ geometries under relevant perturbations. Using the holographic renormalization method develope
d in the gauge/gravity duality, we obtain counter terms which are invariant under coordinate choices. We explicitly define different forms of renormalized HEE and HSC, according to conformal dimensions of relevant operators in the $d=3$ and $d=4$ dual field theories. We use a general embedding for arbitrary entangling subregions and showed that any choice of the coordinate system gives the same form of the counter terms, since they are written in terms of curvature invariants and scalar fields on the boundaries. We show an explicit example of our general procedure. Intriguingly, we find that a divergent term of the HSC in the asymptotically AdS$_5$ geometry under relevant perturbations with operators of conformal dimensions in the range $0< Delta < frac{1}{2},, {rm and} ,, frac{7}{2}< Delta < 4$ cannot be cancelled out by adding any coordinate invariant counter term. This implies that the HSCs in these ranges of the conformal dimensions are not renormalizable covariantly.
Recently in various theoretical works, path-breaking progress has been made in recovering the well-known Page Curve of an evaporating black hole with Quantum Extremal Islands, proposed to solve the long-standing black hole information loss problem re
lated to the unitarity issue. Motivated by this concept, in this paper, we study cosmological circuit complexity in the presence (or absence) of Quantum Extremal Islands in the negative (or positive) Cosmological Constant with radiation in the background of Friedmann-Lema$hat{i}$tre-Robertson-Walker (FLRW) space-time i.e the presence and absence of islands in anti-de Sitter and the de Sitter spacetime having SO(2, 3) and SO(1, 4) isometries respectively. Without using any explicit details of any gravity model, we study the behaviour of the circuit complexity function with respect to the dynamical cosmological solution for the scale factors for the above-mentioned two situations in FLRW space-time using squeezed state formalism. By studying the cosmological circuit complexity, Out-of-Time Ordered Correlators, and entanglement entropy of the modes of the squeezed state, in different parameter spaces, we conclude the non-universality of these measures. Their remarkably different features in the different parameter spaces suggest their dependence on the parameters of the model under consideration.
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 geomet
rical 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
