Next Article in Journal
Editorial for Feature Papers 2021–2022
Next Article in Special Issue
The Weak Field Approximation of General Relativity and the Problem of Precession of the Perihelion for Mercury
Previous Article in Journal
Symmetrical Hybrid Coupled Fuzzy Fixed-Point Results on Closed Ball in Fuzzy Metric Space with Applications
Previous Article in Special Issue
Newton’s Third Law in the Framework of Special Relativity for Charged Bodies
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Circuit Complexity in Z2 EEFT

1
Department of Physics, RWTH Aachen University, Otto-Blumenthal-Straße, 52074 Aachen, Germany
2
Centre For Cosmology and Science Popularization (CCSP), SGT University, Delhi-NCR, Gurugram 122505, India
3
National Institute of Science Education and Research, Bhubaneswar 752050, India
4
Homi Bhabha National Institute, Training School Complex, Anushakti Nagar, Mumbai 400085, India
5
Department of Physics and Astronomy, University of Calgary, Calgary, AB T2N 1N4, Canada
6
Institute for Quantum Science and Technology, University of Calgary, Calgary, AB T2N 1N4, Canada
7
Department of Physics, Jadavpur University, Kolkata 700032, India
8
Department of Physics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India
9
Department of Applied Physics, Delhi Technological University, Delhi 110042, India
10
Department of Physics, Indian Institute of Technology Jodhpur, Karwar, Jodhpur 342037, India
11
National Institute of Technology Karnataka, Mangalore 575025, India
12
Department of Physics, University of Dhaka, Curzon Hall, Dhaka 1000, Bangladesh
13
Department of Theoretical Physics, University of Madras, Guindy Campus, Chennai 600025, India
14
Department of Physics, Indian Institute of Science and Educational Research, Behrampur 760010, India
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(1), 31; https://doi.org/10.3390/sym15010031
Submission received: 24 November 2022 / Revised: 12 December 2022 / Accepted: 14 December 2022 / Published: 22 December 2022
(This article belongs to the Special Issue Symmetry and Geometry in Physics II)

Abstract

:
Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in Z 2 Even Effective Field Theories ( Z 2 EEFTs). We consider a massive free field theory with higher-order Wilsonian operators such as ϕ 4 , ϕ 6 , and ϕ 8 . To facilitate our computation, we regularize the theory by putting it on a lattice. First, we consider a simple case of two oscillators and later generalize the results to N oscillators. This study was carried out for nearly Gaussian states. In our computation, the reference state is an approximately Gaussian unentangled state, and the corresponding target state, calculated from our theory, is an approximately Gaussian entangled state. We compute the complexity using the geometric approach developed by Nielsen, parameterizing the path-ordered unitary transformation and minimizing the geodesic in the space of unitaries. The contribution of higher-order operators to the circuit complexity in our theory is discussed. We also explore the dependency of complexity on other parameters in our theory for various cases.

1. Prologue

In recent years, tools and techniques from quantum information have played a vital role in developing new perspectives in areas such as quantum field theory and holography, particularly for AdS/CFT duality. A particular line of study in the context of AdS/CFT correspondence is deciphering the emergence of bulk physics using information from the boundary CFT [1]. It was shown in [2,3,4] that the codimension-2 extremal surfaces in the AdS are associated with the entanglement entropy (EE) of the boundary CFT. However, in recent years, studies in black hole physics have suggested that EE is not sufficient to capture the complete information, which led Susskind et al. to introduce a new measure known as Quantum Computational Complexity (QCC) [5,6,7,8,9,10,11,12,13]. In the context of AdS/CFT, the QCC of the dual CFT is proposed to be associated with the properties of the codimension-0 and codimension-1 extremal surfaces. This aroused the study of QCC in QFTs.
The complexity of quantum states has aroused a significant amount of interest not only in the context of holography but across different subfields of physics (from quantum computing and information to many-body physics), as it appears to be a better measure of information. In [14,15], the notion of circuit complexity was defined and studied for free bosonic field theory, and in [16,17], it was defined and studied for free fermionic field theory. For a weakly interacting field theory, the authors of [18] extended the study to the ϕ 4 theory, where in addition to the study of QCC, its relationship with renormalization group flows was also explored. The growth of complexity in the quantum circuit model was studied in [19]. Circuit complexity was also discussed in the context of chaos, quantum mechanics, and quantum computing in [20,21,22,23]. It has been probed in relation to conformal and topological field theories and the Chern–Simmons theory [24,25,26,27]. Active study in the context of many-body quantum systems has been also gaining interest in recent years [28]. QCC has been studied in many other contexts. It has been explored extensively in holography [29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57]. The thermodynamic properties of QCC were studied in [58,59,60]. In addition, various applications and properties of QCC were investigated in [61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84].
In this paper, we extend the work in [18] by including even higher-order Wilsonian operators, which we denote with Z 2 EEFT (Even Effective Field Theory). Our theory contains the interaction terms ϕ 4 , ϕ 6 , and ϕ 8 . These are weakly coupled to the free scalar field theory via the coupling constants λ 4 , λ 6 , and λ 8 respectively. The primary motivation for studying QCC in this context is to compute and understand QCC by including higher-order terms. The organization of the paper is as follows. In Section 2, we summarize Nielsen’s method for computing circuit complexity. In Section 3, we briefly discuss the pertinent details of EFT related to our work. In Section 4, we illustrate the computation of QCC for our theory by first giving an example of two coupled oscillators. In Section 5, we generalize the calculation to the N oscillator case. Since we could not observe any analytical expression for the relevant eigenvalues for N oscillators, in Section 6, we resort to numerical computation of the QCC. We plot the corresponding graphs of QCC with the relevant parameters in our theory. We finish up by summarizing and providing possible future prospects for our work.

2. Circuit Complexity and Its Purposes

Computationally, circuit complexity is defined as a measure of the minimum number of elementary operations required by a computer to solve a certain computational problem [85,86,87,88,89,90]. In quantum computation, a quantum operation is described by a unitary transformation. Therefore, quantum circuit complexity is the length of the optimized circuit that performs this unitary operation. As the size of the input increases, if the complexity grows polynomially, then the problem is called “easy”, but if it grows exponentially, then the problem is called “hard”.
Quantum information-theoretic concepts, such as entanglement, have proven to be helpful in areas other than quantum computing [91,92,93,94]. Quantum circuit complexity (QCC) is emerging as one such quantum information-theoretic concept that has the potential to explain phenomena in several areas of quantum physics. However, the lower bounding quantum circuit complexity is an extremely challenging open problem.
For our purpose, we will consider the geometric approach to computing quantum circuit complexity developed by Nielsen et al. [85,87]. The prime reason to consider a geometric approach is that it is much easier to minimize a smooth function in a smooth space than to minimize an arbitrary function in a discrete space. Since the unitaries are continuous, this method of optimization suits our needs well. Interestingly, this approach allows us to formulate the optimal circuit-finding problem in the language of the Hamiltonian control problem, for which a mathematical method called the calculus of variations can be employed to find the minima. Another reason is that this method is similar to the general Lagrangian formalism, where the motion of the test particle is obtained from minimizing a global functional. For example, in general relativity, test particles move along geodesics of spacetime described by the following geodesic equation:
d 2 x j d t 2 + Γ k l j d x k d t d x l d t = 0
where x j represents the coordinates for the position on the manifold and Γ k l j represents the Christoffel symbols given by the geometry of the spacetime. Thus, the problem of finding an optimal quantum circuit is related to “freely falling” along the minimal geodesic curve connecting the identity to the desired operation, and the path is given by the “local shape” of the manifold. If we have information about the local velocity and the geometry, then it is possible to predict the rest of the path. In this regard, geometric analysis of quantum computation is quite powerful, as it allows one to design the rest of the shortest quantum circuit with information about only part of it.

2.1. Main Mathematical Ideas

Our goal is to understand how difficult it is to implement an arbitrary unitary operation U generated by a time-dependent Hamiltonian H ( t ) :
U ( s ) = P exp i 0 s d s H ( s )
where P is the path-ordering operator and the space of the circuits is parameterized by s. The path-ordering operator P is the same as the time-ordering operator, which indicates that the circuit runs from right to left. We can expand the Hamiltonian H ( s ) as follows:
H ( s ) = I Y I ( s ) M I
where M I represents the generalized Pauli matrices and the coefficient Y I ( s ) represents the control functions that tell us the gate to be applied at particular values of s.
The Schrödinger equation d U / d t = i H U describes the evolution of the unitary operation:
d U ( s ) d s = i Y ( s ) I M I U ( s )
where at the final time t f , U ( t f ) = U .
We can impose a cost function F ( U , U ˙ ) on the Hamiltonian control H ( t ) which will tell us how difficult it is to apply a specific unitary operation U . One can then define a Riemannian geometry in the space of the unitary operations with this cost function. Then, the problem of finding an optimal control function is translated to the problem of finding the minimal geodesic in this geometry, and we can define a notion of distance in S U ( 2 n ) . For this, we have to define a curve U between the identity operation I and the desired unitary U , which is a smooth function U : [ 0 , t f ] S U ( 2 n ) such that U ( 0 ) = I and U ( t f ) = U . The length of this curve is defined as
d ( [ U ] ) = 0 t f d t F ( U , U ˙ )
This length d ( [ U ] ) gives the total cost of synthesizing the Hamiltonian that describes the motion along the curve. In particular, the distance d ( I , U ) is also a lower bound on the number of one- and two-qubit quantum gates necessary to exactly simulate U. The proof is available in the original papers of Nielsen [85]. Therefore, one can also consider the distance d ( [ U ] ) as an alternative description of the complexity.
The cost function F has to satisfy certain properties, such as continuity, positivity, positive homogeneity, and triangle inequality [77]. If we also demand F to be smooth (i.e., F C ), then the manifold is referred to as the Finsler manifold. Since the field of differential geometry is relatively mature, we hope that borrowing tools from differential geometry can provide a unique perspective on quantum complexity.
In the literature, there are several alternative definitions of the cost function F ( U , v ) . Some of them are
F 1 ( U , Y ) = I | Y I | F p ( U , Y ) = I p I | Y I | F 2 ( U , Y ) = I | Y I | 2 F q ( U , Y ) = I q I | Y I | 2
where F 1 , the linear cost functional measure, is the concept closest to the classical concept of counting gates, while F 2 , the quadratic cost functional, can be understood as the proper distance in the manifold. F p is similar to F 1 but with penalty parameters p I used to favor certain directions over others.
In Figure 1 the left figure represents a unitary transformation from a reference state to a target state using quantum gates, and the right figure represents geometrizing the problem of calculating the minimum number of gates representing the transformation.

2.2. Geometric Algorithm to Compute Circuit Complexity

We will now describe the algorithm for computing the circuit complexity. These algorithms are not rigorously proven, but from an operational point, these general steps are implemented to calculate the circuit complexity:
  • Give the Hamiltonian corresponding to a particular physical system;
  • Specify the reference state | ψ R , the target state | ψ T , and the unitary operation U that takes the former to the latter, where | ψ T = U | ψ R ;
  • Now, we need to choose some set of elementary gates Q a b = exp [ ϵ M a b ] , where M I represents the generators of the group corresponding to the choice of gates and ϵ is a controllable parameter. For simplicity, we often choose generators satisfying T r [ M I M J T ] = δ I J .
  • With the basis of generators M I , we parametrize the unitary operation U as U ( s ) ;
  • The velocity component Y I ( s ) can be explicitly computed using
    Y I ( s ) M I = i ( s U ( s ) ) U 1 ( s ) ) Y I ( s ) = 1 Tr M I M I T Tr s U ( s ) U 1 M I T
    For generators obeying T r [ M I M J T ] = δ I J , Y I ( s ) reduces to
    Y I ( s ) = Tr [ i ( s U ( s ) ) U 1 ( s ) M I T ]
    The right invariant metric in the space is given by
    d s 2 = G I J Y I Y J
    where G I J gives the penalty parameters. If G I J = δ I J (i.e., assigning an equal cost to every choice of gate), and having an extra condition T r [ M I M J T ] = δ I J , we obtain a metric of the reduced simple form
    d s 2 = δ I J Tr [ i ( s U ( s ) ) U 1 ( s ) M I T ] Tr [ i ( s U ( s ) ) U 1 ( s ) M J T ]
  • The general form of the circuit complexity would be
    C [ U ] = 0 1 d s G I J Y I ( s ) Y J ( s )
    The circuit complexity for the F 2 metric (i.e., G I J = δ I J ) is then
    C [ U ] = 0 1 d s g i j x ˙ i x ˙ j
  • From the boundary conditions of the evolution of unitary operations, we can compute the geodesic path and geodesic length. This length then gives a measure of circuit complexity.
In the literature, circuit complexity, using this geometric approach, is computed mostly for Gaussian wave functions because of its simpler structure compared with non-Gaussian wave functions. A Gaussian wave function can be represented as follows:
ψ exp 1 2 v a A ( s ) a b v b , where v = { x a , x b }
where x a and x b are the bases of vector v. If we can simultaneously diagonalize the reference and target states, then a common pattern observed in the complexity is that it will be given by some function of the ratio of the eigenvalues of A ( s = 0 ) and A ( s = 1 ) . Here, A ( s = 0 ) represents the reference state, and A ( s = 1 ) represents the target state.
We would like to mention that our approach to computing complexity is based on Nielsen’s geometric approach, which suffers from ambiguity in choosing the elementary quantum gates and states. However, these choices of our gates significantly simplify the calculation. Furthermore, the previous works on complexity in QFT and interacting QFT [14,18], using similar quantum gates to ours, have been connected to a holographic proposal, which is the original motivation to study quantum circuit complexity in QFT. Recently, Krylov complexity has been proposed as a tool for studying operator growth and associated quantum chaos [95,96,97,98,99,100,101,102,103]. Contrary to Nielsen’s geometric approach, the Krylov complexity is independent of such arbitrary choices, making it a good candidate for complexity in QFT and holography. However, Krylov complexity does not have a good operational meaning, such as in Nielsen’s geometric measure. Nielsen’s measure not only gives the state complexity but also gives us a method of constructing an optimal quantum circuit. This feature makes it more appealing than the Krylov complexity. In the future, we would like to study the Krylov complexity for our case too.

3. Effective Field Theory in a Nutshell

An effective field theory (EFT) is a theory corresponding to the dynamics of a physical system at energies that are smaller than the cutoff energy. EFTs have made a significant impact on several areas of theoretical physics, including condensed matter physics [104], cosmology [105,106,107,108,109,110,111], particle physics [112,113], gravity [114,115], and hydrodynamics [116,117]. The idea behind an EFT is that we can compute results without knowing the full theory. In the context of quantum field theory, this implies that using the method of EFTs, one can study the low energy aspect of the theory without having a full theory in the high energy limit. If the high-energy theory is known, then one can obtain an EFT using the “top-down” approach [118], where one has to eliminate high-energy effects. Using the “bottom-up” approach, one can obtain an EFT if the theory for high energy is not available. Here, one has to impose constraints given by symmetry and “naturalness” on suitable Lagrangians.
The Hamiltonian of our theory is
H = 1 2 d d 1 x π ( x ) 2 + ( ϕ ( x ) ) 2 + m 2 ϕ 2 ( x ) + 2 n = 2 4 C 2 n ϕ 2 n ( x )
where the coefficients C 2 n = 2 λ ^ 2 n / ( 2 n ) ! are called the “Wilson coefficients” for the Z 2 EEFTs in arbitrary dimensions. These coefficients depend on the scaling of the theory. These coefficients are expected to be functions of the λ s, the cutoffs of our theory, and this functional dependence can be found by solving the renormalization group equations or Callan–Symanzik equations. ϕ 2 n s are called the “Wilson operators” in Z 2 EEFTs. ϕ 2 ( x ) and ϕ 4 ( x ) are called “relevant operators of EEFTs”, and this theory is renormalizable up to ϕ 4 ( x ) . Beyond that, all the higher-order even terms, which are ϕ 6 ( x ) and ϕ 8 ( x ) in our case, are called “non-renormalizable irrelevant operators of Z 2 EEFTs”. However, it should be noted that even though this theory goes up in the “Wilson operator” order, the contributions from those terms decrease gradually. Therefore, it is an infinite convergent series. Building upon this, we go on to compute the circuit complexity in the Z 2 EEFT.

4. Circuit Complexity with ( λ ^ 4 ϕ 4 + λ ^ 6 ϕ 6 + λ ^ 8 ϕ 8 ) Interaction for the Case of Two Harmonic Oscillators

