REVIEW 1 cited by
Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations
read the original abstract
Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying directed acyclic graphs in graph theory. In this paper, we present the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Clique Partition problem. The evaluation of the MCA quantum algorithm is exhibited by analysing the transpiled quantum circuit depth and quantum circuit area.
Forward citations
Cited by 1 Pith paper
-
Overview of Applications of Quantum Computing in QCD
A concise literature overview of quantum algorithms for QCD and collider tasks, stressing possible advantages over classical methods and NISQ hardware limits.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.