Quantum Algorithm for Querying Causality of Multiloop Scattering
Amplitudes
- URL: http://arxiv.org/abs/2211.05487v1
- Date: Thu, 10 Nov 2022 11:12:10 GMT
- Title: Quantum Algorithm for Querying Causality of Multiloop Scattering
Amplitudes
- Authors: Selomit Ram\'irez-Uribe
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The first application of a quantum algorithm to Feynman loop integrals is
reviewed. The connection between quantum computing and perturbative quantum
field theory is feasible due to fact that the two on-shell states of a Feynman
propagator are naturally encoded in a qubit. The particular problem to be
addressed is the identification of the causal singular configurations of
multiloop Feynman diagrams. The identification of such configurations is
carried out through the implementation of a modified Grover's quantum algorithm
for querying multiple solutions over unstructured datasets.
Related papers
- Universal Euler-Cartan Circuits for Quantum Field Theories [0.0]
A hybrid quantum-classical algorithm is presented for the computation of non-perturbative characteristics of quantum field theories.
The algorithm relies on a universal parametrized quantum circuit ansatz based on Euler and Cartan's decompositions of single and two-qubit operators.
arXiv Detail & Related papers (2024-07-31T01:59:09Z) - Quantum computing topological invariants of two-dimensional quantum matter [0.0]
We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers.
First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits.
Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
arXiv Detail & Related papers (2024-04-09T06:22:50Z) - 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) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - 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) - 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) - From Causal Representation of Multiloop Scattering Amplitudes to Quantum
Computing [0.0]
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.
arXiv Detail & Related papers (2022-01-12T09:27:10Z) - 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) - 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)
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.