Weighting gates in circuit complexity and holography

Motivated by recent studies of quantum computational complexity in quantum field theory and holography, we discuss how weighting certain classes of gates building up a quantum circuit more heavily than others does affect the complexity. Utilizing Nielsen's geometric approach to circuit complexity, we investigate the effects for a regulated field theory for which the optimal circuit is a representation of $GL(N,\mathbb{R})$. More precisely, we work out how a uniformly chosen weighting factor acting on the entangling gates affects the complexity and, particularly, its divergent behavior. We show that assigning a higher cost to the entangling gates increases the complexity. Employing the penalized and the unpenalized complexities for the $\mathcal{F}_{\kappa=2}$ cost, we further find an interesting relation between the latter and the one based on the unpenalized $\mathcal{F}_{\kappa=1}$ cost. In addition, we exhibit how imposing such penalties modifies the leading order UV divergence in the complexity. We show that appropriately tuning the gate weighting eliminates the additional logarithmic factor, thus, resulting in a simple power law scaling. We also compare the circuit complexity with holographic predictions, specifically, based on the complexity=action conjecture, and relate the weighting factor to certain bulk quantities. Finally, we comment on certain expectations concerning the role of gate penalties in defining complexity in field theory and also speculate on possible implications for holography.


I. INTRODUCTION
The anti de-Sitter (AdS)/conformal field theory (CFT) correspondence [1] has substantially improved our understanding of strongly coupled systems and black hole (BH) micro states. As an explicit realization of the holographic principle [2,3], it basically dictates how quantum gravitational physics can nonperturbatively be formulated within the language of a pure quantum field theory (QFT). However, despite the enormous progress since its first proposal, many aspects of the duality still remain deeply mysterious.
In recent years, new concepts from quantum information and quantum computation have further helped to advance our understanding of the mechanisms behind the AdS/CFT correspondence [4][5][6]. The found relationships may be traced back to the much celebrated Bekenstein-Hawking entropy formula which relates an information theoretic quantity to a geometric characteristic of a BH; the area of the event horizon. Motivated by this striking prediction, one could already expect that a more fundamental information theoretic notion is related to other geometric properties of BHs.
In fact, it has been shown that entanglement properties of the boundary CFT are directly related to certain geometric quantities in the bulk [7][8][9]. These findings have provided surprising evidence that quantum entanglement plays a profound role in the emergence of spacetime in a gravitational theory. Since then, understanding the relation between quantum entanglement and the emergence of semiclassical geometry is being actively worked on, see e.g. [10][11][12].
In the context of BHs, such an information/geometry duality turns out to be even more astonishing. Namely, it has been shown that while the holographic entanglement entropy approaches a constant value with time during BH thermalization, certain bulk quantities such as the size of the Einstein-Rosen bridge (ERB) for the eternal AdS BH keeps increasing [13]. In view of that conundrum, it has been proposed that the boundary quantity which continues evolving after thermal equilibrium is quantum computational complexity [14].
Two separate conjectures have been proposed in the holographic context. The first one, the complexity=volume (CV) proposal, states that complexity is proportional to the volume of a maximal codimension one surface in the bulk which extends to the boundary [15][16][17].
A second, more precise one, is known as the complexity=action (CA) proposal [18,19]. It identifies the complexity of the boundary CFT state with the gravitational action evaluated on a specific bulk region known as the Wheeler-DeWitt (WDW) patch. The WDW patch is the domain of dependence of a bulk Cauchy surface attached to a specific time slice. Also note that the notion of complexity has recently been related to the spacetime volume of the WDW patch [20]. A sketch of the relevant geometric objects for the CA and CV proposals is depicted in figure 1. In both cases the corresponding quantity evolves with time even after thermal equilibrium sets in. Thus, allowing to probe the interior region of BHs, the mentioned proposals add two new classes of interesting gravitational observables with connections to quantum information and computation. Many aspects of the proposals and the related observables have recently been investigated, see e.g. . Even though both the CV and CA conjectures are interesting, much has to be done to advance our insights into the deep connection between quantum information and the structure of spacetime. For establishing the geometric dual of complexity, a precise definition of this quantity in strongly coupled theories or even in more general QFTs is for sure necessary.
The concept of compuational complexity is rooted in the field of theoretical computer science. Generally, an implemented algorithm for mapping an input (reference) quantum state |ψ R for a number of qubits to an output (target) quantum state |ψ T is determined by some function which is a unitary operation U , i.e. |ψ T = U |ψ R . In a quantum circuit model, such a unitary operation (or circuit) is constructed from elementary gates selected from a fixed set of universal gates, see figure 2. Accordingly, the circuit complexity can be defined as the minimal number of elementary gates required to construct the circuit. To define the circuit complexity for states in the boundary field theory [30,62], the corresponding task would then be identifying the minimum number of elementary gates required to prepare a desired target state by starting from a simpler reference state. For a construction built by a certain number of discrete elementary gates, the complexity of the target state explicitly depends on a specific reference, a choice of the gate set and an error tolerance.
Preliminary progress towards quantifying circuit complexity in field theory has recently been made. For instance, the formulation in [63] is based on earlier studies in quantum information showing that finding the optimal circuit is equivalent to finding the minimal geodesic in the space of unitaries [64][65][66]. This approach has also been generalized to fermionic [67,68] as well as interacting theories [69]; for other recent studies see e.g. [70][71][72][73][74][75][76][77][78][79]. Another field theory proposal is based on the Fubini-Study metric approach [80] recently applied in e.g. [75,81]. Even though both proposals have originally been made for free theories, it is remarkable that they give rise to similar leading order UV divergences as obtained in holographic computations. In addition, we also note that, motivated by the tensor network representation of the partition function, a notion of complexity has been proposed from the path integral point of view [82][83][84] which has given rise to interesting insights [85].
In the present paper, we focus on the notion of circuit complexity in QFT. More precisely, we investigate how weighting certain classes of gates building up a quantum circuit more heavily than others does affect the optimal circuit depth (i.e. complexity 1 ). Introducing such gate penalties may be motivated from different perspectives. Being already important concepts in quantum information and computation, such gate penalties may have interesting implications for complexity related aspects in QFT itself, but as well as for better understanding certain characteristics of quantum condensed matter systems. Moreover, it may shed light on recent observations resulting from holographic approaches to complexity. To be more precise, one may, for instance, ask for the consequence when complexity, if taken to be a physical attribute of a QFT, incorporates the notion of locality. In fact, if it is so, gates which entangle far separated points should require much higher costs in the geometric 1 We would like to note that the terms optimal circuit depth and (circuit) complexity are meant to mean the same. We use them interchangeably. distance in the space of unitaries than those which operate as entanglers of less separated points. In the simple case, namely, for a pair of coupled harmonic oscillators, it has been shown that introducing such penalties has a drastic effect on the complexity [63]. To be noted, there, the optimal circuit acts as a representation of GL(2, R).
A quantum circuit constructing the target state |ψ T from the initial reference state |ψ R .
The unitary U = g in g i n−1 . . . g i 2 g i 1 is a sequence of elementary gates.
Here, we work out how this change is reflected when similar penalties are introduced in the case of a field theory regulated by a lattice. In such a situation, the corresponding circuit becomes extended in form of a representation of GL(N, R). We should note that instead of using distance dependent weighting factors, we work with entangling gates which are uniformly weighted. Of course, this does not entirely correspond to the situation described above, i.e. concerning the notion of locality. However, doing so generalizes previous findings for states in field theory. This will enable us to make interesting comparisons with previous findings. Beyond that, it has recently been argued that holographic complexity might be nonlocal, means that the gate set in the CFT contains bilocal gates acting at arbitraryly distant points [44]. This additionally motivates us to penalize only one specific class of gates without implementing any distance dependencies.
Another motivation for considering the setup detailed above goes back to the found similarities between holographic complexity and circuit complexity in field theory. Particularly, we would like to understand how introducing gate penalties, even if only acting uniformly, will affect the leading order UV divergence. Such studies may be helpful for further comparisons with predictions from the gravity side. Closely related, introducing gate penalties may also be of particular importance for tensor network descriptions such as MERA [86] or cMERA [87,88]. It has been argued that these constructions provide a representation of a time slice of the AdS space [89,90].
The paper is structured as follows: in section II, we start with a short description of the geometric approach to circuit complexity proposed by Nielsen and collaborators [64][65][66]. In section III, we first introduce the setup under consideration and some basic notations. We then comment on the general procedure and summarize some of the earlier results. We would like to note that even though much of the content in this part has already been presented in [63], we recap the relevant findings which are needed for later computations. We also discuss some additional aspects which are important at the later stage. In section IV, we go through previous findings concerning the effect of implementing gate penalties in the case of two coupled oscillators. Afterwards, we comment on some further details and extensions related to other cost functions. Section V is the main part of this paper. We generalize the computations in penalized geometry for the regulated field theory and work out the differences to the unpenalized case. We then compare our results with holographic complexity computations, particularly, by referring to the findings based on the CA proposal. We also briefly comment on certain expectations concerning the implementation of distance dependent gates and on earlier findings which may share certain similarities with the presented results. In section VI, we finalize with a brief conclusion. In the remaining part, we mostly stick to the notations in [63] to allow for a direct comparison with the unpenalized case.

