Complete reduction of integrals in two-loop five-light-parton scattering amplitudes

We reduce all the most complicated Feynman integrals in two-loop five-light-parton scattering amplitudes to basic master integrals, while other integrals can be reduced even easier. Our results are expressed as systems of linear relations in the block-triangular form, very efficient for numerical calculations. Our results are crucial for complete next-to-next-to-leading order quantum chromodynamics calculations for three-jet, photon, and/or hadron production at hadron colliders. To determine the block-triangular relations, we develop an efficient and general method, which may provide a practical solution to the bottleneck problem of reducing multiloop multiscale integrals.


Introduction
Owing to the good performance of the large hadron collider (LHC), we have entered the era of precision high-energy physics. Some of the most important observables are three-light particles or jet production cross-sections [1 -3], which can both be used for testing the strong interaction at high energies and for determining the quantum chromodynamics (QCD) coupling constant. From the theoretical viewpoint, predictions with compatible precision are needed, which requires perturbative QCD calculations up to the next-to-next-to-leading order (NNLO). Although significant advances have been made in the past few years , a complete NNLO result is still unavailable. One of the main concurrent obstacles is computation of two-loop amplitudes.
To evaluate a two-loop five-light-parton scattering amplitude, one usually first generates an integrand, reduces all of the Feynman integrals to linear combinations of relatively simpler master integrals (MIs), and finally calculates these MIs. Because integrands can be obtained either using the unitarity method [4][5][6][7][8][9] or using the con-ventional Feynman diagram method, and because MIs can be calculated analytically [20][21][22][23][24], the bottleneck is the reduction of Feynman integrals. For example, the non-planar contribution of two-loop three-photon production at the LHC cannot be calculated, owing to the lack of such reduction for nonplanar integrals [19].
Reduction is usually achieved by integration-by-parts (IBP) identities combined with Laporta's algorithm [25][26][27][28][29][30][31][32][33][34][35]. Although many interesting proposals have been made recently for improving the IBP reduction [36][37][38][39][40][41][42][43][44][45][46][47][48][49], the problem of reducing multiloop multiscale integrals has not been fully solved yet. The difficulty is twofold. On the one hand, owing to the number of scales, an explicit solution of the IBP system is usually too big to be used in numerical calculations; in addition, it is very difficult to obtain [47][48][49][50][51]. On the other hand, although solving the IBP system numerically in a single run is feasible, one usually needs to solve it many times, for either the phase space integration or fitting analytical expressions, which is very time-and resource-consuming. For example, to reconstruct the fully analytical two-loop fivegluon all-plus helicity amplitude [17], one needs to run the numerical computation of the IBP for nearly half a million times 1) . If one uses the same method for reconstructing analytical one-minus or maximal-helicity-violation amplitude, many more IBP calculation runs may be needed, which becomes prohibitive.
We note that a reduction can be obtained efficiently if a system of block-triangular relations is found, which has a small expression size and can be solved numerically very efficiently. Using our proposed series representation of Feynman integrals as input [52,53], in Ref. [52] we described an algorithm that searched for block-triangular relations and yielded some preliminary results. Although our method developed in Ref. [52] is sufficiently good for reducing integrals with integrands having only denominators, the method is very time-consuming for physical problems that contain integrands with numerators.
In this paper, by further developing the method in Ref. [52], we propose a two-step search strategy along with a reduction scheme that is suitable for physical problems. Based on this, we successfully find out block-triangular relations to reduce integrals in two-loop five-lightparton scattering amplitudes. As expected, the relations are only 148 MB in size, and can be numerically solved hundreds of times faster than using other methods. Our work constitutes an important step towards the complete NNLO QCD calculation for three-jet, photon, or hadron production at the LHC. Because our method is efficient and general, it can be straightforwardly applied to any other process, thus providing a practical solution for the bottleneck problem of reducing Feynman integrals.

