Pith. sign in

REVIEW 4 cited by

Quantum algorithm for Feynman loop integrals

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

arxiv 2105.08703 v3 pith:TC4UUMD5 submitted 2021-05-18 hep-ph hep-thquant-ph

classification hep-phhep-thquant-ph
keywords algorithmquantumfeynmannumberstatescausalconfigurationsapplication
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal singular configurations of multiloop Feynman diagrams. To identify such configurations, we exploit Grover's algorithm for querying multiple solutions over unstructured datasets, which presents a quadratic speed-up over classical algorithms when the number of solutions is much smaller than the number of possible configurations. A suitable modification is introduced to deal with topologies in which the number of causal states to be identified is nearly half of the total number of states. The output of the quantum algorithm in \emph{IBM Quantum} and \emph{QUTE Testbed} simulators is used to bootstrap the causal representation in the loop-tree duality of representative multiloop topologies. The algorithm may also find application and interest in graph theory to solve problems involving directed acyclic graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum simulation of scattering amplitudes and interferences in perturbative QCD

    hep-ph 2025-07 conditional novelty 7.0 of 10

    A quantum circuit encodes QCD colour factors and diagram interferences in a measurement probability, with permuted identical-particle diagrams generated by swap sorting networks.

  2. Continuous-variable photonic quantum extreme learning machines for fast collider-data selection

    quant-ph 2025-10 conditional novelty 4.0 of 10

    A Gaussian photonic QELM with displacement encoding and quadrature/photon-number readout produces polynomial features that, under a linear readout, match or beat small MLPs on top-jet and Higgs classification.

  3. Quantum algorithms for the simulation of QCD processes in the perturbative regime

    hep-ph 2024-12 conditional novelty 3.0 of 10

    Quantum circuits for the colour algebra of perturbative QCD are presented and validated on a simulator, matching analytic colour factors for example diagrams.

  4. Overview of Applications of Quantum Computing in QCD

    hep-ph 2026-07 accept novelty 2.0 of 10

    A concise literature overview of quantum algorithms for QCD and collider tasks, stressing possible advantages over classical methods and NISQ hardware limits.

Pith tools