We work with massive scalar field theory and with the even interaction terms ϕ 4 , ϕ 6 , and ϕ 8 , which are weakly coupled to the free field theory via the coupling constants λ ^ 4 , λ ^ 6 , and λ ^ 8 , respectively. The inequality between the coupling constants is λ ^ 4 4 ! > λ ^ 6 6 ! > λ ^ 8 8 ! . The Hamiltonian for this scalar field in d spacetime dimensions is
H = 1 2 d d 1 x π ( x ) 2 + ( ϕ ( x ) ) 2 + m 2 ϕ ( x ) 2 + 2 n = 2 4 C 2 n ϕ 2 n ( x )
where the mass of the scalar field ϕ is m. We work in the weak coupling regime ( λ ^ 1 ) so that perturbative methods can be used to investigate the theory. The system can be reduced to a chain of harmonic oscillators if we regulate the theory by placing it on a ( d 1 ) dimensional square lattice with lattice spacing δ . We are taking the infinite system in Equation (14) and discretizing it to a finite N oscillator system because if we have an infinite convergent theory and an infinite number of terms in the Hamiltonian, then we do not have the finite symmetries that we are interested in. Therefore, the discretized Hamiltonian becomes
H = 1 2 n π ( n ) 2 δ d 1 + δ d 1 1 δ 2 i ϕ ( n ) ϕ n x ^ i 2 + m 2 ϕ ( n ) 2 + 2 λ ^ 4 4 ! ϕ ( n ) 4 + 2 λ ^ 6 6 ! ϕ ( n ) 6 + 2 λ ^ 8 8 ! ϕ ( n ) 8
where n denotes the spatial position vectors of the points on the lattice in d dimensions and x ^ i represents the unit vectors along the lattice. We make the following substitutions to simplify the form of the Hamiltonian:
X ( n ) = δ d / 2 ϕ ( n ) P ( n ) = π ( n ) / δ d / 2 M = 1 δ , ω = m , Ω = 1 δ λ 4 = λ ^ 4 4 ! δ d λ 6 = λ ^ 6 6 ! δ 2 d λ 8 = λ ^ 8 8 ! δ 3 d
After the substitutions, we obtain
H = n P ( n ) 2 2 M + 1 2 M ω 2 X ( n ) 2 + Ω 2 i X ( n ) X n x ^ i 2 + 2 λ 4 X ( n ) 4 + λ 6 X ( n ) 6 + λ 8 X ( n ) 8
We observe that the Hamiltonian obtained is identical to that of an infinite family of coupled anharmonic oscillators. The nearest term interaction comes from the kinetic part, and the self-interactions come from the remaining portion of the Hamiltonian. We start with the simple case of two coupled oscillators and generalize it to the case of N oscillators later in this paper. By setting M = 1 , the Hamiltonian takes the form
H = 1 2 p 1 2 + p 2 2 + ω 2 x 1 2 + x 2 2 + Ω 2 x 1 x 2 2 + 2 λ 4 x 1 4 + x 2 4 + λ 6 x 1 6 + x 2 6 + λ 8 x 1 8 + x 2 8
Now, let us consider the normal mode basis:
x ¯ 0 = 1 2 x 1 + x 2 , x ¯ 1 = 1 2 x 1 x 2 , p ¯ 0 = 1 2 p 1 + p 2 , p ¯ 1 = 1 2 p 1 p 2 ω ˜ 0 2 = ω 2 , ω ˜ 1 2 = ω 2 + 2 Ω 2
In the normal mode basis, the unperturbed Hamiltonian becomes decoupled. Then, the eigenfunctions and eigenvalues for the unperturbed Hamiltonian can be easily solved, which is just a product of the ground-state eigenfunctions of the oscillators in the normal basis:
ψ n 1 , n 2 0 x ¯ 0 , x ¯ 1 = 1 2 n 1 + n 2 n 1 ! n 2 ! ω ˜ 0 ω ˜ 1 1 / 4 π e 1 2 ω ˜ 0 x ¯ 0 2 1 2 ω ˜ 1 x ¯ 1 2 H n 1 ω ˜ 0 x ¯ 0 H n 2 ω ˜ 1 x ¯ 1
Here, H n ( x ) s denote Hermite polynomials of an order n. The ground state wavefunction with first-order perturbative correction in λ 4 , λ 6 , and λ 8 has the following expression:
ψ 0 , 0 x ¯ 0 , x ¯ 1 = ψ 0 , 0 0 x ¯ 0 , x ¯ 1 + λ 4 ψ 0 , 0 1 x ¯ 0 , x ¯ 1 4 + λ 6 ψ 0 , 0 1 x ¯ 0 , x ¯ 1 6 + λ 8 ψ 0 , 0 1 x ¯ 0 , x ¯ 1 8
Here, ψ 0 , 0 1 x ¯ 0 , x ¯ 1 4 , ψ 0 , 0 1 x ¯ 0 , x ¯ 1 6 , and ψ 0 , 0 1 x ¯ 0 , x ¯ 1 8 are the terms representing the first-order perturbative corrections to the ground state wavefunction due to the ϕ 4 , ϕ 6 , and ϕ 8 interactions, respectively, which are as follows:
ψ 0 , 0 1 x ¯ 0 , x ¯ 1 4 = 3 ( ω ˜ 0 + ω ˜ 1 ) 4 2 ω ˜ 0 ω ˜ 1 3 ψ 0 , 2 0 3 8 2 ω ˜ 1 3 ψ 0 , 4 0 3 ( ω ˜ 0 + ω ˜ 1 ) 4 2 ω ˜ 0 3 ω ˜ 1 ψ 2 , 0 0 3 4 ω ˜ 0 ( ω ˜ 0 + ω ˜ 1 ) ω ˜ 1 ψ 2 , 2 0 3 8 2 ω ˜ 0 3 ψ 4 , 0 0
ψ 0 , 0 1 x ¯ 0 , x ¯ 1 6 = 45 ( ω ˜ 0 + ω ˜ 1 ) 2 32 2 ω ˜ 0 2 ω ˜ 1 4 ψ 0 , 2 0 15 3 ( ω ˜ 0 + ω ˜ 1 ) 32 2 ω ˜ 0 ω ˜ 1 4 ψ 0 , 4 2 5 16 ω ˜ 1 4 ψ 0 , 6 0 45 ( ω ˜ 0 + ω ˜ 1 ) 2 32 2 ω ˜ 0 4 ω ˜ 1 2 ψ 2 , 0 45 ( ω ˜ 0 + ω ˜ 1 ) 16 ω ˜ 0 2 ( ω ˜ 0 + ω ˜ 1 ) ω ˜ 1 2 ψ 2 , 2 0 15 3 16 ω ˜ 0 ( ω ˜ 0 + 2 ω ˜ 1 ) ω ˜ 1 2 ψ 2 , 4 0 15 3 / 2 ( ω ˜ 0 + ω ˜ 1 ) 32 ω ˜ 0 4 ω ˜ 1 ψ 4 , 0 0 15 3 16 ω ˜ 0 2 ( 2 ω ˜ 0 + ω ˜ 1 ) ω ˜ 1 ψ 4 , 2 0 5 16 ω ˜ 0 4 ψ 6 , 0 0
ψ 0 , 0 1 x ¯ 0 , x ¯ 1 8 = 105 2 8 ω ˜ 0 5 + 315 2 8 ω ˜ 0 4 ω ˜ 1 + 315 2 8 ω ˜ 0 3 ω ˜ 1 2 + 105 2 8 ω ˜ 0 2 ω ˜ 1 3 ψ 2 , 0 0 + ( 105 2 8 ω ˜ 1 5 + 105 2 8 ω ˜ 0 3 ω ˜ 1 2 + 315 2 8 ω ˜ 0 3 ω ˜ 1 2 + 315 2 8 ω ˜ 1 4 ω ˜ 0 ) ψ 0 , 2 0 + 315 4 ω ˜ 0 3 ω ˜ 1 ( ω ˜ 0 + ω ˜ 1 ) + 315 2 ω ˜ 0 2 ω ˜ 1 2 ( ω ˜ 0 + ω ˜ 1 ) + 315 4 ω ˜ 1 3 ω ˜ 0 ( ω ˜ 0 + ω ˜ 1 ) * ψ 2 , 2 0 + 105 6 16 ω ˜ 0 5 + 105 6 8 ω ˜ 0 4 ω ˜ 1 + 105 6 16 ω ˜ 0 3 ω ˜ 1 2 ψ 4 , 0 0 + 105 6 16 ω ˜ 1 5 + 105 6 8 ω ˜ 1 4 ω ˜ 0 + 105 6 16 ω ˜ 0 2 ω ˜ 1 3 * ψ 0 , 4 0 + 105 3 2 ω ˜ 0 3 ω ˜ 1 ( 2 ω ˜ 0 + ω ˜ 1 ) + 105 3 2 ω ˜ 0 2 ω ˜ 1 2 ( 2 ω ˜ 0 + ω ˜ 1 ) ψ 4 , 2 0 + ( 105 3 2 ω ˜ 1 3 ω ˜ 0 ( 2 ω ˜ 1 + ω ˜ 0 ) + 105 3 2 ω ˜ 0 2 ω ˜ 1 2 ( ω ˜ 0 + 2 ω ˜ 1 ) ) ψ 2 , 4 0 + 105 4 ω ˜ 0 2 ω ˜ 1 2 ( ω ˜ 0 + ω ˜ 1 ) ψ 4 , 4 0 + 7 5 2 ω ˜ 0 5 + 7 5 2 ω ˜ 0 4 ω ˜ 1 ψ 6 , 0 0 + 7 5 2 ω ˜ 1 5 + 7 5 2 ω ˜ 1 4 ω ˜ 0 ψ 0 , 6 0 + 21 10 2 ω ˜ 1 3 ω ˜ 0 ( 3 ω ˜ 1 + ω ˜ 0 ) ψ 2 , 6 0 + 21 10 2 ω ˜ 1 3 ω ˜ 0 ( 3 ω ˜ 1 + ω ˜ 0 ) ψ 2 , 6 0 + 3 70 ω ˜ 0 5 ψ 8 , 0 0 + 3 70 ω ˜ 1 5 ψ 0 , 8 0
We can approximate the total ground state wave function in Equation (20) in exponential form as the values of λ 4 , λ 6 , λ 8 1 :
ψ 0 , 0 x ¯ 0 , x ¯ 1 ω ˜ 0 ω ˜ 1 1 / 4 π exp α 0 exp [ 1 2 ( α 1 x ¯ 0 2 + α 2 x ¯ 1 2 + α 3 x ¯ 0 2 x ¯ 1 2 + α 4 x ¯ 0 4 + α 5 x ¯ 1 4 + α 6 x ¯ 0 4 x ¯ 1 2 + α 7 x ¯ 0 2 x ¯ 1 4 + α 8 x ¯ 0 6 + α 9 x ¯ 1 6 + α 10 x ¯ 0 2 x ¯ 1 6 + α 11 x ¯ 0 6 x ¯ 1 2 + α 12 x ¯ 0 4 x ¯ 1 4 + α 13 x ¯ 0 8 + α 14 x ¯ 1 8 ) ]
We shall take ψ 0 , 0 x ¯ 0 , x ¯ 1 as the general target state wavefunction for calculating complexity in the following sections. The coefficients α 0 , α 1 , α 2 α 14 involved in the approximate wavefunction Equation (21) are given in the Table 1.

4.1. Circuit Complexity

We will describe complexity in terms of a quantum circuit model. To calculate the circuit complexity for the two-oscillator system with even interactions up to ϕ 8 , we need to fix our reference state, target state, and a set of elementary gates. We will construct the unitary transformation using these gates. This unitary transformation will take the system from the reference state ( | ψ R ) to the target state ( | ψ T ) (i.e., | ψ T = U | ψ R ). The minimum number of gates needed to construct such a unitary transformation is the complexity of the target state. Since our wave functions are nearly Gaussian, we can consider our space of states as the space of positive quadratic forms. This space can be parameterized as a function of a smooth parameter s as follows:
ψ s ( x ¯ 0 , x ¯ 1 ) = N s exp 1 2 v a A ( s ) a b v b
Here, N s is the normalization constant, and the parameter s runs from 0 to 1. If s = 1 , then the circuit represents the target state in Equation (21) with N s = 1 = ( ω ¯ 0 ω ¯ 1 ) 1 / 4 π exp [ α 0 ] , and at s = 0 , the circuit is in the reference state. The continuous unitary transformation, specified by the s parameter, gives us the target state from the reference state. Writing the states in the form of Equation (22) helps us formulate the matrix version of our problem. Now, we want to represent the exponent of the wavefunction, which is a polynomial in the matrix form A ( s ) :
ψ s = 0 ( x 1 , x 2 ) = N s = 0 exp ω r e f 2 ( x 1 2 + x 2 2 + λ 0 4 ( x 1 4 + x 2 4 ) + λ 0 6 ( x 1 6 + x 2 6 ) + λ 0 8 ( x 1 8 + x 2 8 ) )
Here λ 0 4 , λ 0 6 , and λ 0 8 are the initial coupling constants for ϕ 4 , ϕ 6 , and ϕ 8 respectively. By transforming them into the normal coordinates, we obtain
ψ s = 0 ( x ¯ 0 , x ¯ 1 ) = N s = 0 exp [ ω ˜ r e f 2 ( x ¯ 0 2 + x ¯ 1 2 + λ 4 2 ( x ¯ 0 4 + x ¯ 1 4 + 6 x ¯ 0 2 x ¯ 1 2 ) + λ 6 4 ( x ¯ 0 6 + x ¯ 1 6 + 15 x ¯ 0 4 x ¯ 1 2 + 15 x ¯ 1 4 x ¯ 0 2 ) + λ 8 8 ( x ¯ 0 8 + x ¯ 1 8 + 28 x ¯ 0 6 x ¯ 1 2 + 28 x ¯ 0 2 x ¯ 1 6 + 28 x ¯ 0 4 x ¯ 1 4 ) ) ]
We represent the exponent of the reference state shown above in a block diagonal matrix form as follows:
A ( s = 0 ) = A 1 0 0 0 0 0 A 2 0 0 0 0 0 A 3 0 0 0 0 0 A 4 0 14 × 14
The basis chosen for this representation is
v = x ¯ 0 , x ¯ 1 , x ¯ 0 x ¯ 1 , x ¯ 0 2 , x ¯ 1 2 , x ¯ 0 2 x ¯ 1 , x ¯ 0 x ¯ 1 2 , x ¯ 0 3 , x ¯ 1 3 , x ¯ 0 x ¯ 1 3 , x ¯ 0 3 x ¯ 1 , x ¯ 0 2 x ¯ 1 , x ¯ 0 4 , x ¯ 1 4
We need to ensure that the determinants of the A ( s = 0 ) and A ( s = 1 ) matrices are positive so that the wavefunction remains square-integrable everywhere. It should be noted that the matrix elements of A (i.e., A 1 0 A 4 0 ) are matrices themselves as shown below:
A 1 0 = ω ˜ r e f 0 0 ω ˜ r e f A 2 0 = λ 0 4 ω ˜ r e f b 0 0 0 1 2 1 2 ( 3 b ) 0 1 2 ( 3 b ) 1 2
A 3 0 = ω ˜ r e f λ 0 6 p 2 0 0 1 8 ( 15 2 k ) 0 k 1 8 ( 15 2 p ) 0 0 1 8 ( 15 2 p ) 1 4 0 1 8 ( 15 2 k ) 0 0 1 4
A 4 0 = ω ˜ r e f λ 0 8 1 8 1 4 ( 35 4 e ) 0 0 0 1 4 ( 35 4 e ) 1 8 0 0 0 0 0 e 1 16 ( 1 c ) 1 16 ( 1 d ) 0 0 1 16 ( 1 c ) 7 2 1 4 ( 35 4 e ) 0 0 1 16 ( 1 d ) 1 4 ( 35 4 e ) 7 2
We have introduced a few parameters (b, p, k, c, d, and e) to ensure that the determinant of each block diagonal matrix is positive definite. Because we are considering higher even interactions, it is necessary to consider various quadratic and other higher-order terms. To find the positive determinant of the A 2 0 block, the value of b must be in the range 2 < b < 4 . To eliminate the off-diagonal components, we set b = 3 , as it would give the minimum line element. In the A 3 0 block, we fix k = 15 2 , and the determinant becomes
Det ( A 0 3 ) = 1 512 p 221 + 4 15 + p p ω r e f 4 λ 6 4
We set p as 15 / 2 in the range 13 2 < p < 17 2 to satisfy the condition Det ( A 3 0 ) > 0 . Similarly, to ensure that the determinant of the A 0 4 block is positive and the line element is at its minimum, we set c = d = 1 and e = 35 / 4 .
Using the same basis as that mentioned in Equation (26), the target state matrix A ( s = 1 ) can be written as another 14 × 14 matrix:
A ( s = 1 ) = A 1 1 0 0 0 0 A 2 1 0 0 0 0 A 3 1 0 0 0 0 A 4 1 14 × 14
where we have the following block diagonal entries:
A 1 1 = α 1 0 0 α 2 A 2 1 = b ˜ α 5 0 0 0 α 3 1 2 ( 1 b ˜ ) α 5 0 1 2 ( 1 b ˜ ) α 5 α 4
A 3 1 = p ˜ α 6 0 0 1 2 ( 1 k ˜ ) α 7 0 k ˜ α 7 1 2 ( 1 p ˜ ) α 6 0 1 2 ( 1 p ˜ ) α 6 α 8 0 1 2 ( 1 k ˜ ) α 7 0 0 α 9
A 4 1 = d ˜ α 10 1 4 ( 1 e ˜ ) α 12 0 0 0 1 4 ( 1 e ˜ ) α 12 c ˜ α 11 0 0 0 0 0 e ˜ α 12 1 2 ( 1 c ˜ ) α 11 1 2 ( 1 d ˜ ) α 10 0 0 1 2 ( 1 c ˜ ) α 11 α 13 1 4 ( 1 e ˜ ) α 12 0 0 1 2 ( 1 d ˜ ) α 10 1 4 ( 1 e ˜ ) α 12 α 14
Here as well, we fix k ˜ , c ˜ , and d ˜ to be one to make the off-diagonal terms zero and keep b ˜ , p ˜ , and e ˜ for the positivity of all the block matrices.
As we are considering a closed quantum system, the reference state evolves into the target state via a certain unitary operator. Now, we represent this as
ψ s = 1 x ¯ 0 , x ¯ 1 = U ( s = 1 ) ψ s = 0 x ¯ 0 , x ¯ 1
We represent the unitary matrix in the following form:
U = P exp 0 s d s Y I ( s ) O I
We have to enact the operators O I in a particular order. The Y I s depend on the specific order in which the O I s are acting on the reference state. To find the minimum complexity, we try to have a geometric understanding of this unitary evolution process. Then, we can write the expression in Equation (29) as follows:
U = P exp 0 s Y I ( s ) M I d s
where M I j k s represents the GL ( 14 , R ) generators satisfying
Tr M I M J T = δ I J
Here, I , J runs from 1 to 196. As mentioned above, A ( s = 0 ) is the reference state which undergoes a unitary transformation to find the target state A ( s = 1 ) . It enables us to calculate the boundary conditions that lead us to calculate the complexity functional. Thus, we have
A ( s = 1 ) = U ( s = 1 ) A ( s = 0 ) U T ( s = 1 )
This leads to the expression
Y I M I = s U ( s ) U ( s ) 1
Hence, we obtain
Y I = 1 Tr M I M I T Tr s U ( s ) U 1 M I T
Now, the line element can be defined in terms of Y I ’s as follows:
d s 2 = G I J d Y I d Y J = G I J 1 Tr [ M I M I T ] Tr d s U ( s ) U 1 M I T 1 Tr M J M J T Tr d s U ( s ) U 1 M J T
Here, we should mention that d Y I does not denote the total differential for Y I . When observing the structure of the matrix A, we find that U ( s ) can be considered an element of GL ( 14 , R ) with a positive determinant. Now, we will express the U matrix with a similar structure to that in the target state matrix, and the unitary matrix contains four block diagonal matrices:
U = U 1 0 0 0 0 U 2 0 0 0 0 U 3 0 0 0 0 U 4 14 × 14
where
U 1 = x 0 x 1 x 3 x 2 x 3 + x 2 x 0 + x 1 U 2 = x ˜ 4 0 0 0 x ˜ 5 x ˜ 6 x ˜ 8 x ˜ 7 0 x ˜ 8 + x ˜ 7 x ˜ 5 + x ˜ 6
U 3 = x ˜ 9 0 0 0 0 x ˜ 10 x ˜ 11 x ˜ 13 x ˜ 12 0 0 x ˜ 13 + x ˜ 12 x ˜ 10 + x ˜ 11 0 0 0 0 x ˜ 14 U 4 = x ˜ 15 x ˜ 16 x ˜ 18 x ˜ 17 0 0 0 x 18 + x 17 x 15 + x 16 0 0 0 0 0 x ˜ 19 0 0 0 0 0 x ˜ 20 x ˜ 21 x ˜ 23 x ˜ 22 0 0 0 x ˜ 23 + x ˜ 22 x ˜ 20 + x ˜ 21
We have decomposed U ( s ) in terms of four block diagonal matrices. First, we note that the quadratic part of the first block is always diagonal, which induces a flat space, and thus we have x 3 = x 2 = 0 . In the unitary operator U , we do not allow the off-diagonal terms as in the final state, and only the block diagonal form remains. Thus, if we allow off-diagonal terms, we will have an increased line element, which we do not want. Now, GL ( 2 , R ) can be expressed as R × SL ( 2 , R ) , and so we observe that our U has an R 10 × SL ( 2 , R ) 4 group structure. We will parameterize each 2 × 2 block matrix in U as performed in [18] (i.e., we will parameterize it as an AdS 3 space):
x 0 = exp [ y 1 ] cosh ( ρ 1 ) x 1 = exp [ y 1 ] sinh ( ρ 1 ) x ˜ 4 = exp [ y 2 ] x 5 = exp [ y 3 ] cos ( τ 3 ) cosh ( ρ 3 ) x ˜ 6 = exp [ y 3 ] sin ( θ 3 ) cosh ( ρ 3 ) x ˜ 7 = exp [ y 3 ] sin ( τ 3 ) cosh ( ρ 3 ) x ˜ 8 = exp [ y 3 ] cos ( θ 3 ) sinh ( ρ 3 ) x ˜ 9 = exp [ y 4 ] x ˜ 10 = exp [ y 5 ] cos ( τ 5 ) cosh ( ρ 5 ) x ˜ 11 = exp [ y 5 ] sin ( θ 5 ) sinh ( ρ 5 ) x ˜ 12 = exp [ y 5 ] sin ( τ 5 ) cosh ( ρ 5 ) x ˜ 13 = exp [ y 5 ] cos ( θ 5 ) sinh ( ρ 5 ) x ˜ 14 = exp [ y 6 ] x ˜ 15 = exp [ y 7 ] cos ( τ 7 ) cosh ( ρ 7 ) x ˜ 16 = exp [ y 7 ] sin ( θ 7 ) sinh ( ρ 7 ) x ˜ 17 = exp [ y 7 ] sin ( τ 7 ) cosh ( ρ 7 ) x ˜ 18 = exp [ y 7 ] cos ( θ 7 ) sinh ( ρ 7 ) x ˜ 19 = exp [ y 8 ] x ˜ 20 = exp [ y 9 ] cos ( τ 9 ) cosh ( ρ 9 ) x ˜ 21 = exp [ y 7 ] sin ( θ 9 ) sinh ( ρ 9 ) x ˜ 22 = exp [ y 9 ] sin ( τ 9 ) cosh ( ρ 9 ) x ˜ 23 = exp [ y 9 ] cos ( θ 9 ) sinh ( ρ 9 )
Using these parameters for U , we can then calculate the infinitesimal line element in Equation (35), which now becomes
d s 2 = [ 2 y 1 2 + y 2 2 + 2 y 3 2 + y 4 2 + 2 y 5 2 + y 6 2 + 2 y 7 2 + y 8 2 + 2 y 9 2 + 2 ( ρ 1 2 + ρ 3 2 + ρ 5 2 + ρ 7 2 + ρ 9 2 + cosh ( 2 ρ 3 ) cosh 2 ( ρ 3 ) τ 3 2 + sinh 2 ( ρ 3 ) θ 3 2 sinh 2 ( 2 ρ 3 ) θ 3 τ 3 + cosh ( 2 ρ 5 ) cosh 2 ( ρ 5 ) τ 5 2 + sinh 2 ( ρ 5 ) θ 5 2 sinh 2 ( 2 ρ 5 ) θ 5 τ 5 + cosh ( 2 ρ 7 ) cosh 2 ( ρ 7 ) τ 7 2 + sinh 2 ( ρ 7 ) θ 7 2 sinh 2 ( 2 ρ 7 ) θ 7 τ 7 + cosh ( 2 ρ 9 ) cosh 2 ( ρ 9 ) τ 9 2 + sinh 2 ( ρ 9 ) θ 9 2 sinh 2 ( 2 ρ 9 ) θ 9 τ 9 ) ]
We need to find the shortest path between the reference and the target state in this geometry, described by metric expressed in Equation (38). This shortest path will be the circuit complexity for our problem. For this purpose, we also need to calculate the proper boundary conditions denoting the reference and target states.