Feynman integrals in two-loop five-lightparton scattering amplitudes
To obtain the very much needed reduction of Feynman integrals in two-loop five-light-parton scattering amplitudes, we only need to consider integrals that originate from the four topologies shown in Fig. 1. All the other Feynman integrals are one-loop-like, and can be dealt with much easier.
Let us consider the most complicated case, topology (a) in Fig. 1, as an example that will explain what kind of Feynman integrals do we need to reduce. There are five external momenta flowing into the diagram, satisfying on-shell conditions ( ) and momentum conservation . As a result, this problem contains five independent mass scales, which can be chosen as with and . With two loop momenta and , a complete set of Lorentz scalars can be chosen as where the first eight are inverse propagators and the last three are introduced to make the set complete. Then, the family of integrals defined by topology (a) can be expressed as where the indexes are integers, , and are nonpositive integers. Two integrals in this family are said to be in the same sector if the positions of their positive indexes are the same. The degree of an integral is defined by the opposite value of the summation of all of its negative indexes. Finally, we call a degree-m integral is -type if it has n positive indexes and all of these positive indexes are . For example, is a degree-5 integral in the top sector, and it is -type.
For later convenience, we define operators (for a non-negative integer m), which generate a set of integrals in the same sector or its subsectors when acting on an integral. For any integral , , , generates a set of integrals with one index decreased by 1, and generates a set of integrals with one nonzero index increased by 1. For example, we have We also define operators , which can generate a set of integrals as a union of integrals generated by when acting on an integral.
As is well-known, the most complicated 1) integrals in the amplitudes are those with the highest number of propagators, i.e., , and the highest numerator degree, i.e., . By studying the two-loop five-gluon scattering amplitude diagram by diagram, we find that the highest numerator degree is 5 for all integrals. Therefore, we define an integral set which contains 3914 nonzero integrals with all of the most complicated integrals in five-gluon scattering amplitude being included. Because the five-gluon scattering amplitude is sufficiently general, all of the most complicated integrals (if not all integrals) belonging to topology (a) appearing in five-light-parton scattering amplitudes are included in set . In fact, for the two-loop fivegluon all-plus helicity amplitude, integrals in topology (a) form a subset of [5]. Therefore, for the purpose of reducing integrals in physical amplitudes, the main job for topology (a) is to reduce integrals in set .
For topologies (b), (c), and (d) in Fig. 1, we define sets of target integrals , and , similar to .

Search for block-triangular relations
Before presenting our method for reducing two-loop five-light-parton integrals, let us first point out that for multiscale problems, expressing general integrals in terms of MIs explicitly is not preferred, even at the one-loop level. Instead, one usually sets up a system of block-trian-gular relations that can numerically relate all of the integrals to MIs (see [54] and references therein).
The advantage of a system of block-triangular relations over the explicit solution can be understood based on the integrals' singularities. If we express a complicated integral as a linear combination of simpler MIs, powers of Gram determinants will appear in the denominators of the coefficients of these MIs, which is necessary because only thus the linear combination of MIs can generate correct singularities of the target integral. Then, the numerators of these coefficients will have high mass dimensions and thus will have very long expressions. This difficulty can be nicely resolved using a system of blocktriangular relations. Relations in each block can be very simple, but their solution can naturally generate Gram determinants in the denominator. Furthermore, correctly choosing the blocks may result in the solution involving only one Gram determinant. Because reduction at the multiloop level is much more complicated than for the one-loop case, the above discussion implies that constructing a system of block-triangular relations may be the best way to reduce multiloop multiscale integrals. Unlike the one-loop case, where block-triangular systems can be achieved easily by analytically solving the IBP relations, block-triangular systems at the multiloop level are in general difficult to obtain.
In Ref. [52], based on our proposed series representation of Feynman integrals [52,53] as input information, we constructed an algorithm that searched for block-triangular relations to reduce multiloop multiscale integrals. However, we found the method to be very time-consuming for physical problems, although it was efficient for reducing integrals with integrands containing only denominators. To deal with physical problems such as two-loop five-light-parton integrals, we propose here a two-step search strategy.
In the first step, we set up a system of relations that can numerically express all of the target integrals in terms of MIs. The system is allowed to be somewhat inefficient in numerical calculations; thus, the system is not required to be block-triangular. This system can be obtained either by using our series representation of Feynman integrals [52], or simply by using the well-known IBP system.
In the second step, we search for a system of blocktriangular relations, which needs to be very efficient for numerical computations. The algorithm is the same as that proposed in Ref. [52] except that, instead of using our series representation of Feynman integrals, we use the 1) The definition of complexity is a consequence of a convention to order integrals. In our convention, integrals are thought to be more complicated if they have more propagators, integrals in the same sector are more complicated if they have higher total denominator powers or if they have higher degree, and so on. numerical solution obtained in the first step as input information.
More details about the search strategy can be found in appendix.

