Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs

被引：4

作者：

Clemente, Giuseppe ^{[1
]}

Crippa, Arianna ^{[1
]}

Jansen, Karl ^{[1
]}

Ramirez-Uribe, Selomit ^{[2
,3
,4
]}

Renteria-Olivo, Andres E. ^{[2
]}

Rodrigo, German ^{[2
]}

Sborlini, German F. R. ^{[5
,6
]}

Silva, Luiz Vale ^{[2
]}

机构：

[1] Deutsch Elektronen Synchrotron DESY, Platanenallee 6, D-15738 Zeuthen, Germany

[2] Univ Valencia, Consejo Super Invest Cient, Inst Fis Corpuscular, Parc Cient, E-46980 Paterna, Valencia, Spain

[3] Univ Autonoma Sinaloa, Fac Ciencias Fisico Matemat, Ciudad Univ, Culiacan 80000, Mexico

[4] Univ Autonoma Sinaloa, Fac Ciencias Tierra & Espacio, Ciudad Univ, Culiacan 80000, Mexico

[5] Univ Salamanca, Dept Fis Fundamental & IUFFyM, Salamanca 37008, Spain

[6] Univ Europea Valencia, Escuela Ciencias Ingn & Diseno, Paseo Alameda 7, Valencia 46010, Spain

来源：

PHYSICAL REVIEW D | 2023年 / 108卷 / 09期

基金：

欧盟地平线“2020”;

关键词：

ALGORITHMS; INTEGRALS; AMPLITUDES;

D O I：

10.1103/PhysRevD.108.096035

中图分类号：

P1 [天文学];

学科分类号：

0704 ;

摘要：

We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams in the loop-tree duality or, equivalently, the selection of acyclic configurations in directed graphs. A loop Hamiltonian based on the adjacency matrix describing a multiloop topology, and whose different energy levels correspond to the number of cycles, is minimized by VQE to identify the causal or acyclic configurations. The algorithm has been adapted to select multiple degenerated minima and thus achieves higher detection rates. A performance comparison with a Grover's based algorithm is discussed in detail. The VQE approach requires, in general, fewer qubits and shorter circuits for its implementation, albeit with lesser success rates.

引用

页数：19