4.2. Boundary Conditions for the Geodesic

As we mentioned before, the minimal geodesic will be equivalent to finding the geodesic in the G L ( 14 , R ) group manifold. The geodesic can be found by minimizing the following equation on the distance functional:
D ( U ) = 0 1 g i j x ˙ i x ˙ j d s
The boundary conditions from Equation (32) are
y i ( 0 ) = ρ j ( 0 ) = 0
where i = 1 , 2 , , 9 and j = 1 , 3 , 5 , 7 , 9 .
For solving the geodesic equations, we have to find conserved charges using the results of [14], as our metric is R 10 × SL ( 2 , R ) 4 . Using Equations (40) and (42), we obtain
y i ( s ) = y i ( 1 ) s ρ j ( s ) = ρ j ( 1 ) s
where, i = 1 , 2 , , 9 and j = 1 , 3 , 5 , 7 , 9 :
2 ( y 1 ( 1 ) ρ 1 ( 1 ) ) = ln α 1 ω ˜ r e f 2 ( y 1 ( 1 ) + ρ 1 ( 1 ) ) = ln α 2 ω ˜ r e f 2 y 2 ( 1 ) = ln b ˜ α 5 3 ω ˜ r e f λ 4 2 y 3 ( 1 ) = ln 4 α 3 α 4 ( 1 b ˜ ) 2 α 5 2 ω ˜ r e f λ 4 2 ρ 3 ( 1 ) = cosh 1 α 3 + α 4 4 α 3 α 4 ( 1 b ˜ ) 2 α 5 2 2 y 4 ( 1 ) = ln 4 p ˜ α 6 15 ω r e f λ 6 2 y 5 ( 1 ) = ln 16 α 7 α 8 4 ( 1 p ˜ ) 2 α 6 2 ω ˜ r e f λ 6 2 y 6 ( 1 ) = ln 4 α 9 ω ˜ r e f λ 6 2 ρ 5 ( 1 ) = cosh 1 2 ( α 7 + α 8 ) 16 α 7 α 8 4 ( 1 p ˜ ) 2 α 6 2 y 7 ( 1 ) = ln 64 α 10 α 11 4 ( 1 e ˜ ) 2 α 12 2 ω ˜ r e f λ 8 2 ρ 7 ( 1 ) = cosh 1 α 10 + α 11 64 α 10 α 11 4 ( 1 e ˜ ) 2 α 12 2 2 y 8 ( 1 ) = ln 4 e ˜ α 12 35 ω ˜ r e f λ 6 2 ρ 9 ( 1 ) = cosh 1 α 13 + α 14 4 α 13 α 14 ( ( 1 e ˜ ) 2 / 4 ) α 12 2 2 y 9 ( 1 ) = ln 4 α 13 α 14 ( ( 1 e ˜ ) 2 / 4 ) α 12 2 7 ω ˜ r e f λ 8
With the same arguments in [14], we set
τ j ( s ) = 0 θ j ( s ) = θ c j
where j = 3 , 5 , 7 , 9 and θ c j are constants which do not depend on s. Therefore, we have the freedom to choose any constant value of θ c j here which indicates that it will leave the origin in any direction. (Note: When we are calculating ρ 5 , any arbitrary constant value will not provide us an analytical expression, so we choose θ 5 to be zero to find the simple analytical expression in Equation (42)) By taking into account all of these terms and conditions, we find the complexity functional as follows:
D ( U ) = 2 i = 1 , o d d 9 y i ( 1 ) 2 + 1 2 i = 2 , e v e n 8 y i ( 1 ) 2 + j = 1 , o d d 9 ρ i ( 1 ) 2 = 1 2 ( 2 cosh 1 α 3 + α 4 4 α 3 α 4 α 5 2 ( 1 + b ˜ ) 2 2 + 2 cosh 1 α 10 + α 11 2 16 α 10 α 11 + ( 1 e ˜ ) 2 α 12 2 2 + 2 cosh 1 α 13 + α 14 4 α 13 α 14 ( ( 1 e ˜ ) 2 / 4 ) α 12 2 + 2 cosh 1 2 ( α 7 + α 8 ) α 6 2 + 4 α 7 α 8 + α 6 2 p ˜ 2 + 1 2 ln α 2 α 1 2 + 1 2 ln α 1 α 2 ω ˜ r e f 2 2 + ln 4 α 9 λ 6 ω ˜ r e f 2 + 2 ln 4 α 3 α 4 ( 1 b ˜ ) 2 α 5 2 ω ˜ r e f λ 4 2 + 2 ln b ˜ α 5 3 λ 4 ω ˜ r e f 2 + 2 ln 64 α 10 α 11 4 ( 1 + e ˜ ) 2 α 12 2 ω ˜ r e f λ 8 2 + ln 4 α 12 e ˜ 35 λ 8 ω ˜ r e f 2 + 2 ln 4 α 13 α 14 ( ( 1 + e ˜ ) 2 / 16 ) α 12 2 7 ω ˜ r e f λ 8 2 + 2 ln 2 α 6 2 + 4 α 7 α 8 + α 6 p ˜ ω ˜ r e f λ 6 2 + ln 4 α 6 p ˜ 15 λ 6 ω ˜ r e f 2 ) 1 2
which is a straight line, as there is no off-diagonal term for when we set τ i ( s ) to be 0 and θ j ( s ) to be independent of s, according to Equation (41).
For the particular choice of a cost function that we used (i.e., F 2 ), the complexity functional is
C 2 = s = 0 1 d s F 2
As was shown in Equation (44), the complexity functional can be written in terms of some boundary values only. It can also be proven that this functional can just involve the eigenvalues of the reference and target matrix:
C 2 = 1 2 i = 1 14 log ( λ T ) i ( λ R ) i 2
The proof of this expression is explicitly constructed in Appendix B. This result is very crucial, and we exploit this relation to generalize the complexity to N oscillators.

5. Analysis for N Oscillators

To this point, our discussion in this paper has been concerned with two coupled harmonic oscillators involving higher-order interactions. To extend our analysis to effective field theories, we first need to generalize our results to N coupled harmonic oscillators with ϕ 4 + ϕ 6 + ϕ 8 interaction terms. Then, we will gradually move toward the continuum limit for this problem. With that in mind, we consider the following Hamiltonian:
H = 1 2 a = 0 N 1 p a 2 + ω 2 x a 2 + Ω 2 ( x a x a + 1 ) 2 + 2 λ 4 x a 4 + 2 λ 6 x a 6 + 2 λ 8 x a 8
Now, we will assume that the periodic boundary condition is valid on this lattice of N oscillators such that x a + N = x a (as it allows us to impose translational symmetry and use a Fourier transform for expression in terms of the normal mode coordinates). Then, we perform discrete a Fourier transform for this lattice using
x a = 1 N k = 0 N 1 exp i 2 π a N k x ˜ k
p a = 1 N k = 0 N 1 exp i 2 π a N k p ˜ k
Using the above Equations (48) and (49), we can transform the spatial coordinates into normal mode coordinates. The resultant Hamiltonian is then
H = 1 2 a = 0 N 1 p a 2 + ω 2 x a 2 + Ω 2 ( x a x a + 1 ) 2 + 2 λ 4 x a 4 + 2 λ 6 x a 6 + 2 λ 8 x a 8 = 1 2 k = 0 N 1 | p ˜ k | 2 + ω 2 + 4 Ω 2 sin 2 π k N | x ˜ k | 2 + H ϕ 4 + H ϕ 6 + H ϕ 8
where H ϕ 4 , H ϕ 6 , and H ϕ 8 are the contributions from the ϕ 4 , ϕ 6 , and ϕ 8 interaction terms, respectively. Now, we have
H ϕ 4 = λ 4 N k 1 , k 2 , k 3 = 0 N 1 x ˜ α x ˜ k 1 x ˜ k 2 x ˜ k 3 ; α = N k 1 k 2 k 3 mod N
H ϕ 6 = λ 6 N 2 k 1 , k 2 , k 3 , k 4 , k 5 = 0 N 1 x ˜ α x ˜ k 1 x ˜ k 2 x ˜ k 3 x ˜ k 4 x ˜ k 5 ; α = N i = 1 5 k i mod N
H ϕ 8 = λ 8 N 3 k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 = 0 N 1 x ˜ α x ˜ k 1 x ˜ k 2 x ˜ k 3 x ˜ k 4 x ˜ k 5 x ˜ k 6 x ˜ k 7 ; α = N i = 1 7 k i mod N
The proof of transformation of the interaction Hamiltonian in a Fourier space is given in Appendix A.
The target state wavefunction is given by
ψ 0 , 0 , 0 x ¯ 0 , x ˜ N 1 = ω ˜ 0 ω ˜ 1 ω ˜ N 1 π N 1 4 exp 1 2 k = 0 N 1 ω ˜ k x ˜ k 2 + λ 4 ψ 4 1 + λ 6 ψ 6 1 + λ 8 ψ 8 1
where the total perturbation wavefunction ψ 1 is
ψ 1 = λ 4 ψ 4 1 + λ 6 ψ 6 1 + λ 8 ψ 8 1
where λ 4 ψ 4 1 , λ 6 ψ 6 1 , and λ 8 ψ 8 1 are first-order perturbation corrections for the self-interaction terms ϕ 4 , ϕ 6 , and ϕ 8 , respectively.
The expression of ψ 4 1 along with the B terms was taken from [18].
The expression for ψ 4 1 is
ψ 4 1 = a = 0 4 a mod N 0 N 1 B 1 ( a ) + a , b = 0 ( 2 a + 2 b ) mod N 0 a b N 1 B 2 ( a , b ) 2 + a , b = 0 ( 3 b + a ) mod N 0 a b N 1 B 3 ( a , b ) + a , b , c = 0 ( a + 2 b + c ) mod N 0 a b c N 1 B 4 ( a , b , c ) 2 + a , b , c , d = 0 ( a + b + k + d ) mod N 0 a b c d N 1 B 5 ( a , b , c , d ) 24
The expression for ψ 6 1 is
ψ 6 1 = 1 N 2 [ a = 0 6 a mod N 0 N 1 C 1 ( a ) + a , b = 0 ( a + 5 b ) mod N 0 a b N 1 C 2 ( a , b ) + a , b = 0 ( 3 b + 3 a ) mod N 0 a b N 1 1 2 C 3 ( a , b ) + a , b = 0 ( 2 a + 4 b ) mod N 0 a b N 1 C 4 ( a , b ) + a , b , c = 0 ( a + b + 4 c ) mod N 0 a b c N 1 1 2 C 5 ( a , b , c ) + a , b , c = 0 ( 2 a + b + 3 c ) mod N 0 a b c N 1 C 6 ( a , b , c ) + a , b , c = 0 ( 2 a + 2 b + 2 c ) mod N 0 a b c N 1 1 6 C 7 ( a , b , c ) + a , b , c , d = 0 ( a + b + c + 3 d ) mod N 0 a b c d N 1 1 6 C 8 ( a , b , c , d ) + a , b , c , d = 0 ( a + b + 2 c + 2 d ) mod N 0 a b c d N 1 1 4 C 9 ( a , b , c , d ) + a , b , c , d , e = 0 ( a + b + c + d + 2 e ) mod N 0 a b c d e N 1 1 4 ! C 10 ( a , b , c , d , e ) + a , b , c , d , e , f = 0 ( a + b + c + d + e + f ) mod N 0 a b c d e f N 1 1 6 ! C 11 ( a , b , c , d , e , f ) ]
where the terms C 1 , C 2 , …, C 11 are given according to the Table 2.
The expression for ψ 8 1 is
ψ 8 1 = 1 N 3 [ a = 0 8 a mod N 0 N 1 D 1 ( a ) + a , b = 0 ( 6 a + 2 b ) mod N 0 a b N 1 D 2 ( a , b ) + a , b = 0 ( 5 a + 3 b ) mod N 0 a b N 1 D 3 ( a , b ) + a , b = 0 ( 4 a + 4 b ) mod N 0 a b N 1 1 2 D 4 ( a , b ) + a , b = 0 ( a + 7 b ) mod N 0 a b N 1 D 5 ( a , b ) + a , b , c = 0 ( a + b + 6 c ) mod N 0 N 1 1 2 D 6 ( a , b , c ) + a , b , c = 0 ( a + 2 b + 5 c ) mod N 0 a b c N 1 D 7 ( a , b , c ) + a , b , c = 0 ( a + 4 b + 3 c ) mod N 0 a b c N 1 D 8 ( a , b , c ) + a , b , c = 0 ( 2 a + 2 b + 4 c ) mod N 0 a b c N 1 D 9 ( a , b , c ) 2 + a , b , c = 0 ( 3 a + 2 b + 3 c ) mod N 0 a b c N 1 D 10 ( a , b , c ) 2 + a , b , c , d = 0 ( a + b + 2 c + 4 d ) mod N 0 a b c d N 1 D 11 ( a , b , c , d ) 2 + a , b , c , d = 0 2 ( a + b + c + d ) mod N 0 a b c d N 1 D 12 ( a , b , c , d ) 24 + a , b , c , d = 0 ( a + 2 b + 2 c + 3 d ) mod N 0 a b c d N 1 D 13 ( a , b , c , d ) 2 + a , b , c , d = 0 ( a + b + c + 5 d ) mod N 0 a b c d N 1 D 14 ( a , b , c , d ) 6 + a , b , c , d = 0 ( a + b + 3 c + 3 d ) mod N 0 a b c d N 1 D 15 ( a , b , c , d ) 4 + a , b , c , d , e = 0 a + b + 2 ( c + d + e ) mod N 0 a b c d e N 1 D 16 ( a , b , c , d , e ) 12 + a , b , c , d , e = 0 ( a + b + c + 2 d + 3 e ) mod N 0 a b c d e N 1 D 17 ( a , b , c , d , e ) 6 + a , b , c , d , e = 0 ( a + b + c + d + 4 e ) mod N 0 a b c d e N 1 D 18 ( a , b , c , d , e ) 24 + a , b , c , d , e , f = 0 ( a + b + c + d + e + 3 f ) mod N 0 a b c d e f N 1 D 19 ( a , b , c , d , e , f ) 5 ! + a , b , c , d , e , f = 0 ( a + b + c + d + 2 e + 2 f ) mod N 0 a b c d e f N 1 D 20 ( a , b , c , d , e , f ) 48 + a , b , c , d , e , f , g = 0 ( a + b + c + d + e + f + 2 g ) mod N 0 a b c d e f g N 1 D 21 ( a , b , c , d , e , f , g ) 6 ! + a , b , c , d , e , f , g , h = 0 ( a + b + c + d + e + f + g + h ) mod N 0 a b c d e f g h N 1 D 22 ( a , b , c , d , e , f , g , h ) 8 ! ]
The terms D 1 , D 2 , D 3 D 22 are given in the Table 3.
Now, for finding the complexity, we represent the N oscillator wavefunction in the following way:
ψ 0 , 0 , 0 s = 0 x ˜ 0 , , x ˜ N 1 exp 1 2 v a A a b s = 1 v b
Once again, we have to choose a particular basis. Now, there are many choices for bases, but we consider the choice of bases in the following way:
v = { x ˜ 0 , x ˜ N 1 , x ˜ 0 2 , , x ˜ N 1 2 , , x ˜ a x ˜ b , , x ˜ 0 3 , , x ˜ N 1 3 , , x ˜ a x ˜ b x ˜ c , , x ˜ 0 4 , , x ˜ N 1 4 , , x ˜ a x ˜ b x ˜ c x ˜ d , , x ˜ a 2 x ˜ b 2 , x ˜ 0 5 , , x ˜ N 1 5 , x ˜ 0 6 , , x ˜ N 1 6 , , x ˜ a x ˜ b x ˜ c x ˜ d x ˜ e x ˜ f , , x ˜ a 3 x ˜ b 3 , , x ˜ a x ˜ b x ˜ c x ˜ d x ˜ e x ˜ f x ˜ g x ˜ h , , x ˜ a 1 / 2 x ˜ b x ˜ c 1 / 2 , }
Here, a, b, c, d, e, f, g, and h are indices that can have any value in the range from 0 to N 1 and must not be equal to each other. In the last term in v , we mention a term that can be used to kill off-diagonal entries just as we did for the two-oscillator case. There will be many more terms like this on this basis. Expressing them explicitly is not necessary for our current work, and so we have not mentioned them.
Now, we will represent the matrix A ( s = 1 ) for N oscillators in a block diagonal fashion. In this format, the matrix will look like this:
A a b s = 1 = A 1 0 0 A 2
where A 1 and A 2 are the so-called unambiguous and ambiguous blocks. Once we fix the target or reference stats, the coefficients in the unambiguous blocks are fixed. However, this is not the case for the ambiguous block, as it contains numerous parameters which are not fixed beforehand.
In the unambiguous block A 1 , we have all of the coefficients of terms such as x a 2 and x a x b in Equation (54) multiplied by 2 . On the other hand, the coefficients (multiplied by 2 ) for terms such as
x a 2 x b 2 , x a 2 x b 2 x c 2 , x a x b x c x d
are there on the A 2 block.
To compute the complexity, we choose a particular non-entangled reference state for arbitrary N oscillators:
ψ s = 0 ( x 1 , x 2 , . , x n ) = N s = 0 exp i = 0 N 1 ω ˜ r e f 2 x i 2 + λ 4 0 x i 4 + λ 6 0 x i 6 + λ 8 0 x i 8
which can be represented as follows: S
ψ s = 0 ( x ˜ 1 , x ˜ 2 , . , x ˜ n ) = N s = 0 exp 1 2 v a A a b s = 0 v b
where the matrix A a b s = 0 can be written as in the normal mode basis:
A a b s = 0 = ω ˜ r e f I N × N 0 0 A 2 s = 0
Here, I N × N is the N dimensional unit matrix. We are assuming that all the natural frequencies are (i.e., for all x i it is true that ω 0 = ω ˜ r e f ). However, A 2 s = 0 cannot be represented as easily as the first block because there are many undetermined parameters. Nevertheless, we can choose these parameters in such a way that the A 2 s = 0 block becomes diagonal, just as we did for the two-oscillator case.
The complexity functional depends on the particular cost function that we choose. For the different cost functions mentioned in Equation (5), we find a different expression for the complexity functional. However, we will work with the following cost function for the rest of the paper:
F κ ( s ) = I p I | Y I | κ
With respect to this particular choice for the cost function, the complexity functional becomes
C κ = s = 0 1 F κ d s
Here, we set all the p I variables to be one to put all directions in the circuit space on equal footing. Now, if we choose the parameters of A 2 s = 0 such that A s = 0 is diagonal, then obviously, A s = 1 and A s = 0 will commute. If this is the case, then all C κ can be written in a single equation as mentioned in [18]:
C κ = C κ ( 1 ) + C κ ( 2 ) = 1 2 κ i = 0 N 1 | log λ i ( 1 ) ω ˜ r e f | κ + C κ ( 2 )
Here, λ i ( 1 ) represents the eigenvalues of the unambiguous block of the A s = 1 matrix and C κ ( 1 ) and C κ ( 2 ) denote the contributions to the complexity functional for the unambiguous and ambiguous blocks, respectively. From here on, we will use the C 1 complexity functional.