Reduction scheme and resultŝ
To apply the above-proposed search strategy to physical problems, we still need to introduce the reduction scheme, which amounts to choosing target integrals and other integrals that are allowed to appear in each block. In this paper, integrals in each block are defined by operator acting on a proper integral. For example, to reduce the integrals in , all of the integrals are allowed to appear in the first block, and the target integrals in this block are all the 21 most complicated integrals in the top sector with degree 5. The first block enables us to express all the 21 most complicated integrals in terms of simpler integrals. Then, in the second block, we choose the most complicated integrals among the rest of the integrals as target integrals, and use operator acting on a proper integral to generate a set of integrals that covers all the target integrals. Then, the process is repeated. Eventually, any integral can be expressed in terms of simpler integrals.
Using the above method, we successfully determined systems of block-triangular relations for integrals in the four topologies in Fig. 1. The file sizes for all of these relations are acceptable, ~148 MB. To obtain these results required ~200 central processing unit (CPU) core hours to search for relations in the second step of the two-step search strategy, in addition to hundreds of CPU-core hours for generating input information by numerically solving the system obtained in the first step. Some basic information about these results is listed in Table 1.
For more intuitive understanding, we show a matrix density plot for the block-triangular system of topology (a) in Fig. 2. This system contains 3914 integrals and 108 MIs, which means we need 3806 linear relations to reduce all of the target integrals. In this plot, each line represents a relation, each column corresponds to an integral, and black points represent nonzero elements in the mat-rix. Integrals are ordered, from the most complicated one to the simplest one, with MIs at the end of each line. The matrix is exactly block-triangular, and the largest block contains only tens of relations.
Analytic expressions for all of these relations are available from the website in [55]. Technical details about our reduction scheme can be found in appendix.

FIRE6
Our final reduction relations have been verified numerically using an independent code [29] for randomly chosen phase space points, and the results of both approaches were in a good agreement.
For each given numerical point and , solving our reduction relations of the four families cost 0.4 s using one CPU, as is shown in Table 1. The time spent can be divided into two parts: assignment (substituting numerical and into the system), which is proportional to the file size; and solving the system, which depends on both the number of relations and how these relations are coupled with each other. Because our systems are blocktriangular, the time spent on the latter part is shorter. Therefore, the efficiency of numerical calculation of our reduction relations can be simply estimated by the file size.
Compared with explicit solutions, the file sizes of our reduction relations are much smaller. The file size for explicit solutions of eight-propagator integrals with degree up to 4 in topology (a), 26 integrals overall, is ~2 GB [48]; that for the explicit solutions of eight-propagator integrals with degree up to 4 in topology (b), 32 integrals overall, is ~0.8 GB [47]; and that for the solutions of all  integrals in topology (c) is in excess of 20 GB for a compressed format [49]. It can be expected that our relations should be hundreds of times smaller than the complete explicit solution in terms of the file size, which results in more than a 100-fold speedup of numerical calculations, even if there is no memory deficit for storing the huge expressions of explicit solutions.

FiniteFlow LiteRed
We note that the file size of trimmed IBP relations to reduce all of the integrals considered in this work is a few GB, which is also much larger than that of our reduction relations. The reason is that, although each IBP relation is simpler than ours, the IBP system involves hundreds of times more equations. Furthermore, the time spent on numerical IBP is dominated by the latter factor, because IBP relations are coupled in a complicated way. As a result, numerical IBP should be much more inefficient than our method. Through our test, numerical IBP via [35] combined with [34] costs about 2 min for each phase-space point, which is slower than our method by more than a 100-fold.
The above comparison reveals the advantage of our method. Numerical evaluation of explicit solutions spends too much time on assignments; while numerical IBP spends too much time on solving linear equations. Our method performs better on both parts, and therefore it is much more efficient. Similar to numerical evaluations over the field of prime numbers, our reduction relations should also be much more efficient for numerical evaluations with floating numbers, which enables phasespace integration to obtain physical cross-sections.

Summary and outlook
In this paper, we achieved the reduction of a set of integrals which covers all of the most complicated integ-rals in two-loop five-light-parton scattering amplitudes. Our results are expressed as systems of linear relations in the block-triangular form, which are very efficient for numerical calculations. The remaining integrals involved in amplitudes can be easily reduced using the same method, on demand. Therefore, a complete reduction of integrals in two-loop five-light-parton scattering amplitudes, which challenges all other methods, is available now. Because MIs are already known [20][21][22][23][24], our results provide the complete calculation of two-loop five-light-parton scattering amplitudes, and thus complete NNLO calculation of three light particles or jet-production at the LHC on the horizon.