II. CIRCUIT COMPLEXITY
Let us begin by introducing the main idea of gemeotrizing circuit complexityà la Nielsen and collaborators. 2 The basic task is finding the optimal quantum circuit which implements a specific unitary operation U . This can be approached as a control problem of finding the right Hamiltonian which constructs the desired unitary or circuit. For doing so, one specifies a space of unitaries where the interesting paths satisfy the boundary conditions U (t = 0) = 1 and U (t = 1) ≡ U . 3 In addition, one also defines the corresponding cost function, call it F . Afterwards, by minimizing the following functional one obtains the optimal path (or circuit depth) which yields the optimal quantum circuit.
Here, the mentioned cost F (U, V ) is a local function of U in the space of unitaries and V is a vector in the tangent space at the point U . It is argued that F must be (I) continuous, (II) positive, (III) homogeneous and (IV) should satisfy the triangle inequality. In the case when (I) is replaced with the criteria of smoothness, D(U ) defines a length in a Finsler manifold which corresponds to a class of differential manifolds with a quasimetric and the measure as defined above. Thus, a Finsler geometry generalizes the notion of a Riemannian manifold. According to this instruction, the problem of finding the optimal circuit becomes the problem of finding the geodesics in the resulting geometry. What remains to be done is fixing the form of the cost F . Once F is chosen appropriately, the complexity is simply defined as the length of the optimal path in the corresponding geometry.

III. SETUP
In the following, we specify the system we would like to focus on. We consider a free d dimensional scalar field theory described by the Hamiltonian H given by We regulate this theory by putting it on a square lattice with spacing δ which describes an infinite number of coupled harmonic oscillators. The corresponding Hamiltonian then takes the form where the introduced definitions in H above read as follows Let us first proceed with the simplest case, i.e. a system of two coupled oscillators.
A. Pair of oscillators