Commenting on C 1 ( 2 ) and the Ambiguous Block

Here, we comment on the difficulties and issues with defining the ambiguous block A 2 , as has also been discussed in [18] for the ϕ 4 interaction theory. One of the reasons for calling the A 2 matrix ambiguous is that there is a lot of arbitrariness in defining this block of the matrix; that is, there are many possible choices for defining the coefficients of the A 2 block, such as some terms which can be defined in the diagonal entries as well as in the off-diagonal entries and several higher-order cross terms, including x ˜ a x ˜ b x ˜ c x ˜ d x ˜ e x ˜ f x ˜ g x ˜ h , which can be defined in several forms. One possible solution to this is to try to define the A 2 matrix with the most general entries in which the coefficients are placed among all possible places in the A 2 block so that the determinant of the matrix should be positive definite. For the ambiguous block, the complexity C 1 ( 2 ) can be defined with eigenvalues λ j ( 2 ) , and the total complexity will be given by Equation (68). However, due to the great arbitrariness or ambiguities in defining the A 2 block, we cannot easily define the complexity C 1 ( 2 ) . One could think of using the renormalization approach to find the general form of C 1 ( 2 ) , as was performed in [18] for the ϕ 4 interaction, but the theory in our case is non-renormalizable beyond the ϕ 4 term, so it is also not possible to use the standard renormalization procedure for our case.
Here, we calculate the complexity of the unambiguous block, which is easy to analyze. We use this expression to evaluate the complexity functional in the next section.

6. Numerical Evaluation of the Complexity Functional

Up to this point, we have always set the value of M = 1 in the two-oscillator Hamiltonian and N oscillator Hamiltonian. However, for a generic analysis and also for the continuum limit, we need to put the M factor back in H. If we reinstate the factor of M in the Hamiltonian, we obtain the following expression for the Hamiltonian:
H = 1 M n P ( n ) 2 2 + 1 2 M 2 ω 2 X ( n ) 2 + Ω 2 i X ( n ) X n x ^ i 2 + 2 λ 4 X ( n ) 4 + λ 6 X ( n ) 6 + λ 8 X ( n ) 8
The overall factor in front of the Hamiltonian does not have any effect on the structure of the eigenfunctions of this Hamiltonian. However, some of the factors need to be rescaled in presence of the M factor, which are given below:
ω ω δ Ω Ω δ λ 4 λ 4 δ 2 λ 6 λ 6 δ 2 λ 8 λ 8 δ 2 ω ˜ r e f ω ˜ r e f δ λ 4 0 λ 4 0 δ
λ 6 0 λ 6 0 δ λ 8 0 λ 8 0 δ
Here, we would like to mention again that M = 1 δ . Using these rescaled parameters, we assume that the general form of the eigenvalues of A 1 represent the N oscillator Hamiltonian with first-order perturbative correction:
Λ i k = Λ 4 i k + λ 6 f i k N , ω ˜ i p + λ 8 g i k N , ω ˜ i p , N : Even = Λ 4 i k + λ 6 f i k N , ω ˜ i p + λ 8 g i k N , ω ˜ i p , N : Odd
where N denotes the number of lattice points in each spatial dimension and the i k indices run from 0 to N 1 for each dimension. Then, the d 1 dimensional spatial volume becomes L d 1 = ( N δ ) d 1 .
Here, Λ 4 i k is the contribution from the ϕ 4 interaction, and f, g, f , and g denote the additional contributions to the eigenvalues in the presence of ϕ 6 and ϕ 8 interaction. The form of Λ 4 i k , as mentioned in [18], is
Λ 4 i k = ω ˜ i k δ + 3 λ 4 2 N 2 ω ˜ i k ( ω ˜ i k + ω ˜ N i k ) + 2 ω ˜ i k ( ω ˜ i k + ω ˜ N 2 i k ) , N : Even = ω ˜ i k δ + 3 λ 4 2 N 2 ω ˜ i k ( ω ˜ i k + ω ˜ N i k ) , N : Odd
These additional terms f, g, f , and g cannot be calculated analytically. Therefore, we resort to numerical methods to calculate these.
The work carried out in [18] had a proper analytical expression for the eigenvalues, which made it easier to study the RG flows. However, when we consider higher-order interactions such as ϕ 6 and ϕ 8 , such analytic expressions for the RG flows and complexity cannot be found. This makes it difficult for us to study the RG flows and MERA and is beyond the scope of our model. Instead, we will focus only on complexity. The eigenvalues we obtained were small corrections to the one obtained in [18], so the connection they made will not be affected by the addition of higher interacting terms. Now, we will resort to numerical methods in the next section.

Numerical Analysis of the Complexity Functional

We will calculate the complexity for the unambiguous block first for an increasing number of oscillators. We have found the wavefunction for the Hamiltonian in Equation (47). As we reinserted the M term, we will just update the complexity using the rescaled parameters mentioned in the previous subsection. We set the following relevant parameter values:
λ 4 = 0.5 λ 6 = 0.2 λ 8 = 0.001 ω 0 = m = 4.0 Ω = 0.25 L = 200 ω ˜ r e f = 1.6
where L is the length of the periodic chain. We chose N and δ so that N δ = L was always satisfied. We will use the C 1 ( 1 ) functional for the unambiguous block.
Case I: Increasing the Interactions
In Figure 2, we have plotted numerically the behavior of the complexity of the unambiguous block as a function of N, which is the number of oscillators in d = 2 dimensions. In Figure 2a, we have two complexities, where the points in blue represent the complexity of the theory, which has no interaction term, and this complexity is due to the self-interaction between pairs of oscillators. We also see the points in orange and light orange, which represent the complexity of the theory with λ 4 ϕ 4 interaction. We notice that there is a bump initially in the graph for small N values, but in Figure 2a–c, we can observe that the values of the complexity with the free theory and the complexity with interactions became the same as we increased the value of N. We see that C 1 ( 1 ) grew linearly with increasing N values, and the contributions to C 1 ( 1 ) due to even interaction terms became negligible, while the behavior of the complexity for the unambiguous block would be same as if we were dealing only with the free theory. In Figure 2d, we have plotted C 1 ( 1 ) for N being an odd number of oscillators for even interactions of λ 4 ϕ 4 + λ 6 ϕ 6 + λ 8 ϕ 8 , and we see that the initial values of the complexity increased as we included higher-order terms in the theory, but when we increased N, the contribution from these perturbative terms died out, and the graph followed a ϕ 2 linear pattern of C 1 ( 1 ) .
Case II: Increasing the Dimension
In Figure 3, we show six different plots. In the first two plots, the complexity for the unambiguous block (up to ϕ 4 interaction) is plotted with respect to the number of oscillators in dimensions d = 3 and 4. Here, we notice that as we increased the dimensions, the contribution to C 1 ( 1 ) due to the interaction term increased, and we saw a similar pattern as we included other higher-order even terms (i.e, the third and fourth graphs have ( λ 4 ϕ 4 + λ 6 ϕ 6 ) interactions, and the fifth and sixth graphs contain ( λ 4 ϕ 4 + λ 6 ϕ 6 + λ 8 ϕ 8 ) interactions). However, in higher dimensions, the contributions of these interactions to the complexity C 1 ( 1 ) also became negligible when we increased the value of N, and the behavior of this complexity became similar to the case where we had only the ϕ 2 term and it grew linearly.
Case III: C 1 ( 1 ) vs. ω 0
In Figure 4, we have plotted the variation in the complexity C 1 ( 1 ) versus ω 0 for a particular value of oscillators N = 15 , and we also show the variation in the same plot for different dimensions ( d = 2 ,   3 ,   4 ) . As we increased the number of dimensions, the complexity of the unambiguous block C 1 ( 1 ) increased, and in a particular dimension, the complexity value increased as we increased the number of interactions, which was noticeable for low values of ω 0 . However, as we increased the value of ω 0 , the behavior became similar to the free scalar theory.
Case IV: Fractional Change in C 1 ( 1 )
We define the fractional change in complexity C 1 for a particular N value as
C 1 ( N + 2 ) C 1 ( N ) C 1 ( N )
Here, we have an increment of two in the definition because odd and even branches of N can possibly show different behavior, as was the case for the complexity.
For small values of N, the even and odd complexities were different from each other. This is directly related to the fact that one can distinguish the system with an even or odd number of oscillators, but as we went for a large number of oscillators or in the continuum limit, the distinction between the even and odd numbers of oscillators faded away. In Figure 5, we have plotted the complexity of the unambiguous block, and we find that, initially, the fractional change in complexity was large for small N values, but it decreased continuously as we moved toward a large number of oscillators.

7. Conclusions and Future Prospects

This work studied the circuit complexity for weakly interacting scalar field theory with ϕ 4 , ϕ 6 , and ϕ 8 Wilsonian operators coupled via λ 4 , λ 6 , and λ 8 to a free scalar field theory, respectively. The values of the coupling constants were chosen in the framework of an EEFT such that the perturbation analysis was valid. The reference state was an unentangled, nearly Gaussian state, and the target state was an entangled, nearly Gaussian state which was calculated using a first-order perturbation theory. First, we worked with the case of two oscillators, where the unitary evolution U , which took us from the reference state to the target state, was parameterized using the AdS parameters. With this, we calculated the line element and found the complexity functional by imposing the appropriate boundary conditions. Then, we proceeded to the N oscillator case. Here, the circuit complexity depended on the ratio of the eigenvalues of the target to the reference states of the N oscillators. Since we could not observe any analytical expression of the eigenvalues of the target state of the N oscillators, we resorted to numerical analysis. The target matrix for N oscillators had a part where the bases could be uniquely determined (unambiguous part) and another part where the bases could not be determined (ambiguous part). The contribution to the total complexity came from the ambiguous as well as the unambiguous parts. In our work, we focused mainly on the computation of the complexity for the unambiguous part, denoted by the A 2 matrix. The following are the results that we observed:
  • From our numerical analysis, the QCC with κ = 1 for the free field theory increased linearly with the number of oscillators. As we included the higher even Wilsonian terms, the growth of the complexity (contribution from the unambiguous part) was no longer linear for a small number of oscillators. For the large N limit, the contribution to the complexity from the interacting part vanished, and the linearity was restored.
  • From the graph of complexity vs. ω 0 , we see that upon fixing the dimensions and the number of oscillators, the complexity from the unambiguous part increased with an increasing value for ω 0 .
  • Another pattern inferred from our analysis is that as the dimension increases, the contribution to C 1 ( 1 ) due to the interaction term increases for a fixed number of oscillators. We observed this pattern using degenerate frequencies for higher dimensions. One would expect a similar pattern, even if the frequencies were non-degenerate.
In [18], the eigenvalues had a proper analytical expression, which makes it easier to study RG flows. On the other hand, after adding higher-order corrections, there is no analytical expression of the eigenvalues. This makes it very challenging to study the RG and MERA connection. The eigenvalues we obtained were small corrections to the one obtained in [18], so the connection they made would not be affected by the addition of higher interacting terms. In upcoming works, we will address this issue.
In our analysis, we used κ = 1 in our complexity functional C κ , but there are other different and useful kinds of measures that one can explore to gain new insights into circuit complexity.
Our approach to computing complexity is based on Nielsen’s geometric approach, which suffers from ambiguity in choosing the elementary quantum gates and states. Recent works have attempted to develop a new notion of complexity that is independent of these choices. As for our future goals, we have in mind the following:
  • We can calculate the circuit complexity for odd Wilsonian terms in the effective theory, such as ϕ 3 , ϕ 4 , and ϕ 7 . We can further generalize the study by adding both even and odd interaction terms together.
  • We can study the behavior of circuit complexity in a similar theory when there is a quantum quench in the interaction and mass. We have already performed this for a ϕ 4 interacting theory [119].
  • We can further analyze circuit complexity in fermionic field theories and gauge theories.
  • We can explore this problem in the context of the Krylov complexity [95,103,120], which is currently a melting pot in this research area.
  • We can compare the Krylov complexity and circuit complexity for such theories to know which is a better measure of information for such cases.

Author Contributions

