From Causal Representation of Multiloop Scattering Amplitudes to Quantum Computing

• URL: http://arxiv.org/abs/2201.04381v1
• Date: Wed, 12 Jan 2022 09:27:10 GMT
• Title: From Causal Representation of Multiloop Scattering Amplitudes to Quantum Computing
• Authors: Selomit Ram\'irez-Uribe
• Abstract summary: An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output is directly translated to causal thresholds needed for the causal representation in the loop-tree duality.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output obtained is directly translated to causal thresholds needed for the causal representation in the loop-tree duality.

Related papers

• Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits [1.151731504874944]
  We prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.
  arXiv  Detail & Related papers  (2024-09-27T03:18:28Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• 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)
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
  We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms. We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states. We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
  arXiv  Detail & Related papers  (2020-12-22T19:00:04Z)
• A dynamic programming approach for distributing quantum circuits by bipartite graphs [1.3249509346606656]
  Near-term large quantum computers are not able to operate as a single processing unit. It is required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit. In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit.
  arXiv  Detail & Related papers  (2020-05-03T11:08:37Z)

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.