tt + jet ttH
To obtain the block-triangular relations, we developed the method in Ref. [52] by proposing a two-step search strategy along with a reduction scheme. As our newly developed method is general and efficient, other more complicated problems, like two-loop integrals for , , or 4-jet hadron production, are also within reach. Our work opens the door for complete NNLO QCD calculations for production of three or more particles at the LHC.
In the current application of our method, most CPU time is allocated to solving the system obtained in the first step. Although the time spent is tolerable for the current problem, improvement may be needed for more complicated applications. There are different options. Using the method in [52], better integral sets can be explored. Another possible choice is to use trimmed IBP systems obtained by solving the Syzygy equations [44][45][46][47][48]. These possibilities will be addressed in future studies.  We want to set up a set of relations, using which we can express all integrals in in terms of MIs for any given phase-space point (rational numbers for both and ), with coefficients calculated in the finite field of a 63-bit prime number. Although the IBP method [25][26][27][28][29][30][31][32][33][34][35] can do this, we would like to explain in the following that our method proposed in [52] may provide a better choice.
For each given integral , called a seed, there are 12 IBP relations among the integral set In addition, there are six relations owing to the Lorentz invari-ance [56], which can be interpreted as linear combinations of IBP relations from other seeds [57].
The above IBP relations can also be found out easily using the method proposed in [52]. To this end, we introduce a parameter for all integrals in , and then search relations among them using input information from the series representation [52,53]. Up to , where is a half of the maximal value of the mass dimension for the coefficients of relations, we find at least 12 relations; while up to we find at least 12+6 relations. Because these relations are analytical in , we can take directly and recover the aforementioned IBP relations.
The advantage of our method in [52] is that it allows to search for relations among any set of integrals. As the simplest generalization of , we can define an integral set and search relations among them. Up to , there are typically 2 more relations besides 12+6 IBP relations for each seed. With more relations in hand, it is possible to select better relations to achieve a more efficient reduction. For example, our relations from all -type seeds can already reduce 15 out of all -type integrals to integrals with lower degree (these relations are available at [55]). IBP relations from these seeds cannot achieve this, because -type integrals do not show up. One can certainly explore other integral sets for each seed, to further improve the reduction efficiency. We did not do that because the efficiency of either the IBP set (6) or the generalized set (7) is sufficient for us to deal with the problem in this work.

LiteRed
With integral sets in hand, we generate a system of linear equations from all seeds belonging to -type with and , and use the package [35] to trim the system by removing redundant relations and solving the trimmed system numerically, which expresses all integrals in as linear combinations of 108 MIs (after exploring symmetries among MIs using ).

A.2 Search strategy: step two
In this step, we search linear relations to reduce the given target integrals in to simpler integrals in (the reducibility can be tested numerically easily). Combining the reduction scheme that will be described in the next section, a block-triangular system can be finally obtained.
We first describe how to search linear relations among the integral set of the form where can be decomposed as is the maximal power of allowed to appear in the relation, , is a half of the mass dimension of which can be fixed by , and are unknown rational numbers to be determined. It is crucial to point out that, for given and , the number of unknowns is finite. Therefore, it can be determined by a finite number of constraints. As will be explained in the following, these unknowns can be determined by the result obtained in the first step. ϵ ⃗ s Based on the system of equations in the first step, for a given numerical point and every integral in G can be represented as an 108-dimensional vector, with elements being the projection onto MIs, By inserting these numerical vectors into Eq. (8), we obtain a vector equation, which results in at most 108 independent constraints over the unknowns. By repeating the above procedure many times (at most several thousand in this work), a sufficient number of constraints can be obtained, for determining all of the unknowns. As the above values are actually calculated in the finite field of a given prime number, we still need to repeat the procedure for several different prime numbers (at most 15 in this work) and use the Chinese remainder theorem to reconstruct the real results of the unknowns. Finally, linear relations with given and are obtained.
To reduce to , we just set and search relations among G with different values of and . For the purpose of the current work, we find it is sufficient to fix . To find out simple relations, we follow the algorithm proposed in [52] by starting the search procedure with and increasing by 1 each time, until enough relations are obtained to reduce to .

A.3 Reduction schemê m ⊖
The reduction scheme determines which integrals should be involved in each block. We generate the integrals through previously defined operator acting on properly chosen integrals. For example, in the first block for topology (a), we need to reduce the most complicated -type integrals. To this end, we set with chosen as all 21 -type integrals. We indeed find out 21 independent relations, which can reduce all -type integrals to simpler integrals. The most complicated relation corresponds to , which means that the coefficients of -type integrals are degree-2 polynomials in . We then reduce -type integrals, which can be realized by setting with chosen as all 15 -type integrals. To reduce the rest of the top-sector integrals, we set with chosen as 11 top-sector integrals that are not MIs. After reducing the top-sector integrals, we still need to reduce the integrals in the subsectors. For example, for the seven-propagator sector , whose most complicated integrals in are of -type, we set with chosen as all 35 -type integrals in this sector.

S (a)
Based on the above scheme, we obtain 3801 reduction relations. By introducing additional 5 symmetry relations among MIs, we have 3806 relations in total that can express 3914 integrals in as linear combinations of 108 MIs.
G =3 ⊖ I {0,1,1,1,1,1,1,1,−1,0,0} 4 7 We note that there is a way to further reduce the block size that has not been applied in this work. For example, by setting , we can generate smaller-size blocks to reduce a part of -type integrals.