Quantum algorithm for Feynman loop integrals

• URL: http://arxiv.org/abs/2105.08703v3
• Date: Tue, 17 May 2022 10:54:20 GMT
• Title: Quantum algorithm for Feynman loop integrals
• Authors: Selomit Ram\'irez-Uribe, Andr\'es E. Renter\'ia-Olivo, Germ\'an Rodrigo, German F. R. Sborlini, Luiz Vale Silva
• Abstract summary: 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. A quantum algorithm is used to unfold the causal singular configurations of multiloop Feynman diagrams.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum algorithms for Hopcroft's problem [45.45456673484445]
  We study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n4/3)$ time. Our results are two different quantum algorithms with time complexity $widetilde O(n5/6)$.
  arXiv  Detail & Related papers  (2024-05-02T10:29:06Z)
• Quantum querying based on multicontrolled Toffoli gates for causal Feynman loop configurations and directed acyclic graphs [0.0]
  We present a quantum algorithm for querying causality of multiloop Feynman diagrams. The construction of the quantum oracle is surprisingly based exclusively on multicontrolled Toffoli gates and XNOT gates. We explicitly analise several three-, four- and five-eloop topologies, which have not been previously explored.
  arXiv  Detail & Related papers  (2024-04-04T15:51:43Z)
• Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk [0.8057006406834466]
  This paper presents a deterministic search algorithm on complete bipartite graphs. We address the most general case of multiple marked states, so there is a problem of estimating the number of marked states. We construct a quantum counting algorithm based on the spectrum structure of the search operator.
  arXiv  Detail & Related papers  (2024-04-02T05:09:33Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Grover's Quantum Search Algorithm of Causal Multiloop Feynman Integrals [0.0]
  A proof-of-concept application of a quantum algorithm to multiloop Feynman integrals in the Loop-Tree Duality (LTD) framework is applied. A modification of Grover's quantum search algorithm is developed and the quantum algorithm is successfully implemented on IBM Quantum and QUTE simulators.
  arXiv  Detail & Related papers  (2022-11-25T19:40:51Z)
• Quantum Algorithm for Querying Causality of Multiloop Scattering Amplitudes [0.0]
  The first application of a quantum algorithm to Feynman loop integrals is reviewed. The two on-shell states of a Feynman propagator are naturally encoded in a qubit. The problem to be addressed is the identification of the causal singular configurations of multiloop Feynman diagrams.
  arXiv  Detail & Related papers  (2022-11-10T11:12:10Z)
• Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs [0.0]
  We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams. 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.
  arXiv  Detail & Related papers  (2022-10-24T13:42:53Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.