Scholarlink

<p>Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by encoding Feynman propagators as qubits, a challenging task closely analogous to querying directed acyclic graphs in graph theory. In this paper, we introduce the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality, wherein manifestly causal integrand representations of multiloop Feynman diagrams play a central role. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Clique Partition problem. The performance of the MCA quantum algorithm across diverse multiloop topologies is assessed by analysing the transpiled quantum circuit depth and quantum circuit area, showing a significant reduction in the quantum resources needed for implementation.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月22日

查看全文
  • Salvador A. Ochoa-Oregon,
  • Juan P. Uribe-Ramírez,
  • Roger J. Hernández-Pinto,
  • Selomit Ramírez-Uribe,
  • Germán Rodrigo

摘要

Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by encoding Feynman propagators as qubits, a challenging task closely analogous to querying directed acyclic graphs in graph theory. In this paper, we introduce the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality, wherein manifestly causal integrand representations of multiloop Feynman diagrams play a central role. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Clique Partition problem. The performance of the MCA quantum algorithm across diverse multiloop topologies is assessed by analysing the transpiled quantum circuit depth and quantum circuit area, showing a significant reduction in the quantum resources needed for implementation.