Position space
The system of two coupled harmonic oscillators is described by the following Hamiltonian which is written in terms of the physical variables where x j denote the spatial positions and M j = 1 is set for simplicity. The eigenstates and eigenenergies of (5) can be solved by rewriting the problem in terms of two decoupled oscillators via changing from the original position basis to the normal mode basis expressed in terms of the following normal mode coordinates and frequenciesx The normalized 4 ground state wave function can be written as the product of the ground state wave functions for the two individual oscillators. In terms of the physical position coordinates, the resulting wave function reads where Following the same motivation as described in [63], we choose a factorized Gaussian reference state where both oscillators are disentangled, i.e.
Here, ω 0 denotes some arbitrary frequency characterizing the reference state. Its explicit form will be discussed later. In order to construct U such that we need to fix the set of appropriate gates. A set of elementary gates which implement a unitary transformation as prescribed in (10) can be found in the literature. Without going into the details, here we will only mention that for our purpose the relevant one are the entangling and scaling gates, i.e.
noting that a, b ∈ {1, 2}. The parameter appearing in (11) is chosen to be infinitesimal 5 in order ensure only small changes when the gates act on the wave function.
Next, we may express the circuit U in path ordered form, This representation will be used instead of a discrete gate representation as considered in the original formulation. The operators O I precisely correspond to the previous gates from (11) with Q ab = exp ( O ab ) and O ab = (ix a p b + δ ab /2) where ab ≡ I ∈ {11, 12, 21, 22}.
Accordingly, the path ordered 6 exponential (12) parametrizes the product of gates where the function Y I decides whether the gate of type I is switched on or off. Note that the differential ds behaves analogous to the infinitesimal parameter . By proceeding in this way, any circuit follows a particular trajectory determined by Y I through the space of unitaries such that ψ T = U (s = 1)ψ R and U (s = 0) = 1. In the following, we choose the cost F to be set by the following two norm For this choice, note that the optimal path is a geodesic in usual Riemannian geometry. So the functional for the circuit depth from (1) can be written as where we assume that the metric 7 is fixed by setting G IJ = δ IJ . Now, one can in principle express the function Y I which specifies the velocity vector tangent to the optimal trajectory in the space of unitaries in terms of the operators O I . However, it turns out to be more convenient to work with unitary matrices instead of operators. Accordingly, one just needs to reformulate the problem in matrix representation. In case of Gaussian states, as it is the case for the present setup, one may think of the space of states as the space of positive 5 Note that due to 1 we only need to find the circuit which minimizes the coefficient of the leading 1/ term in the complexity. 6 The operators at smallers act prior to those at largers. 7 In general, the metric G IJ allows to weight particular gates in the circuit. This will be discussed in the sections below.
It can be shown that the corresponding gate matrices take the form where M ab,cd = δ ac δ bd denotes a 2 × 2 matrix. For the present setup, the explicit generators In terms of the gates from (17), it becomes clear that the circuits form a representation of GL(2, R). Using the generator matrices in (17), the path ordered exponential in (12) can be replaced by where The expression in (19) drastically simplifies the form of the velocity vector Y I which determines the optimal circuit depth. However, in order use the expression from (19), it is required to construct an explicit parameterization of the mentioned transformations. After having done this, the main task reduces to finding the minimal 8 geodesic in the resulting metric on GL(2, R) which connects the matrices A T and A R according to A T = U (s = 1)A R U T (s = 1).
A general parameterization can be obtained by constructing U according to the decompo- where certain coordinates, for instance, labeled by τ, θ and ρ, are chosen on the subgroup SL(2, R). A fourth coordinate, call it y, will be responsible for the remaining R fibre. In this way, inserting U ≡ U (τ, θ, ρ, y) into yields a right-invariant metric. To obtain the geodesic, one first identifies the corresponding Killing vectors. Afterwards, these can be used to find all conserved charges which simplify 8 Note that by definition the complexity is determined by the shortest geodesic which yields the desired transformation. In general, one may find a family of geodesics with various lengths.
solving the underlying geodesic equations. By proceeding as described, it has been found that the shortest geodesic is given by [63] y = y 1 s, ρ = ρ 1 s, θ = τ = 0 (21) where Substituting this straight line geodesic-since the metric is flat-into the general expression for U ≡ U (τ, θ, ρ, y) ∈ GL(2, R) leads to the following optimal (straight line) circuit Here, we have expressed U 0 from (23) in exponential form which is more convenient for later purpose. For instance, using (23), we can immediately identify the corresponding velocity vector components, i.e. Y I 's. Having determined the latter, we just need to insert them into (14) which finally yields the complexity for the F 2 cost from (13) as we have indicated by the subscript.