Conceptualization, S.C.; Methodology, S.C., S.M., N.P., A.R., S.S. and S.S.S.; Software, K.A., S.K., S.M., N.P., A.R., S.S., P.S. and S.S.S.; Validation, S.C.; Formal analysis, K.A., S.C., S.K., S.M., N.P., A.R., S.S., P.S. and S.S.S.; Investigation, S.C.; Writing—original draft, K.A., S.C., S.K., S.M., N.P. and A.R.; Writing—review & editing, S.C.; Supervision, S.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

S.C. would like to thank the work friendly environment and all the members of CCSP, SGT University. The research fellowship of S.C. was supported by the J. C. Bose National Fellowship of Sudhakar Panda. S.C. also would like to thank the School of Physical Sciences at the National Institute for Science Education and Research (NISER) in Bhubaneswar for providing a work-friendly environment. S.C. also thanks all the members of our newly formed virtual international non-profit consortium “Quantum Structures of the Space-Time & Matter” (QASTM) for their elaborative discussions. S.C. would also like to thank all the speakers of the QASTM zoominar series from different parts of the world (For the uploaded YouTube link, see https://www.youtube.com/playlist?list=PLzW8AJcryManrTsG-4U4z9ip1J1dWoNgd) for supporting the research forum by giving outstanding lectures and their valuable time during the COVID pandemic time. Kiran Adhikari would like to thank TTK, RWTH, JARA, and the Institute of Quantum Information for the fellowships. Saptarshi Mandal, Nilesh Pandey, Abhishek Roy, Soumya Sarker, Partha Sarker, and Sadaat Salman Shariff would like to express their heartiest thanks to Jadavpur University, the University of Dhaka, NIT Karnataka, IIT Jodhpur, the University of Madras, and Delhi Technological University, respectively, for imparting knowledge and their enthusiasm for this research. Abhishek Roy would like to thank Sujit Damase for the discussions related to group generators. Partha Sarker would like to thank Syed Hasibul Hasan Chowdhury for the relevant discussions. K.A. would also like to thank David Di Vincenzo for his help in understanding quantum information theoretic concepts such as entanglement entropy and complexity. Finally, we would like to acknowledge our debt to the people belonging to various parts of the world for their generous and steady support for research in the natural sciences.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Interacting Part of the Hamiltonian in a Fourier Basis

The interacting part in the N oscillator Hamiltonian is
H = a = 0 N 1 λ 4 x a 4 + λ 6 x a 6 + λ 8 x a 8 = H ϕ 4 + H ϕ 6 + H ϕ 8
Now, we apply the discrete Fourier transform as in Equation (48) to find the ϕ 4 interaction:
H ϕ 4 = a = 0 N 1 λ 4 N 2 k , k 1 , k 2 , k 3 = 0 N 1 exp i 2 π a N ( k + k 1 + k 2 + k 3 ) x ˜ k x ˜ k 1 x ˜ k 2 x ˜ k 3
We apply the sum over index a and use the relation
a = 0 N 1 exp i 2 π a ( k k ) N = N δ k , k
to obtain
H ϕ 4 = λ 4 N k , k 1 , k 2 , k 3 = 0 N 1 δ k + k 1 + k 2 + k 3 , 0 x ˜ k x ˜ k 1 x ˜ k 2 x ˜ k 3
Now, the Kronecker delta will reduce one of the indices, such as k to k 1 k 2 k 3 . Now, k only runs from [ 0 , N 1 ] , whereas k 1 k 2 k 3 has possible values in the range [ 3 N , 0 ] . To obtain a valid index value for k , we use the relation x ˜ k + N = x ˜ k and write k = N k 1 k 2 k 3 m o d N . This will return a valid index value for k . Then, we have
H ϕ 4 = λ 4 N k 1 , k 2 , k 3 = 0 N 1 x ˜ α x ˜ k 1 x ˜ k 2 x ˜ k 3
Using similar arguments, we can find H ϕ 6 and H ϕ 8 .

Appendix B. C 2 in Terms of the Ratio of the Target and Reference Matrix Eigenvalues

We claimed in Equation (46) that C 2 can be expressed in terms of the ratio of eigenvalues of the target and reference matrix (i.e., A ( s = 1 ) and A ( s = 0 ) , respectively). This was due to the nature of the unitary operator U and the diagonal block structure of A ( s = 1 ) and A ( s = 0 ) .
To prove this, let us look at the complexity functional in Equation (44). The parameters in the 2 × 2 blocks on the U matrix have AdS parametrization, and they appear in 2 [ d y i ( 1 ) 2 + d ρ i ( 1 ) 2 ] in C 2 , where i = 1 , 3 , 5 , 7 , 9 . We can find these values for y i ( 1 ) and ρ i ( 1 ) from the boundary conditions we obtained in Equation (42). These values can be represented by the eigenvalues of A ( s = 0 ) and A ( s = 1 ) in the following way:
y i = 1 4 log λ 1 λ 2 Ω 1 Ω 2 ρ i = 1 2 cos h 1 λ 1 + λ 2 2 λ 1 λ 2
Here, λ 1 and λ 2 are the eigenvalues of the 2 × 2 block in the A ( s = 1 ) matrix corresponding to the block in U, whereas Ω 1 and Ω 2 are diagonal elements of the similar block 2 × 2 in A ( s = 0 ) . We can use the relation
cos h 1 ( x ) = ln ( x + x 2 1 )
to find the following for ρ i :
ρ i = 1 4 ln λ 2 λ 1
Then, our desired part in C 2 will be
2 ( y i ( 1 ) 2 + ρ i ( 1 ) ) 2 = 2 ln λ 1 Ω 1 2 + ln λ 2 Ω 2 2
Now, i = 2 ,   4 ,   6 ,   8 , and we have a different scenario. These are the lone diagonal parameters in the U matrix and have boundary conditions such as
y i = 1 2 ln λ T Ω R
Here, λ T and Ω R denote the particular diagonal elements in A(s = 0) and A(s = 1), respectively, corresponding to the parameter yi here. With these parameter values in hand, we can find from the complexity functional in Equation (44) the expression for Equation (46).

References

  1. Harlow, D. TASI Lectures on the Emergence of Bulk Physics in AdS/CFT. arXiv 2018, arXiv:1802.01040. [Google Scholar]
  2. Ryu, S.; Takayanagi, T. Holographic derivation of entanglement entropy from AdS/CFT. Phys. Rev. Lett. 2006, 96, 181602. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Hubeny, V.E.; Rangamani, M.; Takayanagi, T. A Covariant holographic entanglement entropy proposal. JHEP 2007, 7, 062. [Google Scholar] [CrossRef]
  4. Rangamani, M.; Takayanagi, T. Holographic Entanglement Entropy; Springer: Berlin/Heidelberg, Germany, 2017; Volume 931. [Google Scholar] [CrossRef] [Green Version]
  5. Susskind, L. Computational Complexity and Black Hole Horizons. Fortsch. Phys. 2016, 64, 24–43, Addendum: Fortsch. Phys. 2016, 64, 44–48. [Google Scholar] [CrossRef] [Green Version]
  6. Stanford, D.; Susskind, L. Complexity and Shock Wave Geometries. Phys. Rev. D 2014, 90, 126007. [Google Scholar] [CrossRef] [Green Version]
  7. Susskind, L.; Zhao, Y. Switchbacks and the Bridge to Nowhere. arXiv 2014, arXiv:1408.2823. [Google Scholar]
  8. Susskind, L. Entanglement is not enough. Fortsch. Phys. 2016, 64, 49–71. [Google Scholar] [CrossRef] [Green Version]
  9. Brown, A.R.; Roberts, D.A.; Susskind, L.; Swingle, B.; Zhao, Y. Complexity, action, and black holes. Phys. Rev. D 2016, 93, 086006. [Google Scholar] [CrossRef] [Green Version]
  10. Brown, A.R.; Roberts, D.A.; Susskind, L.; Swingle, B.; Zhao, Y. Holographic Complexity Equals Bulk Action? Phys. Rev. Lett. 2016, 116, 191301. [Google Scholar] [CrossRef] [Green Version]
  11. Brown, A.R.; Susskind, L.; Zhao, Y. Quantum Complexity and Negative Curvature. Phys. Rev. D 2017, 95, 045010. [Google Scholar] [CrossRef] [Green Version]
  12. Couch, J.; Fischler, W.; Nguyen, P.H. Noether charge, black hole volume, and complexity. JHEP 2017, 3, 119. [Google Scholar] [CrossRef]
  13. Susskind, L. Three Lectures on Complexity and Black Holes; Springer: Berlin/Heidelberg, Germany, 2020. [Google Scholar]
  14. Jefferson, R.; Myers, R.C. Circuit complexity in quantum field theory. JHEP 2017, 10, 107. [Google Scholar] [CrossRef] [Green Version]
  15. Chapman, S.; Heller, M.P.; Marrochio, H.; Pastawski, F. Toward a Definition of Complexity for Quantum Field Theory States. Phys. Rev. Lett. 2018, 120, 121602. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  16. Khan, R.; Krishnan, C.; Sharma, S. Circuit Complexity in Fermionic Field Theory. Phys. Rev. D 2018, 98, 126001. [Google Scholar] [CrossRef] [Green Version]
  17. Hackl, L.; Myers, R.C. Circuit complexity for free fermions. JHEP 2018, 7, 139. [Google Scholar] [CrossRef] [Green Version]
  18. Bhattacharyya, A.; Shekar, A.; Sinha, A. Circuit complexity in interacting QFTs and RG flows. JHEP 2018, 10, 140. [Google Scholar] [CrossRef] [Green Version]
  19. Haferkamp, J.; Faist, P.; Kothakonda, N.B.T.; Eisert, J.; Halpern, N.Y. Linear growth of quantum circuit complexity. Nat. Phys. 2022, 18, 528–532. [Google Scholar] [CrossRef]
  20. Bhattacharyya, A.; Chemissany, W.; Haque, S.S.; Murugan, J.; Yan, B. The Multi-faceted Inverted Harmonic Oscillator: Chaos and Complexity. SciPost Phys. Core 2021, 4, 002. [Google Scholar] [CrossRef]
  21. Ali, T.; Bhattacharyya, A.; Haque, S.S.; Kim, E.H.; Moynihan, N.; Murugan, J. Chaos and Complexity in Quantum Mechanics. Phys. Rev. D 2020, 101, 026021. [Google Scholar] [CrossRef] [Green Version]
  22. Eisert, J. Entangling Power and Quantum Circuit Complexity. Phys. Rev. Lett. 2021, 127, 020501. [Google Scholar] [CrossRef]
  23. Roberts, D.A.; Yoshida, B. Chaos and complexity by design. JHEP 2017, 4, 121. [Google Scholar] [CrossRef]
  24. Camilo, G.; Melnikov, D.; Novaes, F.; Prudenziati, A. Circuit Complexity of Knot States in Chern-Simons theory. JHEP 2019, 7, 163. [Google Scholar] [CrossRef] [Green Version]
  25. Couch, J.; Fan, Y.; Shashi, S. Circuit Complexity in Topological Quantum Field Theory. Fortsch. Phys. 2022, 70, 9–10. [Google Scholar] [CrossRef]
  26. Chagnet, N.; Chapman, S.; de Boer, J.; Zukowski, C. Complexity for Conformal Field Theories in General Dimensions. Phys. Rev. Lett. 2022, 128, 051601. [Google Scholar] [CrossRef]
  27. Flory, M.; Heller, M.P. Conformal field theory complexity from Euler-Arnold equations. JHEP 2020, 12, 091. [Google Scholar] [CrossRef]
  28. Jaiswal, N.; Gautam, M.; Sarkar, T. Complexity and information geometry in the transverse XY model. Phys. Rev. E 2021, 104, 024127. [Google Scholar] [CrossRef]
  29. Barbon, J.L.F.; Rabinovici, E. Holographic complexity and spacetime singularities. JHEP 2016, 1, 084. [Google Scholar] [CrossRef]
  30. Alishahiha, M. Holographic Complexity. Phys. Rev. D 2015, 92, 126009. [Google Scholar] [CrossRef] [Green Version]
  31. Yang, R.Q. Strong energy condition and complexity growth bound in holography. Phys. Rev. D 2017, 95, 086017. [Google Scholar] [CrossRef] [Green Version]
  32. Chapman, S.; Marrochio, H.; Myers, R.C. Complexity of Formation in Holography. JHEP 2017, 1, 062. [Google Scholar] [CrossRef] [Green Version]
  33. Carmi, D.; Myers, R.C.; Rath, P. Comments on Holographic Complexity. JHEP 2017, 3, 118. [Google Scholar] [CrossRef]
  34. Reynolds, A.; Ross, S.F. Divergences in Holographic Complexity. Class. Quant. Grav. 2017, 34, 105004. [Google Scholar] [CrossRef] [Green Version]
  35. Zhao, Y. Complexity and Boost Symmetry. Phys. Rev. D 2018, 98, 086011. [Google Scholar] [CrossRef] [Green Version]
  36. Flory, M. A complexity/fidelity susceptibility g-theorem for AdS3/BCFT2. JHEP 2017, 6, 131. [Google Scholar] [CrossRef] [Green Version]
  37. Reynolds, A.; Ross, S.F. Complexity in de Sitter Space. Class. Quant. Grav. 2017, 34, 175013. [Google Scholar] [CrossRef] [Green Version]
  38. Carmi, D.; Chapman, S.; Marrochio, H.; Myers, R.C.; Sugishita, S. On the Time Dependence of Holographic Complexity. JHEP 2017, 11, 188. [Google Scholar] [CrossRef] [Green Version]
  39. Couch, J.; Eccles, S.; Fischler, W.; Xiao, M.L. Holographic complexity and noncommutative gauge theory. JHEP 2018, 3, 108. [Google Scholar] [CrossRef] [Green Version]
  40. Yang, R.Q.; Niu, C.; Zhang, C.Y.; Kim, K.Y. Comparison of holographic and field theoretic complexities for time dependent thermofield double states. JHEP 2018, 2, 082. [Google Scholar] [CrossRef] [Green Version]
  41. Abt, R.; Erdmenger, J.; Hinrichsen, H.; Melby-Thompson, C.M.; Meyer, R.; Northe, C.; Reyes, I.A. Topological Complexity in AdS3/CFT2. Fortsch. Phys. 2018, 66, 1800034. [Google Scholar] [CrossRef] [Green Version]
  42. Swingle, B.; Wang, Y. Holographic Complexity of Einstein-Maxwell-Dilaton Gravity. JHEP 2018, 09, 106. [Google Scholar] [CrossRef] [Green Version]
  43. Reynolds, A.P.; Ross, S.F. Complexity of the AdS Soliton. Class. Quant. Grav. 2018, 35, 095006. [Google Scholar] [CrossRef]
  44. Fu, Z.; Maloney, A.; Marolf, D.; Maxfield, H.; Wang, Z. Holographic complexity is nonlocal. JHEP 2018, 2, 072. [Google Scholar] [CrossRef] [Green Version]
  45. An, Y.S.; Peng, R.H. Effect of the dilaton on holographic complexity growth. Phys. Rev. D 2018, 97, 066022. [Google Scholar] [CrossRef] [Green Version]
  46. Bolognesi, S.; Rabinovici, E.; Roy, S.R. On Some Universal Features of the Holographic Quantum Complexity of Bulk Singularities. JHEP 2018, 6, 016. [Google Scholar] [CrossRef] [Green Version]
  47. Chen, B.; Li, W.M.; Yang, R.Q.; Zhang, C.Y.; Zhang, S.J. Holographic subregion complexity under a thermal quench. JHEP 2018, 7, 034. [Google Scholar] [CrossRef] [Green Version]
  48. Abt, R.; Erdmenger, J.; Gerbershagen, M.; Melby-Thompson, C.M.; Northe, C. Holographic Subregion Complexity from Kinematic Space. JHEP 2019, 1, 012. [Google Scholar] [CrossRef] [Green Version]
  49. Hashimoto, K.; Iizuka, N.; Sugishita, S. Thoughts on Holographic Complexity and its Basis-dependence. Phys. Rev. D 2018, 98, 046002. [Google Scholar] [CrossRef] [Green Version]
  50. Flory, M.; Miekley, N. Complexity change under conformal transformations in AdS3/CFT2. JHEP 2019, 5, 003. [Google Scholar] [CrossRef] [Green Version]
  51. Couch, J.; Eccles, S.; Jacobson, T.; Nguyen, P. Holographic Complexity and Volume. JHEP 2018, 11, 044. [Google Scholar] [CrossRef] [Green Version]
  52. Hosseini Mansoori, S.A.; Jahnke, V.; Qaemmaqami, M.M.; Olivas, Y.D. Holographic Complexity of Anisotropic Black Branes. Phys. Rev. D 2019, 100, 046014. [Google Scholar] [CrossRef] [Green Version]
  53. Chapman, S.; Marrochio, H.; Myers, R.C. Holographic complexity in Vaidya spacetimes. Part I. JHEP 2018, 6, 046. [Google Scholar] [CrossRef]
  54. Chapman, S.; Marrochio, H.; Myers, R.C. Holographic complexity in Vaidya spacetimes. Part II. JHEP 2018, 6, 114. [Google Scholar] [CrossRef] [Green Version]
  55. Caceres, E.; Chapman, S.; Couch, J.D.; Hernandez, J.P.; Myers, R.C.; Ruan, S.M. Complexity of Mixed States in QFT and Holography. JHEP 2020, 3, 012. [Google Scholar] [CrossRef] [Green Version]
  56. Ben-Ami, O.; Carmi, D. On Volumes of Subregions in Holography and Complexity. JHEP 2016, 11, 129. [Google Scholar] [CrossRef] [Green Version]
  57. Abad, F.J.G.; Kulaxizi, M.; Parnachev, A. On Complexity of Holographic Flavors. JHEP 2018, 1, 127. [Google Scholar] [CrossRef] [Green Version]
  58. Brown, A.R.; Susskind, L. Second law of quantum complexity. Phys. Rev. D 2018, 97, 086015. [Google Scholar] [CrossRef] [Green Version]
  59. Bernamonti, A.; Galli, F.; Hernandez, J.; Myers, R.C.; Ruan, S.M.; Simón, J. First Law of Holographic Complexity. Phys. Rev. Lett. 2019, 123, 081601. [Google Scholar] [CrossRef] [Green Version]
  60. Bernamonti, A.; Galli, F.; Hernandez, J.; Myers, R.C.; Ruan, S.M.; Simón, J. Aspects of The First Law of Complexity. J. Phys. A Math. Theor. 2020, 53, 294002. [Google Scholar] [CrossRef]
  61. Cai, R.G.; Ruan, S.M.; Wang, S.J.; Yang, R.Q.; Peng, R.H. Action growth for AdS black holes. JHEP 2016, 9, 161. [Google Scholar] [CrossRef]
  62. Lehner, L.; Myers, R.C.; Poisson, E.; Sorkin, R.D. Gravitational action with null boundaries. Phys. Rev. D 2016, 94, 084046. [Google Scholar] [CrossRef]
  63. Moosa, M. Evolution of Complexity Following a Global Quench. JHEP 2018, 3, 031. [Google Scholar] [CrossRef]
  64. Moosa, M. Divergences in the rate of complexification. Phys. Rev. D 2018, 97, 106016. [Google Scholar] [CrossRef] [Green Version]
  65. Hashimoto, K.; Iizuka, N.; Sugishita, S. Time evolution of complexity in Abelian gauge theories. Phys. Rev. D 2017, 96, 126001. [Google Scholar] [CrossRef] [Green Version]
  66. Chapman, S.; Eisert, J.; Hackl, L.; Heller, M.P.; Jefferson, R.; Marrochio, H.; Myers, R.C. Complexity and entanglement for thermofield double states. SciPost Phys. 2019, 6, 034. [Google Scholar] [CrossRef] [Green Version]
  67. Guo, M.; Hernandez, J.; Myers, R.C.; Ruan, S.M. Circuit Complexity for Coherent States. JHEP 2018, 10, 011. [Google Scholar] [CrossRef] [Green Version]
  68. Camargo, H.A.; Caputa, P.; Das, D.; Heller, M.P.; Jefferson, R. Complexity as a novel probe of quantum quenches: Universal scalings and purifications. Phys. Rev. Lett. 2019, 122, 081601. [Google Scholar] [CrossRef] [Green Version]
  69. Doroudiani, M.; Naseh, A.; Pirmoradian, R. Complexity for Charged Thermofield Double States. JHEP 2020, 1, 120. [Google Scholar] [CrossRef] [Green Version]
  70. Chapman, S.; Chen, H.Z. Charged Complexity and the Thermofield Double State. JHEP 2021, 2, 187. [Google Scholar] [CrossRef]
  71. Bhattacharyya, A.; Nandy, P.; Sinha, A. Renormalized Circuit Complexity. Phys. Rev. Lett. 2020, 124, 101602. [Google Scholar] [CrossRef] [Green Version]
  72. Bhargava, P.; Choudhury, S.; Chowdhury, S.; Mishara, A.; Selvam, S.P.; Panda, S.; Pasquino, G.D. Quantum aspects of chaos and complexity from bouncing cosmology: A study with two-mode single field squeezed state formalism. SciPost Phys. Core 2021, 4, 026. [Google Scholar] [CrossRef]
  73. Lehners, J.L.; Quintin, J. Quantum Circuit Complexity of Primordial Perturbations. Phys. Rev. D 2021, 103, 063527. [Google Scholar] [CrossRef]
  74. Bhattacharyya, A.; Das, S.; Haque, S.S.; Underwood, B. Rise of cosmological complexity: Saturation of growth and chaos. Phys. Rev. Res. 2020, 2, 033273. [Google Scholar] [CrossRef]
  75. Choudhury, S.; Dutta, A.; Ray, D. Chaos and Complexity from Quantum Neural Network: A study with Diffusion Metric in Machine Learning. JHEP 2021, 4, 138. [Google Scholar] [CrossRef]
  76. Choudhury, S.; Chowdhury, S.; Gupta, N.; Mishara, A.; Selvam, S.P.; Panda, S.; Pasquino, G.D.; Singha, C.; Swain, A. Circuit Complexity From Cosmological Islands. Symmetry 2021, 13, 1301. [Google Scholar] [CrossRef]
  77. Adhikari, K.; Choudhury, S.; Chowdhury, S.; Shirish, K.; Swain, A. Circuit complexity as a novel probe of quantum entanglement: A study with black hole gas in arbitrary dimensions. Phys. Rev. D 2021, 104, 065002. [Google Scholar] [CrossRef]
  78. Adhikari, K.; Choudhury, S.; Pandya, H.N.; Srivastava, R. PGW Circuit Complexity. arXiv 2021, arXiv:2108.10334. [Google Scholar]
  79. Choudhury, S.; Selvam, S.P.; Shirish, K. Circuit Complexity from Supersymmetric Quantum Field Theory with Morse Function. Symmetry 2022, 14, 1656. [Google Scholar] [CrossRef]
  80. Bai, C.; Li, W.H.; Ge, X.H. Towards the non-equilibrium thermodynamics of the complexity and the Jarzynski identity. arXiv 2021, arXiv:2107.08608. [Google Scholar]
  81. Caputa, P.; Kundu, N.; Miyaji, M.; Takayanagi, T.; Watanabe, K. Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT. JHEP 2017, 11, 097. [Google Scholar] [CrossRef] [Green Version]
  82. Caputa, P.; Magan, J.M. Quantum Computation as Gravity. Phys. Rev. Lett. 2019, 122, 231302. [Google Scholar] [CrossRef] [Green Version]
  83. Boruch, J.; Caputa, P.; Takayanagi, T. Path-Integral Optimization from Hartle-Hawking Wave Function. Phys. Rev. D 2021, 103, 046017. [Google Scholar] [CrossRef]
  84. Boruch, J.; Caputa, P.; Ge, D.; Takayanagi, T. Holographic path-integral optimization. JHEP 2021, 7, 016. [Google Scholar] [CrossRef]
  85. Nielsen, M.A. A Geometric Approach to Quantum Circuit Lower Bounds. arXiv 2005, arXiv:quant-ph/0502070. [Google Scholar] [CrossRef]
  86. Nielsen, M.A. Quantum Computation as Geometry. Science 2006, 311, 1133–1135. [Google Scholar] [CrossRef] [Green Version]
  87. Dowling, M.R.; Nielsen, M.A. The Geometry of Quantum Computation. Quantum Inf. Comput. 2008, 8, 861–899. [Google Scholar] [CrossRef]
  88. Nielsen, M.A.; Dowling, M.R.; Gu, M.; Doherty, A.C. Optimal control, geometry, and quantum computing. Phys. Rev. A 2006, 73, 062323. [Google Scholar] [CrossRef] [Green Version]
  89. Watrous, J. Quantum Computational Complexity. In Encyclopedia of Complexity and Systems Science; Meyers, R.A., Ed.; Springer: New York, NY, USA, 2009; pp. 7174–7201. [Google Scholar]
  90. Aaronson, S. The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes. arXiv 2016, arXiv:1607.05256. [Google Scholar]
  91. Orús, R. Tensor networks for complex quantum systems. APS Phys. 2019, 1, 538–550. [Google Scholar] [CrossRef] [Green Version]
  92. Nishioka, T.; Ryu, S.; Takayanagi, T. Holographic Entanglement Entropy: An Overview. J. Phys. A 2009, 42, 504008. [Google Scholar] [CrossRef] [Green Version]
  93. Almheiri, A.; Dong, X.; Harlow, D. Bulk Locality and Quantum Error Correction in AdS/CFT. JHEP 2015, 4, 163. [Google Scholar] [CrossRef] [Green Version]
  94. Swingle, B. Entanglement Renormalization and Holography. Phys. Rev. D 2012, 86, 065007. [Google Scholar] [CrossRef]
  95. Caputa, P.; Magan, J.M.; Patramanis, D. Geometry of Krylov complexity. Phys. Rev. Res. 2022, 4, 013041. [Google Scholar] [CrossRef]
  96. Parker, D.E.; Cao, X.; Avdoshkin, A.; Scaffidi, T.; Altman, E. A Universal Operator Growth Hypothesis. Phys. Rev. X 2019, 9, 041017. [Google Scholar] [CrossRef] [Green Version]
  97. Roberts, D.A.; Stanford, D.; Streicher, A. Operator growth in the SYK model. JHEP 2018, 6, 122. [Google Scholar] [CrossRef]
  98. Rabinovici, E.; Sánchez-Garrido, A.; Shir, R.; Sonner, J. Operator complexity: A journey to the edge of Krylov space. JHEP 2021, 6, 062. [Google Scholar] [CrossRef]
  99. Barbón, J.L.F.; Rabinovici, E.; Shir, R.; Sinha, R. On The Evolution of Operator Complexity Beyond Scrambling. JHEP 2019, 10, 264. [Google Scholar] [CrossRef] [Green Version]
  100. Jian, S.K.; Swingle, B.; Xian, Z.Y. Complexity growth of operators in the SYK model and in JT gravity. JHEP 2021, 3, 014. [Google Scholar] [CrossRef]
  101. Dymarsky, A.; Gorsky, A. Quantum chaos as delocalization in Krylov space. Phys. Rev. B 2020, 102, 085137. [Google Scholar] [CrossRef]
  102. Dymarsky, A.; Smolkin, M. Krylov complexity in conformal field theory. Phys. Rev. D 2021, 104, L081702. [Google Scholar] [CrossRef]
  103. Balasubramanian, V.; Caputa, P.; Magan, J.; Wu, Q. A new measure of quantum state complexity. arXiv 2022, arXiv:2202.06957. [Google Scholar]
  104. Shankar, R. Effective Field Theory in Condensed Matter Physics; Cambridge University Press: Cambridge, MA, USA, 1998. [Google Scholar]
  105. Cheung, C.; Creminelli, P.; Fitzpatrick, A.L.; Kaplan, J.; Senatore, L. The Effective Field Theory of Inflation. JHEP 2008, 3, 014. [Google Scholar] [CrossRef] [Green Version]
  106. Weinberg, S. Effective Field Theory for Inflation. Phys. Rev. D 2008, 77, 123541. [Google Scholar] [CrossRef] [Green Version]
  107. Agarwal, N.; Holman, R.; Tolley, A.J.; Lin, J. Effective field theory and non-Gaussianity from general inflationary states. JHEP 2013, 5, 085. [Google Scholar] [CrossRef] [Green Version]
  108. Burgess, C.P. Intro to Effective Field Theories and Inflation. arXiv 2017, arXiv:1711.10592. [Google Scholar]
  109. Choudhury, S. Field Theoretic Approaches to Early Universe. Ph.D. Thesis, Indian Statistical Institute, Calcutta, India, 2016. [Google Scholar]
  110. Choudhury, S. Can Effective Field Theory of inflation generate large tensor-to-scalar ratio within Randall–Sundrum single braneworld? Nucl. Phys. B 2015, 894, 29–55. [Google Scholar] [CrossRef] [Green Version]
  111. Naskar, A.; Choudhury, S.; Banerjee, A.; Pal, S. EFT of Inflation: Reflections on CMB and Forecasts on LSS Surveys. arXiv 2017, arXiv:1706.08051. [Google Scholar]
  112. Pich, A. Effective field theory: Course. Les Houches Summer School in Theoretical Physics, Session 68: Probing the Standard Model of Particle Interactions. arXiv 1998, arXiv:hep-ph/9806303. [Google Scholar]
  113. Burgess, C.P. Introduction to Effective Field Theory. Ann. Rev. Nucl. Part. Sci. 2007, 57, 329–362. [Google Scholar] [CrossRef]
  114. Donoghue, J.F. Introduction to the effective field theory description of gravity. arXiv 1995, arXiv:gr-qc/9512024. [Google Scholar]
  115. Donoghue, J.F. The effective field theory treatment of quantum gravity. AIP Conf. Proc. 2012, 1483, 73–94. [Google Scholar] [CrossRef] [Green Version]
  116. Dubovsky, S.; Hui, L.; Nicolis, A.; Son, D.T. Effective field theory for hydrodynamics: Thermodynamics, and the derivative expansion. Phys. Rev. D 2012, 85, 085029. [Google Scholar] [CrossRef] [Green Version]
  117. Crossley, M.; Glorioso, P.; Liu, H. Effective field theory of dissipative fluids. JHEP 2017, 9, 095. [Google Scholar] [CrossRef] [Green Version]
  118. Choudury, S. Cosmic Microwave Background from Effective Field Theory. Universe 2019, 5, 155. [Google Scholar] [CrossRef]
  119. Choudhury, S.; Gharat, R.M.; Mandal, S.; Pandey, N. Circuit Complexity in an interacting quenched Quantum Field Theory. arXiv 2022, arXiv:2209.03372. [Google Scholar]
  120. Adhikari, K.; Choudhury, S.; Roy, A. Krylov Complexity in Quantum Field Theory. arXiv 2022, arXiv:2204.02250. [Google Scholar]
Figure 1. The left figure represents a unitary transformation from a reference state to a target state using quantum gates (square blocks), and the right figure represents geometrizing the problem of calculating the minimum number of gates representing the transformation.
Figure 1. The left figure represents a unitary transformation from a reference state to a target state using quantum gates (square blocks), and the right figure represents geometrizing the problem of calculating the minimum number of gates representing the transformation.
Symmetry 15 00031 g001
Figure 2. Plot: (ac) represents the complexity C 1 ( 1 ) (from the unambiguous block) vs. the number of oscillators (N) for d = 2 dimensions with different interactions. In plot (d), complexity C 1 ( 1 ) vs. an odd number of oscillators (even resembling the same pattern) from all the interactions are placed together in the same plot, showing the contribution from each interaction.
Figure 2. Plot: (ac) represents the complexity C 1 ( 1 ) (from the unambiguous block) vs. the number of oscillators (N) for d = 2 dimensions with different interactions. In plot (d), complexity C 1 ( 1 ) vs. an odd number of oscillators (even resembling the same pattern) from all the interactions are placed together in the same plot, showing the contribution from each interaction.
Symmetry 15 00031 g002
Figure 3. Plot of complexity C 1 ( 1 ) vs. number of oscillators in d = 3 and d = 4 , respectively, is shown in (af) for ( λ 2 ϕ 2 + λ 4 ϕ 4 + λ 6 ϕ 6 + λ 8 ϕ 8 ).
Figure 3. Plot of complexity C 1 ( 1 ) vs. number of oscillators in d = 3 and d = 4 , respectively, is shown in (af) for ( λ 2 ϕ 2 + λ 4 ϕ 4 + λ 6 ϕ 6 + λ 8 ϕ 8 ).
Symmetry 15 00031 g003
Figure 4. Plot of complexity C 1 ( 1 ) vs. ω 0 (a) for d = 2 , (b) for d = 3 , and (c) for d = 4 .
Figure 4. Plot of complexity C 1 ( 1 ) vs. ω 0 (a) for d = 2 , (b) for d = 3 , and (c) for d = 4 .
Symmetry 15 00031 g004
Figure 5. The Plot of fractional change in complexity vs. number of oscillators.
Figure 5. The Plot of fractional change in complexity vs. number of oscillators.
Symmetry 15 00031 g005
Table 1. Expression for coefficients α 0 , α 1 , α 2 α 14 , present in the wavefunction.
Table 1. Expression for coefficients α 0 , α 1 , α 2 α 14 , present in the wavefunction.
α i
Coefficient of α i
α 0
2 [ 9 λ 4 32 ω ˜ 0 3 + 9 λ 4 32 ω ˜ 1 3 + 3 λ 4 8 ω ˜ 0 ω ˜ 1 2 + 3 λ 4 8 ω ˜ 0 2 ω ˜ 1 + 3 λ 4 4 ω ˜ 0 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 + 55 λ 6 128 ω ˜ 0 4 + 55 λ 6 128 ω ˜ 1 4 + 135 λ 6 128 ω ˜ 0 ω ˜ 1 3 + 45 λ 6 32 ω ˜ 0 2 ω ˜ 1 2 45 λ 6 32 ω ˜ 0 2 ω ˜ 0 4 ω ˜ 1 ω ˜ 1 2 + 45 λ 6 16 ω ˜ 0 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 2 + 135 λ 6 128 ω ˜ 0 3 ω ˜ 1 45 λ 6 32 ω ˜ 0 2 4 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 + 45 λ 6 16 ω ˜ 0 2 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 + 875 λ 8 1024 ω ˜ 0 5 + 875 λ 8 1024 ω ˜ 1 5 + 385 λ 8 128 ω ˜ 0 ω ˜ 1 4 + 105 λ 8 256 ω ˜ 0 2 ω ˜ 1 3 + 2625 λ 8 256 ω ˜ 0 3 ω ˜ 1 2 + 385 λ 8 128 ω ˜ 0 4 ω ˜ 1 315 λ 8 64 ω ˜ 0 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1 2835 λ 8 256 ω ˜ 0 2 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 315 λ 8 64 ω ˜ 0 3 ω ˜ 1 ω ˜ 0 + ω ˜ 1 + 315 λ 8 64 ω ˜ 0 2 ω ˜ 1 2 2 ω ˜ 0 + ω ˜ 1 + 315 λ 8 64 ω ˜ 0 3 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 105 λ 8 64 ω ˜ 0 3 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1 + 315 λ 8 64 ω ˜ 0 ω ˜ 1 3 ω ˜ 0 + 2 ω ˜ 1 + 315 λ 8 64 ω ˜ 0 2 ω ˜ 1 2 ω ˜ 0 + 2 ω ˜ 1 105 λ 8 64 ω ˜ 0 ω ˜ 1 3 ω ˜ 0 + 3 ω ˜ 1 ]
α 1
ω 0 2 [ 3 λ 4 8 ω ˜ 0 2 3 λ 4 4 ω ˜ 0 ω ˜ 1 3 λ 4 2 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 15 λ 6 32 ω ˜ 0 3 45 λ 6 32 ω ˜ 0 ω ˜ 1 2 + 45 λ 6 16 2 ω ˜ 0 4 ω ˜ 1 ω ˜ 1 2 45 λ 6 8 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 2 45 λ 6 32 ω ˜ 0 2 ω ˜ 1 + 45 λ 6 8 ω ˜ 0 4 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 45 λ 6 8 ω ˜ 0 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 105 λ 8 128 ω ˜ 0 4 105 λ 8 32 ω ˜ 0 ω ˜ 1 3 315 λ 8 64 ω ˜ 0 2 ω ˜ 1 2 105 λ 8 32 ω ˜ 0 3 ω ˜ 1 + 315 λ 8 32 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1 + 1575 λ 8 64 ω ˜ 0 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 + 315 λ 8 32 ω ˜ 0 2 ω ˜ 1 ω ˜ 0 + ω ˜ 1 315 λ 8 16 ω ˜ 0 ω ˜ 1 2 2 ω ˜ 0 + ω ˜ 1 315 λ 8 16 ω ˜ 0 2 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 + 315 λ 8 32 ω ˜ 0 2 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1 315 λ 8 32 ω ˜ 1 3 ω ˜ 0 + 2 ω ˜ 1 315 λ 8 32 ω ˜ 0 ω ˜ 1 2 ω ˜ 0 + 2 ω ˜ 1 + 105 λ 8 32 ω ˜ 1 3 ω ˜ 0 + 3 ω ˜ 1 ]
α 2
ω 1 2 [ 3 λ 4 8 ω 1 2 3 λ 4 4 ω 0 ω 1 3 λ 4 2 ω 0 ( 2 ω 0 2 ω 1 ) 15 λ 6 32 ω 1 3 45 λ 6 32 ω 0 2 ω 1 + 45 λ 6 16 ω 0 2 ( 4 ω 0 2 ω 1 ) 45 λ 6 8 ω 0 2 ( 2 ω 0 2 ω 1 ) 45 λ 6 32 ω 0 ω 1 2 + 45 λ 6 8 ω 0 ( 2 ω 0 4 ω 1 ) ω 1 45 λ 6 8 ω 0 ( 2 ω 0 2 ω 1 ) ω 1 105 λ 8 128 ω 1 4 105 λ 8 8 ω 0 3 ω 1 + 315 λ 8 64 ω 0 2 ω 1 2 105 λ 8 32 ω 0 ω 1 3 + 315 λ 8 32 ω 0 3 ( ω 0 + ω 1 ) + 1575 λ 8 64 ω 0 2 ω 1 ( ω 0 + ω 1 ) + 315 λ 8 32 ω 0 ω 1 2 ( ω 0 + ω 1 ) 315 λ 8 32 ω 0 3 ( 2 ω 0 + ω 1 ) 315 λ 8 32 ω 0 2 ω 1 ( 2 ω 0 + ω 1 ) + 105 λ 8 32 ω 0 3 ( 3 ω 0 + ω 1 ) 315 λ 8 16 ω 0 ω 1 2 ( ω 0 + 2 ω 1 ) 315 λ 8 16 ω 0 2 ω 1 ( ω 0 + 2 ω 1 ) + 315 λ 8 32 ω 0 ω 1 2 ( ω 0 + 3 ω 1 ) ]
α 3
2 [ 3 λ 4 2 ω ˜ 0 2 ω ˜ 1 45 λ 6 4 ω ˜ 0 4 ω ˜ 0 2 ω ˜ 1 + 45 λ 6 4 ω ˜ 0 2 ω ˜ 0 2 ω ˜ 1 45 λ 6 4 2 ω ˜ 0 4 ω ˜ 1 ω ˜ 1 + 45 λ 6 4 2 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 315 λ 8 16 ω ˜ 0 2 ω ˜ 0 + ω ˜ 1 315 λ 8 16 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 945 λ 8 16 ω ˜ 0 ω ˜ 1 ω ˜ 0 + ω ˜ 1 + 315 λ 8 8 ω ˜ 0 2 2 ω ˜ 0 + ω ˜ 1 + 315 λ 8 8 ω ˜ 0 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 315 λ 8 16 ω ˜ 0 2 3 ω ˜ 0 + ω ˜ 1 + 315 λ 8 8 ω ˜ 1 2 ω ˜ 0 + 2 ω ˜ 1 + 315 λ 8 8 ω ˜ 0 ω ˜ 1 ω ˜ 0 + 2 ω ˜ 1 315 λ 8 16 ω ˜ 1 2 ω ˜ 0 + 3 ω ˜ 1 ]
α 4
2 [ λ 4 8 ω ˜ 0 5 λ 6 32 ω ˜ 0 2 15 λ 6 32 ω ˜ 0 ω ˜ 1 15 λ 6 8 4 ω ˜ 0 2 ω ˜ 1 ω ˜ 1 35 λ 8 128 ω ˜ 0 3 105 λ 8 64 ω ˜ 0 ω ˜ 1 2 35 λ 8 32 ω ˜ 0 2 ω ˜ 1 105 λ 8 64 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 + 105 λ 8 16 ω ˜ 1 2 2 ω ˜ 0 + ω ˜ 1 + 105 λ 8 16 ω ˜ 0 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 105 λ 8 16 ω ˜ 0 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1 ]
α 5
2 [ λ 4 8 ω ˜ 1 15 λ 6 8 ω ˜ 0 2 ω ˜ 0 4 ω ˜ 1 5 λ 6 32 ω ˜ 1 2 15 λ 6 32 ω ˜ 0 ω ˜ 1 35 λ 8 128 ω ˜ 1 3 35 λ 8 32 ω ˜ 0 ω ˜ 1 2 105 λ 8 64 ω ˜ 0 2 ω ˜ 1 105 λ 8 64 ω ˜ 0 2 ω ˜ 0 + ω ˜ 1 + 105 λ 8 16 ω ˜ 0 2 ω ˜ 0 + 2 ω ˜ 1 + 105 λ 8 16 ω ˜ 0 ω ˜ 1 ω ˜ 0 + 2 ω ˜ 1 105 λ 8 16 ω ˜ 0 ω ˜ 1 ω ˜ 0 + 3 ω ˜ 1 ]
α 6
2 15 λ 6 4 4 ω ˜ 0 2 ω ˜ 1 + 105 λ 8 16 ω ˜ 1 ω ˜ 0 + ω ˜ 1 105 λ 8 8 ω ˜ 0 2 ω ˜ 0 + ω ˜ 1 105 λ 8 8 ω ˜ 1 2 ω ˜ 0 + ω ˜ 1 + 105 λ 8 8 ω ˜ 0 3 ω ˜ 0 + ω ˜ 1
α 7
2 15 λ 6 4 2 ω ˜ 0 4 ω ˜ 1 + 105 λ 8 16 ω ˜ 0 ω ˜ 0 + ω ˜ 1 105 λ 8 8 ω ˜ 0 ω ˜ 0 + 2 ω ˜ 1 105 λ 8 8 ω ˜ 1 ω ˜ 0 + 2 ω ˜ 1 + 105 λ 8 8 ω ˜ 1 ω ˜ 0 + 3 ω ˜ 1
α 8
2 λ 6 24 ω ˜ 0 7 λ 8 96 ω ˜ 0 2 7 λ 8 24 ω ˜ 0 ω ˜ 1 + 7 λ 8 8 ω ˜ 1 3 ω ˜ 0 + ω ˜ 1
α 9
2 λ 6 24 ω ˜ 1 7 λ 8 96 ω ˜ 1 2 7 λ 8 24 ω ˜ 0 ω ˜ 1 + 7 λ 8 8 ω ˜ 0 ω ˜ 0 + 3 ω ˜ 1
α 10
7 λ 8 2 ω ˜ 0 + 3 ω ˜ 1
α 11
7 λ 8 2 3 ω ˜ 0 + ω ˜ 1
α 12
35 λ 8 8 ω ˜ 0 + ω ˜ 1
α 13
λ 8 32 ω ˜ 0
α 14
λ 8 32 ω ˜ 1
Table 2. Expression for the terms C 1 , C 2 C 11 .
Table 2. Expression for the terms C 1 , C 2 C 11 .
Expression for C i Coefficients
C 1
55 32 ω ˜ a 4 15 x ˜ a 2 8 ω ˜ a 3 5 x ˜ a 4 8 ω ˜ a 2 x ˜ a 6 6 ω ˜ a
C 2
180 x ˜ a x ˜ b ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 3 ω ˜ b ) ( ω ˜ a + 5 ω ˜ b ) 60 x ˜ a x ˜ b 3 ( ω ˜ a + 3 ω ˜ b ) ( ω ˜ a + 5 ω ˜ b ) 6 x ˜ a x ˜ b 5 ω ˜ a + 5 ω ˜ b
C 3
120 x ˜ a x ˜ b ( ω ˜ a + ω ˜ b ) ( 3 ω ˜ a + ω ˜ b ) ( ω ˜ a + 3 ω ˜ b ) 10 x ˜ a 3 x ˜ b ( ω ˜ a + ω ˜ b ) ( 3 ω ˜ a + ω ˜ b ) 10 x ˜ a x ˜ b 3 ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 3 ω ˜ b ) 10 x ˜ a 3 x ˜ b 3 3 ( ω ˜ a + ω ˜ b )
C 4
[ 135 32 ω ˜ a ω ˜ b 3 + 45 8 ω ˜ a 2 ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 2 ω ˜ b ) 45 x ˜ a 2 4 ω ˜ a ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 2 ω ˜ b ) 45 ( ω ˜ a + 3 ω ˜ b ) x ˜ b 2 8 ω ˜ b 2 ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 2 ω ˜ b ) 45 x ˜ a 2 x ˜ b 2 2 ( ω ˜ a + ω ˜ b ) ( ω ˜ a + 2 ω ˜ b ) 15 x ˜ b 4 8 ω ˜ a ω ˜ b + 16 ω ˜ b 2 15 x ˜ a 2 x ˜ b 4 2 ω ˜ a + 4 ω ˜ b ]
C 5
180 x ˜ a x ˜ b ( ω ˜ a + ω ˜ b ) ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) ( ω ˜ a + ω ˜ b + 4 ω ˜ c ) 180 x ˜ a x ˜ b x ˜ c 2 ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) ( ω ˜ a + ω ˜ b + 4 ω ˜ c ) 30 x ˜ a x ˜ b x ˜ c 4 ω ˜ a + ω ˜ b + 4 ω ˜ c
C 6
[ 360 ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) x ˜ b x ˜ c ( ω ˜ b + ω ˜ c ) ( 2 ω ˜ a + ω ˜ b + ω ˜ c ) ( ω ˜ b + 3 ω ˜ c ) ( 2 ω ˜ a + ω ˜ b + 3 ω ˜ c ) 180 x ˜ a 2 x ˜ b x ˜ c ( 2 ω ˜ a + ω ˜ b + ω ˜ c ) ( 2 ω ˜ a + ω ˜ b + 3 ω ˜ c ) 60 x ˜ b x ˜ c 3 ( ω ˜ b + 3 ω ˜ c ) ( 2 ω ˜ a + ω ˜ b + 3 ω ˜ c ) 60 x ˜ a 2 x ˜ b x ˜ c 3 2 ω ˜ a + ω ˜ b + 3 ω ˜ c ]
C 7
[ 45 8 ω ˜ a ω ˜ b ω ˜ c 2 + 45 8 ω ˜ a ω ˜ b 2 ω ˜ c + 45 8 ω ˜ a 2 ω ˜ b ω ˜ c 45 8 ω ˜ a ω ˜ b ( ω ˜ a + ω ˜ b ) ω ˜ c 45 8 ω ˜ a ω ˜ b ω ˜ c ( ω ˜ a + ω ˜ c ) 45 8 ω ˜ a ω ˜ b ω ˜ c ( ω ˜ b + ω ˜ c ) + 45 8 ω ˜ a ω ˜ b ω ˜ c ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 ( 2 ω ˜ a + ω ˜ b + ω ˜ c ) x ˜ a 2 4 ω ˜ a ( ω ˜ a + ω ˜ b ) ( ω ˜ a + ω ˜ c ) ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 x ˜ a 2 x ˜ a 2 x ˜ c 2 ω ˜ a + ω ˜ b + ω ˜ c 45 x ˜ a 2 x ˜ b 2 2 ( ω ˜ a + ω ˜ b ) ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) x ˜ c 2 4 ω ˜ c ( ω ˜ a + ω ˜ c ) ( ω ˜ b + ω ˜ c ) ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 x ˜ a 2 x ˜ c 2 2 ( ω ˜ a + ω ˜ c ) ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 x ˜ a 2 x ˜ c 2 2 ( ω ˜ b + ω ˜ c ) ( ω ˜ a + ω ˜ b + ω ˜ c ) 45 ( ω ˜ a + 2 ω ˜ b + ω ˜ c ) x ˜ a 2 4 ω ˜ b ( ω ˜ a + ω ˜ b ) ( ω ˜ b + ω ˜ c ) ( ω ˜ a + ω ˜ b + ω ˜ c ) ]
C 8
360 x ˜ a x ˜ b x ˜ c x ˜ d ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ) ( ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d ) 120 x ˜ a x ˜ b x ˜ c x ˜ d 3 ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d
C 9
[ 360 ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ) x ˜ a x ˜ b ( ω ˜ a + ω ˜ b ) ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) ( ω ˜ a + ω ˜ b + 2 ω ˜ d ) ( ω ˜ a + ω ˜ b + 2 ( ω ˜ c + ω ˜ d ) ) 180 x ˜ a x ˜ b ( ω ˜ a + ω ˜ b + 2 ω ˜ d ) x ˜ x 2 + ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) x ˜ d 2 ( ω ˜ a + ω ˜ b + 2 ω ˜ c ) ( ω ˜ a + ω ˜ b + 2 ω ˜ d ) ( ω ˜ a + ω ˜ b + 2 ( ω ˜ c + ω ˜ d ) ) 180 x ˜ a x ˜ b x ˜ x 2 x ˜ d 2 ω ˜ a + ω ˜ b + 2 ( ω ˜ c + ω ˜ d ) ]
C 10
360 x ˜ a x ˜ b x ˜ c x ˜ d ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ) ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ) 360 x ˜ a x ˜ b x ˜ c x ˜ d x ˜ e 2 ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e )
C 11
720 x ˜ a x ˜ b x ˜ c x ˜ d x ˜ e x ˜ f ( ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f )
Table 3. Expression for the terms D 1 , D 2 , D 3 D 22 .
Table 3. Expression for the terms D 1 , D 2 , D 3 D 22 .
Expression for D i Coefficients
D 1
875 128 ω ˜ a 5 105 x b 2 16 ω ˜ a 4 35 x a 4 16 ω ˜ a 3 7 x a 6 12 ω ˜ a 2 x a 8 8 ω ˜ a
D 2
8 ! 2 ! 6 ! [ 5 36 ω ˜ a 4 + 66 ω ˜ a 3 ω ˜ b + 121 ω ˜ a 2 ω ˜ b 2 + 66 ω ˜ a ω ˜ b 3 + 11 ω ˜ b 4 64 ω ˜ a 4 ω ˜ b 2 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 15 11 ω ˜ a 2 + 6 ω ˜ a ω ˜ b + ω ˜ b 2 x a 2 16 ω ˜ a 3 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 45 x b 2 8 ω ˜ b ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 5 5 ω ˜ a + ω ˜ b x a 4 16 ω ˜ a 2 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 45 x a 2 x b 2 4 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b x b 6 12 ω ˜ a 3 ω ˜ a + ω ˜ b 15 x b 4 x b 2 4 2 ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b x a 6 x b 2 2 3 ω ˜ b + ω ˜ a ]
D 3
8 ! 3 ! 5 ! [ 30 23 ω ˜ a + 13 ω ˜ b x a x b ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 5 ω ˜ a + ω ˜ b ω ˜ a + 3 ω ˜ b 5 ω ˜ a + 3 ω ˜ b 10 x a x b 3 ω ˜ a + ω ˜ b ω ˜ a + 3 ω ˜ b 5 ω ˜ a + 3 ω ˜ b 40 2 ω ˜ a + ω ˜ b x a 3 x b ω ˜ a + ω ˜ b 3 ω ˜ a + ω ˜ b 5 ω ˜ a + ω ˜ b 5 ω ˜ a + 3 ω ˜ b 10 x a 3 x b 3 3 ω ˜ a + ω ˜ b 5 ω ˜ a + 3 ω ˜ b 3 x a 5 x b 5 ω ˜ a + ω ˜ b 5 ω ˜ a + 3 ω ˜ b x a 5 x b 3 5 ω ˜ a + 3 ω ˜ b ]
D 4
8 ! 4 ! 4 ! [ 27 2 ω ˜ a 4 + 7 ω ˜ a 3 ω ˜ b + 7 ω ˜ a 2 ω ˜ b 2 + 7 ω ˜ a ω ˜ b 3 + 2 ω ˜ b 4 64 ω ˜ a 3 ω ˜ b 3 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 9 7 ω ˜ a + 2 ω ˜ b x a 2 16 ω ˜ a 2 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 9 2 ω ˜ a + 7 ω ˜ b x b 2 16 ω ˜ b 2 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 3 x b 4 16 ω ˜ b ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 3 x b 4 16 ω ˜ b ω ˜ b + ω ˜ b ω ˜ a + 2 ω ˜ b 27 x a 2 x b 2 4 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 3 x a 2 x b 4 4 ω ˜ a + ω ˜ b ω ˜ a + 2 ω ˜ b 3 x a 4 x b 2 4 ω ˜ a + ω ˜ b 2 ω ˜ a + ω ˜ b x b 4 x b 4 4 ω ˜ a + ω ˜ b ]
D 5
8 ! 7 ! [ 630 x a x b ω ˜ a + ω ˜ b ω ˜ a + 3 ω ˜ b ω ˜ a + 5 ω ˜ b ω ˜ a + 7 ω ˜ b 210 x a x b 3 ω ˜ a + 3 ω ˜ b ω ˜ a + 5 ω ˜ b ω ˜ a + 7 ω ˜ b 21 x a x b 5 ω ˜ a + 5 ω ˜ b ω ˜ a + 7 ω ˜ b x a x b 7 ω ˜ a + 7 ω ˜ b ]
D 6
8 ! 6 ! [ 90 x a x b ω ˜ a + ω ˜ b ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + ω ˜ b + 6 ω ˜ c 90 x a x b x c 2 ω ˜ c + ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + ω ˜ b + 6 ω ˜ c 15 x a x b x c 4 ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + ω ˜ b + 6 ω ˜ c x a x b x c 6 ω ˜ a + ω ˜ b + 6 ω ˜ c ]
D 7
8 ! 2 ! 5 ! [ 20 x a x c 3 ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + 3 ω ˜ c ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ω ˜ a + 5 ω ˜ c ω ˜ a + 2 ω ˜ b + 5 ω ˜ c x a x b 2 x c ω ˜ a + 2 ω ˜ b + ω ˜ c ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ω ˜ a + 2 ω ˜ b + 5 ω ˜ c x a x c 5 ω ˜ a + 5 ω ˜ c ω ˜ a + 2 ω ˜ b + 5 ω ˜ c 10 x a x b 3 x c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ω ˜ a + 2 ω ˜ b + 5 ω ˜ c x a x b 2 x c 5 ω ˜ a + 2 ω ˜ b + 5 ω ˜ c 30 x a x c 3 ω ˜ a 2 + 6 ω ˜ a ω ˜ b + 4 ω ˜ b 2 + 18 ω ˜ a ω ˜ c + 18 ω ˜ b ω ˜ c + 23 ω ˜ c 2 ω ˜ a + ω ˜ c ω ˜ a + 2 ω ˜ b + ω ˜ c ω ˜ a + 3 ω ˜ c ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ω ˜ a + 5 ω ˜ c ω ˜ a + 2 ω ˜ b + 5 ω ˜ c ]
D 8
8 ! 3 ! 4 ! [ 6 x a x b 3 ω ˜ a + 3 ω ˜ b ω ˜ a + 3 ω ˜ b + 2 ω ˜ c ω ˜ a + 3 ω ˜ b + 4 ω ˜ c 36 x a x b x c 2 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + 3 ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + 3 ω ˜ b + 4 ω ˜ c 3 x a x b x c 4 ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + 3 ω ˜ b + 4 ω ˜ c 6 x a x b 3 x c 2 ω ˜ a + 3 ω ˜ b + 2 ω ˜ c ω ˜ a + 3 ω ˜ b + 4 ω ˜ c x a x b 3 x c 4 ω ˜ a + 3 ω ˜ b + 4 ω ˜ c 18 x a x b 3 ω ˜ a 2 + 13 ω ˜ b 2 + 24 ω ˜ b ω ˜ c + 8 ω ˜ c 2 + 12 ω ˜ a ω ˜ b + ω ˜ c ω ˜ a + ω ˜ b ω ˜ a + 3 ω ˜ b ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + 3 ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 4 ω ˜ c ω ˜ a + 3 ω ˜ b + 4 ω ˜ c ]
D 9
8 ! 2 ! 2 ! 4 ! [ 9 64 ω ˜ a ω ˜ b ω ˜ c 3 + 3 32 ω ˜ a ω ˜ b 2 ω ˜ c 2 + 3 32 ω ˜ a 2 ω ˜ b ω ˜ c 2 3 32 ω ˜ a ω ˜ b ω ˜ a + ω ˜ b ω ˜ c 2 3 16 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ a + ω ˜ c 3 16 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ b + ω ˜ c + 3 16 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ a + ω ˜ b + ω ˜ c + 3 32 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ a + 2 ω ˜ c + 3 32 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ b + 2 ω ˜ c 3 32 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x a 2 16 ω ˜ a ω ˜ b ω ˜ c 2 3 x a 2 3 ω ˜ a 2 + ω ˜ b 2 + 3 ω ˜ b ω ˜ c + 2 ω ˜ c 2 + 3 ω ˜ a ω ˜ b + 2 ω ˜ c 8 ω ˜ a ω ˜ a + ω ˜ b ω ˜ a + ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ a + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x b 2 ω ˜ a 2 + 3 ω ˜ b 2 + 6 ω ˜ b ω ˜ c + 2 ω ˜ c 2 + 3 ω ˜ a ω ˜ b + ω ˜ c 8 ω ˜ b ω ˜ a + ω ˜ b ω ˜ b + ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x c 2 16 ω ˜ a ω ˜ b ω ˜ c 2 + 3 x c 2 8 ω ˜ a ω ˜ b ω ˜ b + ω ˜ c ω ˜ b + 2 ω ˜ c + 3 x c 2 8 ω ˜ a ω ˜ b ω ˜ a + ω ˜ c ω ˜ a + 2 ω ˜ c x c 4 ω ˜ a + ω ˜ b + 4 ω ˜ c 16 ω ˜ c ω ˜ a + 2 ω ˜ c ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x a 2 x b 2 4 ω ˜ a + ω ˜ b ω ˜ a + ω ˜ b + ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c x a 2 x c 2 2 ω ˜ a + ω ˜ b + 3 ω ˜ c 4 ω ˜ a + ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ a + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x b 2 x c 2 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c 4 ω ˜ b + ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c x a 2 x c 4 4 ω ˜ a + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c x b 2 x c 4 4 ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c 3 x a 2 x b 2 x c 2 2 ω ˜ a + ω ˜ b + ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c x a 2 x b 2 x c 4 2 ω ˜ a + ω ˜ b + 2 ω ˜ c ]
D 10
8 ! 2 ! 3 ! 3 ! [ 9 x a x c 4 ω ˜ b ω ˜ c ω ˜ a + 2 ω ˜ b + ω ˜ c 3 ω ˜ a + 2 ω ˜ b + ω ˜ c 6 x a x c ω ˜ b ω ˜ a + ω ˜ c 3 ω ˜ a + ω ˜ c ω ˜ a + 3 ω ˜ c x a 3 x b 2 x c 3 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c + 9 x a x c 4 2 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + 2 ω ˜ b + 3 ω ˜ c + 9 x a x c 8 ω ˜ a ω ˜ b ω ˜ c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c x a 3 x c 2 ω ˜ b ω ˜ a + ω ˜ c 3 ω ˜ c + ω ˜ c + 3 x a 3 x c 2 ω ˜ b 3 ω ˜ a + 2 ω ˜ b + ω ˜ c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c 9 x a x b 2 x c 3 ω ˜ a + 2 ω ˜ b 2 + 10 ω ˜ a ω ˜ c + 4 ω ˜ b ω ˜ c + ω ˜ c 2 4 ω ˜ a ω ˜ c ω ˜ a + 2 ω ˜ b + ω ˜ c 3 ω ˜ a + 2 ω ˜ b + ω ˜ c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c 3 x c 3 x b 2 x c 3 ω ˜ a + 2 ω ˜ b + ω ˜ c 3 ω ˜ c + 2 ω ˜ b + 3 ω ˜ c x a x c 3 2 ω ˜ b ω ˜ a + ω ˜ c ω ˜ a + 3 ω ˜ c + 3 x a x b 2 x c 3 2 ω ˜ a 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c 3 x a x c 3 ω ˜ a + 3 2 ω ˜ a + 2 ω ˜ b + 2 2 ω ˜ b + 3 ω ˜ c + 3 2 ω ˜ c 4 ω ˜ a ω ˜ b ω ˜ a + 2 ω ˜ b + 3 ω ˜ c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c x c 3 x c 3 3 ω ˜ a + ω ˜ c 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ c ]
D 11
8 ! 2 ! 4 ! [ 6 3 ω ˜ a + ω ˜ b 2 6 ω ˜ a + ω ˜ b ω ˜ c 4 ω ˜ c 2 12 ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d 8 ω ˜ d 2 x a x b ω ˜ a + ω ˜ b ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ d ω ˜ a + ω ˜ b + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d 6 x a x b x c 2 ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d x a x b x d 4 ω ˜ a + ω ˜ b + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d 12 ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d x a x b x d 2 ω ˜ a + ω ˜ b + 2 ω ˜ d ω ˜ a + ω ˜ b + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d x a x b x c 2 x d 4 ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d 6 x a x b x c 2 x d 2 ω ˜ a + ω ˜ b + 2 ω ˜ c + 4 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d ]
D 12
8 ! 2 ! 2 ! 2 ! 2 ! [ 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d 2 + 1 32 ω ˜ a ω ˜ b ω ˜ c 2 ω ˜ d + 1 32 ω ˜ a ω ˜ b 2 ω ˜ c ω ˜ d + 1 32 ω ˜ a 2 ω ˜ b ω ˜ c ω ˜ d 1 32 ω ˜ a ω ˜ b ω ˜ a + ω ˜ b ω ˜ c ω ˜ d 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ c ω ˜ d 1 32 ω ˜ d ω ˜ b ω ˜ c ω ˜ b + ω ˜ c ω ˜ d + 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ d 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ b + ω ˜ d + 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ d 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ c + ω ˜ d + 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ c + ω ˜ c + 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ b + ω ˜ c + ω ˜ c 1 32 ω ˜ a ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ d + x a 2 16 ω ˜ b ω ˜ a + ω ˜ b ω ˜ c ω ˜ d + x a 2 16 ω ˜ b ω ˜ c ω ˜ a + ω ˜ c ω ˜ d x a 2 16 ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x a 2 16 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ d x a 2 16 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ d x a 2 16 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ c + ω ˜ d + x a 2 16 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x b 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ d + x b 2 16 ω ˜ a ω ˜ a + ω ˜ b ω ˜ c ω ˜ d + x b 2 16 ω ˜ a ω ˜ c ω ˜ b + ω ˜ c ω ˜ d x b 2 16 ω ˜ a ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x b 2 16 ω ˜ a ω ˜ c ω ˜ d ω ˜ b + ω ˜ d x b 2 16 ω ˜ a ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ d x b 2 16 ω ˜ a ω ˜ c ω ˜ d ω ˜ b + ω ˜ c + ω ˜ d + x b 2 16 ω ˜ a ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x b 2 8 ω ˜ a + ω ˜ b ω ˜ c ω ˜ d + x a 2 x b 2 8 ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x a 2 x b 2 8 ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ d x a 2 x b 2 8 ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x c 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ d + x c 2 16 ω ˜ a ω ˜ b ω ˜ a + ω ˜ c ω ˜ d + x c 2 16 ω ˜ a ω ˜ b ω ˜ b + ω ˜ c ω ˜ d x c 2 16 ω ˜ a ω ˜ b ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x c 2 16 ω ˜ a ω ˜ b ω ˜ d ω ˜ c + ω ˜ d x c 2 16 ω ˜ a ω ˜ b ω ˜ d ω ˜ a + ω ˜ c + ω ˜ d x c 2 16 ω ˜ a ω ˜ b ω ˜ d ω ˜ b + ω ˜ c + ω ˜ d + x c 2 16 ω ˜ a ω ˜ b ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x c 2 8 ω ˜ b ω ˜ a + ω ˜ c ω ˜ d + x a 2 x c 2 8 ω ˜ b ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x a 2 x c 2 8 ω ˜ b ω ˜ d ω ˜ a + ω ˜ c + ω ˜ d x a 2 x c 2 8 ω ˜ b ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x b 2 x c 2 8 ω ˜ a ω ˜ b + ω ˜ c ω ˜ d + x b 2 x c 2 8 ω ˜ a ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x b 2 x c 2 8 ω ˜ a ω ˜ d ω ˜ b + ω ˜ c + ω ˜ d x b 2 x c 2 8 ω ˜ a ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x b 2 x c 2 4 ω ˜ a + ω ˜ b + ω ˜ c ω ˜ d + x a 2 x b 2 x c 2 4 ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ d + x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ d + x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ b + ω ˜ d x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ d + x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ c + ω ˜ d x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ c + ω ˜ d x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ b + ω ˜ c + ω ˜ d + x d 2 16 ω ˜ a ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x d 2 8 ω ˜ b ω ˜ c ω ˜ a + ω ˜ d + x a 2 x d 2 8 ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ d + x a 2 x d 2 8 ω ˜ b ω ˜ c ω ˜ a + ω ˜ c + ω ˜ d x a 2 x d 2 8 ω ˜ b ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x b 2 x d 2 8 ω ˜ a ω ˜ c ω ˜ b + ω ˜ d + x b 2 x d 2 8 ω ˜ a ω ˜ c ω ˜ a + ω ˜ b + ω ˜ d + x b 2 x d 2 8 ω ˜ a ω ˜ c ω ˜ b + ω ˜ c + ω ˜ d x b 2 x d 2 8 ω ˜ a ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x b 2 x d 2 4 ω ˜ c ω ˜ a + ω ˜ b + ω ˜ d + x a 2 x b 2 x d 2 4 ω ˜ c ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x c 2 x d 2 8 ω ˜ a ω ˜ b ω ˜ c + ω ˜ d + x c 2 x d 2 8 ω ˜ a ω ˜ b ω ˜ a + ω ˜ c + ω ˜ d + x c 2 x d 2 8 ω ˜ a ω ˜ b ω ˜ b + ω ˜ c + ω ˜ d x c 2 x d 2 8 ω ˜ a ω ˜ b ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x c 2 x d 2 4 ω ˜ b ω ˜ c + ω ˜ c + ω ˜ d + x a 2 x c 2 x d 2 4 ω ˜ b ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x b 2 x c 2 x d 2 4 ω ˜ a ω ˜ b + ω ˜ c + ω ˜ d + x b 2 x c 2 x d 2 4 ω ˜ a ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d x a 2 x b 2 x c 2 x d 2 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ]
D 13
8 ! 2 ! 2 ! 3 ! [ x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + ω ˜ d + 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ d + 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ c + ω ˜ d 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + ω ˜ d + 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 3 ω ˜ d 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ b + 3 ω ˜ d 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ c + 3 ω ˜ d + 3 x a x d 8 ω ˜ b ω ˜ c ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d 6 ω ˜ a + 2 ω ˜ b + ω ˜ c + 2 ω ˜ d a x b 2 x d ω ˜ a + 2 ω ˜ b + ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + 2 ω ˜ b + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d 6 ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d x a x c 2 x d ω ˜ a + 2 ω ˜ c + ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + 2 ω ˜ c + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d x a x b 2 x c 2 x d 3 ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d 3 x a x b 2 x c 2 x d ω ˜ a + 2 ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d 2 ω ˜ d + ω ˜ b + ω ˜ c + 3 ω ˜ d x a x d 3 ω ˜ d + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + 3 ω ˜ d ω ˜ a + 2 ω ˜ c + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d x a x b 2 x d 3 ω ˜ a + 2 ω ˜ b + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d x a x c 2 x d 3 ω ˜ a + 2 ω ˜ c + 3 ω ˜ d ω ˜ a + 2 ω ˜ b + ω ˜ c + 3 ω ˜ d ]
D 14
8 ! 5 ! [ 30 x a x b x c x d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + 5 ω ˜ d 10 x a x b x c x d 3 ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + 5 ω ˜ d x a x b x c x d 5 ω ˜ a + ω ˜ b + ω ˜ c + 5 ω ˜ d ]
D 15
8 ! 3 ! 3 ! [ 18 ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d x a x b x c x d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d x a x b x c 3 x d 3 ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d 3 x a x b x c 3 x d ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d 3 x a x b x c x d 3 ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ d ω ˜ a + ω ˜ b + 3 ω ˜ c + ω ˜ d ]
D 16
8 ! 2 ! 2 ! 2 ! [ x a x b 8 ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d ω ˜ e + x a x b 8 ω ˜ c ω ˜ d ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ e x a x b 8 ω ˜ c ω ˜ d ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ e x a x b 8 ω ˜ c ω ˜ d ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ d + ω ˜ e + x a x b 8 ω ˜ c ω ˜ d ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d + ω ˜ e x a x b x c 2 x d 2 x e 2 ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d + ω ˜ e 2 x a x b x c 2 ω ˜ a + ω ˜ b + 2 ω ˜ c + ω ˜ d + ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e + x a x b 8 ω ˜ c ω ˜ a + ω ˜ b + 2 ω ˜ c ω ˜ d ω ˜ e 2 x a x b x d 2 ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e + x a x b 8 ω ˜ c ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ d ω ˜ e 2 x a x b x e 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e x a x b 8 ω ˜ a + ω ˜ b ω ˜ c ω ˜ d ω ˜ e x a x b x c 2 x d 2 ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e x a x b x d 2 x e 2 ω ˜ a + ω ˜ b + 2 ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e x a x b x c 2 x e 2 ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ e ω ˜ a + ω ˜ b + 2 ω ˜ c + 2 ω ˜ d + 2 ω ˜ e ]
D 17
8 ! 2 ! 3 ! [ 6 x a x b x c x e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + 3 ω ˜ e 3 x a x b x c x d 2 x e ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + 3 ω ˜ e x a x b x c x e 3 ω ˜ a + ω ˜ b + ω ˜ c + 3 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + 3 ω ˜ e x a x b x c x d 2 x e 3 ω ˜ a + ω ˜ b + ω ˜ c + 2 ω ˜ d + 3 ω ˜ e ]
D 18
8 ! 4 ! [ 6 x a x b x c x d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 4 ω ˜ e x a x b x c x d x e 4 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 4 ω ˜ e 6 x a x b x c x d x e 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 4 ω ˜ e ]
D 19
8 ! 3 ! 3 x a x b x c x d x e x f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + 3 ω ˜ f x a x b x c x d x e x f 3 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + 3 ω ˜ f
D 20
8 ! 2 ! 2 ! [ 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f x a x b x c x d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e + ω ˜ f x a x b x c x d x e 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e + ω ˜ f x a x b x c x d x f 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e + ω ˜ f x a x b x c x d x e 2 x f 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + 2 ω ˜ e + ω ˜ f ]
D 21
8 ! 2 ! x a x b x c x d x e x f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f + 2 ω ˜ g x a x b x c x d x e x f x g 2 ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f + 2 ω ˜ g
D 22
8 ! x a x b x c x d x e x f x g x h ω ˜ a + ω ˜ b + ω ˜ c + ω ˜ d + ω ˜ e + ω ˜ f + ω ˜ g + ω ˜ h
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Adhikari, K.; Choudhury, S.; Kumar, S.; Mandal, S.; Pandey, N.; Roy, A.; Sarkar, S.; Sarker, P.; Shariff, S.S. Circuit Complexity in Z2 EEFT. Symmetry 2023, 15, 31. https://doi.org/10.3390/sym15010031

AMA Style

Adhikari K, Choudhury S, Kumar S, Mandal S, Pandey N, Roy A, Sarkar S, Sarker P, Shariff SS. Circuit Complexity in Z2 EEFT. Symmetry. 2023; 15(1):31. https://doi.org/10.3390/sym15010031

Chicago/Turabian Style

Adhikari, Kiran, Sayantan Choudhury, Sourabh Kumar, Saptarshi Mandal, Nilesh Pandey, Abhishek Roy, Soumya Sarkar, Partha Sarker, and Saadat Salman Shariff. 2023. "Circuit Complexity in Z2 EEFT" Symmetry 15, no. 1: 31. https://doi.org/10.3390/sym15010031

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop