Geometrical causality: casting Feynman integrals into quantum algorithms

• URL: http://arxiv.org/abs/2305.08550v1
• Date: Mon, 15 May 2023 11:22:51 GMT
• Title: Geometrical causality: casting Feynman integrals into quantum algorithms
• Authors: German F. R. Sborlini
• Abstract summary: We discuss efficient strategies based on the Loop-Tree Duality, its manifestly causal representation and the underlying geometrical interpretation. In concrete, we exploit the geometrical causal selection rules to define a Hamiltonian whose ground-state is directly related to the terms contributing to the causal representation. In this way, the problem can be translated into a minimization one and implemented in a quantum computer to search for a potential speed-up.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The calculation of higher-order corrections in Quantum Field Theories is a challenging task. In particular, dealing with multiloop and multileg Feynman amplitudes leads to severe bottlenecks and a very fast scaling of the computational resources required to perform the calculation. With the purpose of overcoming these limitations, we discuss efficient strategies based on the Loop-Tree Duality, its manifestly causal representation and the underlying geometrical interpretation. In concrete, we exploit the geometrical causal selection rules to define a Hamiltonian whose ground-state is directly related to the terms contributing to the causal representation. In this way, the problem can be translated into a minimization one and implemented in a quantum computer to search for a potential speed-up.

Related papers

• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval [1.6421520075844793]
  A prime example is the weight optimization of laminated composite materials, which to this day remains a formidable problem. The rapidly developing field of quantum computation may offer novel approaches for addressing these intricate problems.
  arXiv  Detail & Related papers  (2024-02-09T15:01:56Z)
• On the quantum time complexity of divide and conquer [42.7410400783548]
  We study the time complexity of quantum divide and conquer algorithms for classical problems. We apply these theorems to an array of problems involving strings, integers, and geometric objects.
  arXiv  Detail & Related papers  (2023-11-28T01:06:03Z)
• Overcoming exponential volume scaling in quantum simulations of lattice gauge theories [1.5675763601034223]
  We present a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian.
  arXiv  Detail & Related papers  (2022-12-09T01:18:46Z)
• 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)
• 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)
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays [39.76254807200083]
  We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem. We find the problem hardness is controlled by the solution degeneracy and number of local minima. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
  arXiv  Detail & Related papers  (2022-02-18T19:00:01Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm [0.0]
  This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs. We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
  arXiv  Detail & Related papers  (2021-11-10T11:25:32Z)
• Quantum algorithm for Feynman loop integrals [0.0]
  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.
  arXiv  Detail & Related papers  (2021-05-18T17:41:56Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

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.