Normal mode subspace
Of course, one can express the complexity C 2 from (24) in terms of the physical parameters. For this, we just need to use the relations in (22). However, the final result would look rather complicated. Instead, in terms of the normal mode frequencies introduced in (6), which can be used to express (22) as the complexity in (24) takes the form This simple expression invites to investigate the optimal circuit in terms of the normal mode coordinatesx ± . Such an observation can also be anticipated from the ground state wave function which is a factorized Gaussian state in the normal mode basis, i.e.
To work out the explicit form of the optimal circuit U 0 in normal mode basis, we first need to identify the required transformation matrix which yields the change [x + , It turns out that such a transformation can be realized via the following orthogonal rotation matrix follow due toÃ = R 2 AR T 2 . Then, once the matrix R 2 is known, the optimal straight line circuit U 0 can be transformed to operate in the normal mode space via the transformatioñ In contrast to U 0 , the latter transformation results in a considerable simplification of the normal mode circuit 9Ũ 0 with the following diagonal form It can be seen thatŨ 0 does not possess any off-diagonal entries. In other words, in normal mode subspace, there is no entanglement introduced. This is in line with the mentioned 9 Of course, the simple circuitŨ 0 can be obtained if the correct basis of generators in normal mode subspace are employed. Introducing the corresponding set of indices in that subspace, i.e.Ĩ ∈ {++, +−, −+, −−}, the generatorsMĨ are formally equal to MĨ , but act in a different space. Using the relatioñ theMĨ generators can be transformed to act on states expressed in position basis. Then, transforming leads to the optimal circuit from (23), i.e.
factorized Gaussian shape for the statesψ R andψ T . The factorization turns out to be a substantial simplification when generalizing the results for the regulated field theory. Now, if the analogous computation is made by using the generatorsMĨ and the velocity vector YĨ operating in the normal mode subspace, it follows that the complexity remains as in (24), i.e. the complexity C 2 for the F 2 cost is independent of the basis. This feature can be comprehended if one uses the transformation matrix which transforms the generators M J to MĨ. Let us note that the former one, i.e. M J = R T 2M J R 2 , act in the physical basis to scale/entangle the coordinates x 1,2 , whereasMĨ = R 2 MĨR T 2 scale/entangle the coordinates x +,− in the normal mode basis. The corresponding matrix is orthogonal and can be constructed according to the prescription [63] such that MĨ = RĨ J M J . Utilizing the matrix RĨ J , the mentioned basis independence is nothing but the consequence of the equality Very similar to the discussion above, one can show that such a basis independence also holds for the F κ=2 cost set by where we will use G I = 1 for the moment. In this case, the complexity in both bases turns out to be i.e. C κ=2 = C 2 2 . However, this basis independence does generally not occur for costs of the form We should add that the cost F κ=2 is of particular relevance for our studies, since it leads to the same leading UV divergence as found in holographic complexity computations. More details regarding this issue are discussed in section III C 2.
B. Lattice

One dimensional
The previous results can be generalized for the regulated field theory by a line lattice.
The corresponding Hamiltonian is of the form which satisfies the periodic boundary condition x j+N = x j . It describes a discretized field placed on a circle with length Motivated by the simplifications in normal mode basis, we rewrite H in this representation, i.e.
The normal mode coordinates can be deduced from a discrete Fourier transform, where k ∈ {0, . . . , N − 1} andx † k =x N −k . For N = 2, we find the coordinates which of course correspond to the one introduced in (6) if we identifyx 0,1 ↔x +,− and The normal mode frequencies are expressed in terms of the physical frequencies ω and Ω,ω Note that, in contrast to the system of two coupled harmonic oscillators, cf. equation (6), here we have a factor 4 in front of the second term. This goes back to the periodic boundary condition. This can be also seen when we set N = 2 in (36) and demand x 2 ≡ x 0 such that the term being proportional to Ω 2 becomes doubled, see also section V C 1.
In normal mode basis, the factorized Gaussian shape of both the reference state and target ground state is preserved. Therefore, the previous studies for N = 2 can be generalized to the case of N oscillators. In total, one gets N 2 generators which give rise to N ×N matrices. This extends the initial group GL(2, R) to GL(N, R). For the F 2 cost from (13), an appropriate parameterization spanned with N 2 coordinates of a general element U ∈ GL(N, R) is needed.
Accordingly, the optimal circuit will then be determined by the optimal geodesic in this extended geometry characterized by the corresponding right-invariant metric ds 2 .
Following the usual procedure can be very challenging due to the large number of coordinates parameterizing the extended metric. Instead, one may expect that, similar to the previously discussed simplified diagonal form of the optimal circuit in normal mode basis, a simplification of such type also applies for the present problem. Hence, the most optimal circuit would simply amplify the Gaussian width for each of the normal mode coordinates.
In particular, the extended optimal circuit would not introduce any entanglement between the normal modes. Indeed, it has been shown that the optimal circuit takes the form of the generalized straight line circuitŨ For the details showing thatŨ 0 from (42) indeed corresponds to the optimal circuit, we refer the interested reader to [63]. Bringing all together, the complexity for the one dimensional regulated field theory becomes The complexity for the one dimensional lattice can be easily extended to the (d − 1) dimensional lattice consisting of N d−1 oscillators. The final expression is of the from where k j denote the momentum vector components. The corresponding expression for the normal mode frequencies readsω

C. Comparison with holographic complexity
For the comparison with holographic complexity, it is advantageous to express the complexity from (45) in terms of the field theory parameters. Then, the normal mode frequencies according to the definitions in (4). An estimation for the complexity (45) in terms of the volume of the system, V , is also very useful. This can be accomplished if we first write V = L d−1 by assuming an equisided lattice. Afterwards, applying the relation (37), the total number of oscillators can be expressed as By using the relation in (48), it can be shown that the complexity scales as

UV divergence in QFT
The leading order contribution to complexity in QFT is determined by the UV modes.
We can take δ to be the UV cutoff where δm 1. In this UV approximation, we may estimate the normal mode frequencies in (47) by assuming Using the approximation above, as well as the expressions in (48) and (49), the leading order contribution to the complexity depending on the UV cutoff scales as Remember that for the two coupled oscillators we have seen that C κ=2 = C 2 2 . Taking this relation into account, we may immediately get the leading order UV divergence on the lattice for the F κ=2 cost which scales as

UV divergence in holography
Studies of the UV divergence in holographic complexity based on the CV and CA proposals have shown that the leading contribution scales as [28] This behavior is similar to the scaling for the F κ=2 cost from (52). Apart from that, it has been argued that the following depth function for the circuit complexitỹ with κ ≥ 1 would give rise to the same UV divergence as in (53). On the field theory side we simply get the mentioned scaling, however, with an additional logarithmic factor which will be discussed in detail below. The reason for the same prefactor for all κ lies in the fact that for the depth function in normal mode basis, i.e.D κ , the previously discussed straight line circuit still corresponds to the optimal circuit [63]. This basis independence for all κ including the F 2 cost is the reason why the optimal geodesic remains the same. In the original position basis, i.e. D κ , this is generally not the case. The only exceptions are the F κ=2 and F 2 cost functions.
For further interesting similarities in the divergence structure, we can compare with the leading order contribution in the CA proposal, where L AdS is the curvature scale of the AdS bulk spacetime, Λ is an arbitrary dimensionless coefficient fixing the null normals on the WDW patch boundary and δ is the short distance cutoff scale in the boundary CFT [28]. As suggested in [63], for eliminating L AdS from the expression-since C A is expected to be defined in the boundary CFT which therefore should not depend on any bulk AdS scale-one may fix the dimensionless coefficient as Λ = ω 0 L AdS .
Of course, ω 0 is still an arbitrary frequency. However, with the latter replacement, the complexity simply reduces to It is remarkable that this expression is similar to the QFT expression in (55)  However, recalling our motivation in the introduction, we may consider a simpler setup via penalizing the gates uniformly. In the following, we first briefly discuss these effects for the system of two coupled harmonic oscillators subjected to the F 2 cost as already explored in [63]. Afterwards, we extend our discussion for F κ=2 and work out the differences. The results constitute the basis for the field theory computations later in section V.

A. F 2 cost
Introducing weighting factors for the entangling gates simply means modifying the offdiagonal directions in the circuit. To do so, we may write the tensor G IJ in (14) as with α 2 > 1. Of course, for α = 1 one would arrive at the original situation in which no extra cost is assigned to the entangling gates. With the extended penalty tensor from (58), the corresponding metric would be modified due to the appearance of additional mixing terms. The final expression may principally be treated as usual. Namely, after identifying the corresponding Killing vectors, one would need to find all conserved charges in order to solve the geodesic equations. However, writing down the full metric, it turns out that this task is too complicated to be performed. This problem has been avoided by assuming α y 1 , ρ 1 1 and neglecting some components of the metric to simplify the full expression.
In this way, it is possible to construct a kind of segmented path which is not a geodesic, but is capable to come very close to the optimal geodesic [63]. The segmented circuit constructed by exploiting the described approximate path takes the form The circuits for the two segments are determined by and where we have defined φ := π 4 (2s − 1). Instead of continuing with these expressions, we want to rewrite them in exponential form. This can be easily done by utilizing the relation (19) which yields the desired exponential forms and The expressions above turn out to be much simpler and more suitable for later use. Now, using (62) and (63) in combination with (18), we can easily find the velocity vector components. Note that the generators are the one which are given in (17). Once the components of Y I (s) are found, we can use the splitting to deduce the complexity. The circuit depths on the right-hand side of (64) can be computed according to the integral form introduced in (14). Note that the latter is associated with the F 2 cost.
We should add that the given segmented construction can also be used for the F κ=2 cost.
Differently, for a general κ ≥ 1, it does not yield a circuit depth which comes close to the optimal one. One might argue that changing the basis and computingD κ instead of D κ may solve this problem. However, it has been discussed that, once the geometry is penalized, the depth function will not be invariant under a basis change [63]. Let us continue with the complexity for the F 2 cost. The final result, which can be obtained by plugging the mentioned segmented path into the normalization constant, 10 takes the form Here, the superscript p indicates that we work in penalized geometry. Now, if we go back and compare this result with the unpenalized straight line circuit depth in (24), we find that 10 The normalization constant gives the length of the geodesic. It corresponds to the complexity if the geodesic is the minimal one.
For Here, s is the scaled affine parameter. The components of x x x are the mentioned parameterization variables in section III A 1 for the subgroup SL(2, R) and the R fibre.
which follows due to the mentioned assumption α ρ 1 , y 1 1. Being in agreement with the naive expectation, the complexity increases when a higher cost is assigned to the entangling gates.

B. F κ=2 cost
Once the exponential forms in (62) and (63) are known, finding the complexity in penalized geometry for the F κ=2 cost becomes straightforward. Similar to the previous case, we first fix Then, by using the depth integral and the splitting in (64), we obtain As before, we can compare the result (69) with the complexity in unpenalized geometry, i.e.
D κ=2 (U 0 ) = D 2 2 (U 0 ). The difference between both complexities becomes showing again that assigning a higher cost to the entangling gates increases the complexity.

V. PENALIZED GEOMETRY II: FIELD THEORY
In this section, we study the effect of introducing weighting factors for the entangling gates in the regulated field theory placed on the lattice. As we have stressed above, for the two coupled oscillators, a direct attempt via analytically finding the minimal geodesic in full penalized geometry is already very challenging. However, certain assumptions allowed to simplify the problem under consideration. Even though the exact geodesic could not be analytically derived for the simplified case as well, an approximate segmented path has been constructed which comes very close to the optimal geodesic. This has been explicitly illustrated by comparing the corresponding complexities [63].
For the generalization on the lattice, the question is, how to find the the optimal geodesic in the extended geometry where a higher cost is attributed to the entangling gates? For instance, one may argue that by changing to the normal mode basis one could consider a perturbation around the previous straight line path, since this particular solution yields the optimal geodesic in unpenalized geometry for all F κ costs where κ ≥ 1. In general, this strategy will not simplify the problem either, since introducing a penalty tensor in one basis does not automatically lead to the same penalty tensor when working in a different basis.
However, for certain choices such as the F 2 and F κ=2 costs, as we will see, the straight line circuit may indeed be used in normal mode basis. Let us bring to mind that for these the complexity is basis independent if no extra cost is assigned to the entangling gates, see section III.
In the following, we use the results already discussed in the unpenalized case for deriving the complexity without solving the geodesic equations explicitly. For clarifying the underlying procedure, we start again with the simple case of two coupled oscillators. Please note, that all the following steps are described for the F 2 cost. But we know from earlier discussions that the findings can also be applied to the F κ=2 cost which will be our main choice later.
First, we begin by assuming that U 0 is the optimal circuit which implements the following in unpenalized geometry. The corresponding complexity shall be denoted by C(ψ T , ψ R |U 0 ).
In addition, we assume that the analogous optimal circuit U * in penalized geometry (i.e. when the entangling gates are weighted as above) is known as well, which implements For the latter, the complexity shall be denoted by C(ψ T , ψ R |U * ). As previously discussed, we know that both complexities now satisfy the following inequality Next, let us assume that we construct an artificial target state ψ * T which satisfies the implementation in unpenalized geometry, but yields a different complexity C(ψ T , ψ R |U * ). Notice that the target state |ψ T depends on the physical parameters ω and δ by construction. Now, if we keep the frequency ω unchanged and demand (74), it is possible to fulfill such an implementation if we introduce a modified parameter δ * which is assigned to the mentioned state |ψ * T .
Then, we may replace the original cutoff scale δ in the optimal circuit U 0 by δ * . This will simply allow deriving the complexity in the penalized geometry by using the optimal geodesic in the unpenalized geometry. The procedure works for the states under consideration, since both are taken to be positive quadratic forms. As we will show soon, such a replacement will regulate the desired change in complexity.
It is important to note that this replacement is rather technical. The cutoff scale in the theory will still be determined by δ.

A. Modified parameter
In the following, we explicitly illustrate the described strategy from above for the system of two coupled oscillators subjected to the F κ=2 cost. For reasons which will become clear below, we cannot use the expression in (69) for the optimal circuit depth in the penalized geometry which we again denote by D p κ=2 . Recall that the result in (69) is based on the segmented path approach which is only valid when the weighting factor introduced in (58) satisfies α y 1 , ρ 1 1. A more general expression where the range of α is not restricted from below has been worked out for the F 2 cost [63]. According to our previous findings, we may also use this expression in the present case by simply squaring it. Proceeding in this way yields the desired circuit depth which takes the form Of course, for α → 1 it reduces to the straight line circuit depth D(U 0 ) which equals to the square of (24).
Having specified this, what remains to be done is finding the solution δ * which solves the equation D κ=2 = D p κ=2 . Note that the right-hand side of the latter equation has to be written in terms of the functions y 1 (δ, ω, ω 0 ) and ρ 1 (δ, ω) where we recall from (25) that Contrary to that, the functions y 1 and ρ 1 on the left-hand side have to be written in terms of δ * . Finally, using the square of the straight line circuit depth in (24), the explicit equation we need to solve takes the form This equation can be analytically solved. An appropriate treatment yields the following where we have defined due to practical reasons. The expression in (78) is our key result which will be important in the remainder of this section. Of course, once we take the unpenalized limit, the only α dependent part in (78) vanishes, i.e. χ → 0, and we end up with the original cutoff scale δ,

B. Small penalty
To highlight the effect of assigning a higher cost to the entangling gates, it is advantageous to use the perturbative expansion of δ * for small penalties. This can be achieved for moderate α. More precisely, the prefactor in front of 2ρ 1 in (79) which only depends on the weighting factor has to be sufficiently small, i.e. χ 1. This can be controlled with a weighting factor that is α = 1, but close enough to one. In this case, we may perturb δ * around χ = 0 which yields where we have defined Suppose that we fix the reference frequency ω 0 ∼ e −σ /δ at some scale ∼ 1/δ. The overall numerical parameter σ ensures that ω 0 > 1/δ. Furthermore, we would like to work in the UV approximation described in section III C 1. Using the corresponding assumptions, we may estimate K ∼ − log 2 (δω 0 ). Observe that the dimensionless factor R in (82) is positive in this regime. Also, χ is taken to be sufficiently small as described above. Therefore, we find that the expression in the brackets from (81) decreases as soon as the weighting factor α becomes different from one, i.e. δ * < δ. This change increases the complexity due to see (76). This trend is for sure expected according to the nonperturbative expression from (75).
Up to a numerical factor N multiplied with R from (82), which is not relevant for our discussion later (thus we set N ≡ 1), we may also write an expansion of the following form whereα := √ α − 1. Writing δ * δ(. . .) as in (84) will allow to make observations more comprehensible in certain cases.
C. On the lattice For the moment, let us consider a periodic lattice with N = 2. The related Hamiltonian describing this system takes the following form where we have imposed the boundary condition x 2 ≡ x 0 . Next, we write the Hamiltonian from (85) in terms ofδ which just gives rise to the same Hamiltonian as introduced in (5). Recall that according to our previous discussion in section V A, the optimal circuit depth D κ=2 from (34) satisfies the relation where the corresponding normal mode frequencies are given as Now, based on the discussion in section III B 2, it is straightforward to generalize these results for the d dimensional case. For doing so, we may write although we should note that N has been fixed above. Then, working in the UV approximation, i.e.ω k → 1/δ, we end up with the following leading order contribution to the Of course, the expression in (90) has been derived in unpenalized geometry.

N = 2, penalized
The previous findings can be easily extended to the penalized case when α > 1. We have seen that the periodic lattice with N = 2 reduces to the system of two coupled oscillators if δ from (86) replaces the original cutoff scale δ. Thus, we may use the previous straight line solution and insert √ 2δ * = δ * (δ → √ 2δ) into the corresponding places. In the mentioned UV approximation, this would simply mean thatω k → 1/δ * . Note that according to (80) we get lim α→1δ * = δ. The complexity in the penalized geometry then takes the form As in the preceding discussion, this expression has been derived by fixing N = 2. Even though (91) provides useful information on how (uniformly) weighting a certain class of gates (here, these are the entangling gates) would influence the complexity in the regulated field theory, we still need to extend the results for an arbitrary number of oscillators N . In the subsequent part, it will be argued that the relation from (91) also applies in the general case for any N .
As in the unpenalized case, let us close this part with expanding the α dependent parameterδ * for small penalties which yields where we have definedȒ Analogous to the expression in (84), we may also write an approximation of the form The leading order contribution to the complexity in the smallα limit then becomes

Arbitrary N , penalized
We begin by noticing that the complexity in the unpenalized case is basis independent for the F 2 cost, i.e.
In general, introducing a penalty tensor, i.e. δ IJ → G IJ , makes the metric depending on where the entangling gates are uniformly penalized with the weighting factor α 2 , it can be shown that yields a matrix which takes the form see e.g. [63]. The matrix G off,ĨJ is symmetric and only consists of off-diagonal entries of the form 1 − α 2 which do not distinguish between the different classes of gates. We should add that RĨ J denotes the generalized matrix with respect to the generators of GL(N, R), see section III A 2. So, the expression in (98) shows that in normal mode basis there is no extra cost attributed to the entangling gates relative to the scaling gates. Moreover, the dominant contribution to the metric GĨJ is determined by δ IJ multiplied with the prefactor 1 + α 2 .
Note that, except the difference due to the appearance of the prefactor, this is similar as in the unpenalized geometry where G IJ = δ IJ .
In the unpenalized case both the ground state ψ T and the reference state ψ R turn out to be factorized Gaussian states in normal mode basis, i.e. Similarly, we may also expect that the optimal circuit in the penalized geometry is a diagonal matrix. This goes back to observation that the metric in normal mode basis has the same shape as in the unpenalized case, i.e. GĨJ ∼ δĨJ . Thus, we may again use the straight line solution. The additional change for α > 1 can be incorporated by making the replacement δ →δ * as illustrated in section V C 2. Everything so far has been discussed for the F 2 cost. From earlier studies we know that the latter aspects also apply for the F κ=2 cost. Proceeding with the latter, the dominant contribution to the complexity for the regulated field theory is then given by (91). The corresponding smallα expansion of (91) has been introduced in (95).

D. Unpenalized vs penalized
Finally, once the complexity for the regulated field in penalized geometry is given, we can compute the difference ∆D := D p κ=2 − D κ=2 . From previous findings we expect the latter to be positive semidefinite. The corresponding complexities for both geometries can be found in (91) and (55). Using the smallα expansion from (95) for the former penalized one in (91), we find that Of course, in the unpenalized limit, the expression in (100) vanishes, i.e. limα →0 ∆D = 0.
As soon as the gates are penalized, means when α > 1 orα > 0, respectively, the difference in the optimal depth starts to grow, similar to the complexity increase in the two coupled oscillator case from section V B. It should be noted that the sign of the approximate ∆D from (100) seems to depend on O(δω 0 ). This basically goes back to the smallα expansion used in (100) for which we need to distinguish between the different cases. For δω 0 1, we obviously find ∆D 0 as we would expect. In case of δω 0 1, we get a negative second term in the first line, but the leading positive term will ensure that ∆D is still positive.
However, ifȒα in the argument of the leading logarithm becomes too small, the logarithmic factor in the second line of course decreases either so that ∆D → 0. For simplifying the underlying expressions, let us assume 11 δω 0 1 for the remainder of this discussion.
According to our assumptions, we may in addition drop the leading term in the first line of (100) as well as the factor 2 in front of the second term which is assumed to be dominating. By doing so, we may further estimate If we now carefully look at the right-hand side of (101), we notice that this expression is proportional to the complexity one would obtain for the F κ=1 cost. Of course, the absolute value bars in D κ=1 can be neglected due to δω 0 1, see also discussion below. Specifically, defining Θ := − log(1 −Ȓα) where 0 < Θ 1, the relation from above can equivalently be written as Again, we would end up with the unpenalized complexity if Θ = 0. Recall that the F κ=1 cost yields the same leading order UV divergence as found via the holographic complexity proposals [63]. Even more, this particular cost-which gives rise to the so-called Manhattan metric-leads to the same logarithmic factor predicted on basis of the CA proposal, see section III C 2.
Let us here note that an interesting relation between the F 2 and F κ=1 costs has recently been found by exploring Nielsen's geometric approach to circuit complexity for two dimensional CFTs. 12 It has been shown that the difference between distinct metrics on the Virasoro circuits turns out to be vanishing in the holograhic large central charge limit [91].
Coming back to the present case, we can also write D κ=2 = ΦD κ=1 by simply defining Φ := − log(δω 0 ). This is possible, since by assuming δω 0 1 we can write | log( 1 δω 0 )| = Φ > 0 as noted before. Following these steps and replacing D κ=2 in (102) appropriately then yields This relation between complexities for two different costs is interesting. It somewhat resembles the situation described above in which a relation between two different costs has been found as well. Referring to the approximate expressions in (102) and (103), we may therefore ask whether weighting certain classes of gates-in particular the entangling one, since these also play an important role in holography related aspects-for a specific cost can compensate the geometry change in the space of unitaries for a different cost.
Of course, our previous estimations rely on certain simplifications. More detailed studies concerning such aspects may be important, particularly, if we presume that F κ=1 is the most holographic like cost which might be intrinsic to the CV and CA proposals. For that reason, we are therefore confronted with the question whether weighting gates in a certain way are necessary for a consistent definition of complexity in QFT. Moreover, what would be the corresponding holographic interpretation?
On the other hand, let us bring to mind that notions such as reference, geometry or gate set are not explicitly set in the holographic CV and CA proposals. Instead, they appear to be implicit in the duality. Therefore, identifying possible similarities between QFT and holography along these lines, might serve valuable information and shed light on the role of gate weighting. 12 The corresponding submanifolds are associated to the underlying symmetry groups.

E. Divergence
Resorting to the UV approximation, we have seen that there appears an additional logarithmic factor in the complexity, see expression (55). In the limit δ → 0, this is the contribution which diverges much faster than the prefactor V δ 1−d , for more details see also [63]. In order to eliminate the additional divergence, one may, for instance, assume that the reference frequency ω 0 is fixed at some UV scale with ω 0 ∼ e −σ /δ. Again, the numerical factor σ would ensure that ω 0 > ω k . We should note that these estimations are of course very rough and are only meant to provide some hint about the approximate scaling behavior.
A more general approach is presented in [63] for the unpenalized κ = 1 measure. Nevertheless, as a first attempt, we would like to continue in the following with the more simple estimations. 13 Inserting the explicit choice for ω 0 from above into (55) yields so that the additional divergence is eliminated. As we can see, the leading order UV divergence becomes a power law. On the other hand, if we suppose to work in the IR approximation by making the following simple assumptioñ then the IR contribution to the complexity takes the form after having assumed mδ 1. From the approximation above we get that the cancellation of the additional factor engenders that the IR contributions to the complexity depend on the UV cutoff scale δ.
To avoid this feature, one may assume ω 0 1/δ and identify ω 0 with some IR frequency [63]. However, in this case, the additional logarithmic factor will again contribute to the leading divergence in the limit δ → 0.
As we can see, there are certain ambiguities in the discussions above. An important point is that the scaling of the complexity clearly depends on the explicit choice for the reference 13 Note that, at least, referring to the κ = 1 measure, the simple estimation here still leads to the same scaling behavior as present in the more general result derived by computing the sum over all normal mode frequenciesω k , cf. [63].
frequency ω 0 . The dependence on any reference state parameter is obviously unsatisfying from the holographic point of view, since in the AdS/CFT dictionary this choice is not explicit (this is not so for the target state which in contrast has an holographic interpretation, see e.g. [61]) and we do not exactly know how to get access to it at all.
Let us return to the UV approximation in the penalized geometry for the F κ=2 cost from (91). Assigning a higher cost to the entangling gates introduces an additional degree of freedom which is the weighting factor α. Contrary to the frequency ω 0 , whose explicit value plays a substantial role in the unpenalized case, the factor α does not characterize the reference state. It specifies the metric in the manifold of unitaries. Hence, instead of fixing the reference frequency and thus the reference state in a certain way, we may simply eliminate the additional logarithmic contribution by tuning α correspondingly.
To derive the explicit form of α, one may solve a similar equation as before, i.e.
where ν is again taken to be some overall numerical factor. The leading contribution to the complexity would then read 14 as in (104), i.e. without the additional logarithmic divergence dominating in the limit δ → 0.
Thus, avoiding any specific choice for ω 0 , a simple power law for the leading divergence multiplied by an arbitrary factor can be realized via choosing α to be the solution of (107).
In the mentioned UV approach with m 1/δ, it can be shown that the weighting factor is determined by Of course, in the unpenalized case, i.e. α = 1, in other words, if we suppose ω 0 to be the only tunable parameter, we simply get ν = σ according to (109).
Similarly, we may focus on the IR contribution in the penalized case. In the latter case we may derive an analogous expression as in (106), where we need to take into account 14 As in the unpenalized case, although this rough estimation is in the first instance sufficient to deduce the characteristic leading order scaling, as well as the subleading IR contribution, a more detailed investigation will be interesting.
the modified parameterδ * . Apart from the IR contribution, according to the generalization derived for the unpenalized F κ=1 cost by summing over the normal mode frequencies [63], we may also expect some subleading UV contributions to the complexity which would roughly scale as in the smallα limit. Let us emphasize that, just formally, m * ≡ m 1 −Ȓα + O(α 2 ) may be seen as some effective mass which reduces to m when the entangling gates are not penalized, i.e. if we take the limitα → 0.

F. Comparison with C A
We can also compare the result in (91)  where an extra logarithmic factor arises due to the asymptotic joint contributions in the WDW action [28]. Recall that in the unpenalized case, the QFT prediction (55) follows if the dimensionless coefficient Λ is set equal to ω 0 L AdS . This choice may be motivated by the fact that C A should be independent of the AdS curvature scale L AdS when the complexity is defined in the CFT.
In the penalized case, the comparison between the logarithmic factors becomes even more interesting. As before, we may identify the CFT cutoff scale in (56) with the scale parameter δ appearing in (91). Then, taking, for instance, the smallα expansion from (95), we may relate both contributions to each other. The cancellation of the bulk curvature scale L AdS may be realized if we set Inserting Λ from (111) into the general expression (56) then yields In contrast to (57), we end up with an additional contribution in the denominator which is proportional toȒα and thus depends on the weighting factor α. Of course, the expression (112) still depends on the unspecified reference frequency ω 0 . At least when gate penalties are not implemented, we have encountered that this turns out to be a general feature of the notion of circuit complexity in QFT. Recall that in the unpenalized situation, eliminating the additional logarithmic contribution required fixing ω 0 at an appropriate scale.
However, introducing gate penalties, we have shown that tuning the weighting factor appropriately can eliminate the logarithmic contribution as well. Now, the logarithmic contribution in C A from (112) can be eliminated in the same way. In order to do so, we may for instance demand (107) to be fulfilled. In the present perturbative approximation (with respect toα), we would need to solve to find the required α which eliminates the additional logarithmic factor. The latter would then yield the leading order contribution As mentioned, the dimensionless coefficient Λ is related to the null normals on the boundary of the WDW patch in the bulk. To eliminate the curvature scale of the bulk spacetime L AdS , we have set Λ as in (111). Referring to such a relation between Λ and α (note that α 2 = α−1), we may ask how weighting a certain class of gates would be translated via holography. Of course, the present studies are clearly too premature to speculate towards this direction, but the found relations from the present and the previous sections may motivate further investigations.
Note that our findings have been obtained for a regulated free field. It is clear that this is far from dealing with strongly coupled theories with a large number of degrees of freedom with existent holographic duals. However, choosing the cost appropriately, the resulting similarities with holographic complexity proposals for the leading order UV divergence may provide useful insights. Namely, as noted above, such an accordance may suggest which cost function is intrinsic to the holographic complexity conjectures. Indeed, this was actually the main reason behind utilizing the F κ costs.
Despite the mentioned concordance, it will actually be necessary to extend the notion of complexity for strongly coupled theories with holographic duals, or at least, for some suitably excited states going beyond the free case. As mentioned, in the context of CFTs, interesting progress has been done in [91], also see [92]. Note also the recent studies in [82][83][84] introducing a notion of complexity which might shed light on this issue as well. Beyond these, circuit complexity has recently been studied for the TFD state in a free scalar field theory [74], also see [93] for similar considerations. The TFD state formed by entangling two copies of a CFT is especially important in holography, since, as already pointed out below figure 1, it is dual to an eternal BH in AdS [94].
Thus, it would be interesting to investigate the role of gate penalties in more holographic like setups in order to work out their possible holographic interpretation. On the other hand, as stressed before, such systems would particularly be interesting for making direct comparisons with recent studies arguing that holographic complexity might be nonlocal [44].

G. Distance dependent penalties
To find out what type of conditions are generically needed to be fulfilled by a field theory so that it has a bulk dual is important for better understanding the basic mechanisms behind holography. In previous studies, interesting conditions have been worked out by analyzing the corresponding boundary CFT, see e.g. [95,96].
More recently, it has been discussed that investigting the complexity growth for certain type of gauge theories may also shed light on such necessity conditions [97]. The motivation here is the conjectured criterion for the existence of a dual BH, namely, an upper bound in complexity with the scaling behavior C max ∼ e S where the exponent S denotes the corresponding entropy. Indeed, it has been shown that for both the classical as well as quantum cases, the complexity first grows and saturates afterwards at the maximum C max being in accordance with the second law of complexity [24,30]. More precisely, it has been found that the speed of growth increases when the time evolution is more nonlocal. It has been found that only the maximally nonlocal gauge theories satisfy the mentioned scaling behavior from above and thus possess the possibility of a gravity dual. Accordingly, the more nonlocal the interaction is the higher is the possibility for the existence of an holographic dual of the underlying theory.
On the other hand, as already mentioned, it has been discussed that complexity holographically defined via the CV and CA proposals may be nonlocal as well, but in a slightly different manner. To be more specific, it has been argued that any gate set for a CFT defining holographic complexity should necessarily contain bilocal gates acting at arbitraryly separated points [44]. Viewing the both conjectures as possible entries in the holographic dictionary, the presence of such bilocal gates constructing the corresponding field theory state may be taken as another necessity condition, similar to the one described above.
In the present paper, we use such kind of bilocal gates as well. However, we implement gate penalties for the entangling gates where those are uniformly weighted, thus, distinguishing between the different gate classes. It turns out that as long as we insert such distance independent penalties, we obtain a similar divergence structure in the complexity as seen in holographic computations, see (91). However, following the discussion in section V, this kind of agreement might not appear if certain gates are penalized according to the distance of points they act on. Even more, one may for instance think of entirely preventing such gates from participating in the construction of the circuit. In either cases, the characteristic power law scaling of the leading order UV divergence C UV,κ ∼ V δ 1−d , but of course the additional logarithmic factor as well, might be modified or even be rescinded completely.
Introducing locality in the way as described above may therefore lead to drastic differences between complexity in field theory and the holographic proposals. Taking into account that certain costs may be intrinsic to the holographic proposals due to the found similarities, such expectations may indeed favor the existence of bilocal gates in the gate set for holographic states as argued in [44]. Apart from that, the existence of bilocal gates in recent studies of circuit complexity for interacting [69] and time dependent nonlocal states [75] may explain the found behavior which is in line with the holographic predictions. It remains interesting to find out whether and how implementing distance dependent gate penalties would affect such agreements.

VI. CONCLUSION
We have investigated the effects of weighting certain classes of quantum gates constructing a quantum circuit for states in QFT. Our studies are based on the geometric approach to circuit complexity proposed by Nielsen and collaborators. Introducing such gate penalties may be motivated from various perspectives. For instance, they may incorporate the notion of locality in complexity when the latter is taken to be a physical attribute of a QFT. On the other hand, they may have important implications in the holographic dictionary. Closely related, also an application for tensor networks which are believed to provide a representation of a time slice of the AdS bulk space may motivate considering a penalized geometry in the space of unitaries.
In the present work, we have not introduced distance dependent weighting factors. Instead, we have worked with entangling gates which have been uniformly weighted. Of course, this does not introduce the notion of locality as described above. Nevertheless, an implementation of such kind has enabled us obtaining interesting insights which may motivate further investigations, in particular, by examining similar ideas for strongly coupled theories with holographic duals. Our results have generalized earlier findings dealing with the case of a pair of two coupled harmonic oscillators. More specifically, we have made the extension to the case of a regulated free field theory placed on the lattice for which the optimal circuit acts in form of a representation of GL(N, R).
Comparing both the penalized and the unpenalized results with each other, we have seen that assigning a higher cost to the entangling gates gives rise to a substantial increase in complexity. Furthermore, using the complexities for the F κ=2 cost function, we have found an interesting relation between these and the complexity for the unpenalized F κ=1 cost which is known to give rise to the Manhattan metric. From earlier studies we know that F κ=1 behaves as the most holographic like cost, since it yields the same leading order UV divergence as obtained via the holographic complexity proposals, including the additional logarithmic factor as appearing in the CA prediction. Referring to earlier results, the found relations have led us to speculate whether the change in the manifold of unitaries determined by a specific cost function may be compensated by introducing a penalty tensor for a different cost.
In addition, we have exhibited how the gate weighting modifies the leading order UV divergence in the complexity. In contrast to the unpenalized geometry, penalizing the entangling gates has introduced an additional degree of freedom, the latter corresponding to the mentioned weighting factor. We have shown that appropriately tuning this factor can eliminate the mentioned logarithmic contribution. Importantly, this procedure turned out to be independent from the choice for the reference frequency. Recall that in the penalized case, the latter is the only tunable control parameter. The dependence on any state parameter of this type is not explicit in the holographic proposals. Hence, it is of particular interest that the divergence can be modified by tweaking the weighting factor which specifies the metric in the space of unitaries instead of characterizing the reference state. In earlier studies it has been discussed that the geometric structure in the mentioned space may en-code important features of the holographic proposals. The main reason for such ideas lies in the found similarities in the divergence structure for some specific costs such as the F κ one.
Indeed, these similarities may suggest which cost is intrinsic to the holographic complexity conjectures. Hence, referring to our findings, the insertion of gate penalties in the space of unitaries makes such connections become even more interesting.
We have also compared our field theory results with the mentioned holographic proposals where we have given particular consideration to the predictions based on the CA conjecture.