Related papers: Quantum algorithms in particle physics

Quantum algorithms in particle physics

URL: http://arxiv.org/abs/2401.16208v1
Date: Mon, 29 Jan 2024 15:01:57 GMT
Title: Quantum algorithms in particle physics
Authors: Germ\'an Rodrigo
Abstract summary: We discuss how a quantum approach reduces the complexity of jet clustering algorithms. We show how quantum algorithms efficiently identify causal configurations of multiloop Feynman diagrams.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet clustering algorithms, such as anti-kT , and show how quantum algorithms efficiently identify causal configurations of multiloop Feynman diagrams. We also present a quantum integration algorithm, called QFIAE, which is successfully applied to the evaluation of one-loop Feynman integrals in a quantum simulator or in a real quantum device.

Related papers

Hybrid quantum-classical approach for combinatorial problems at hadron colliders [7.2572969510173655]
We explore the potential of quantum algorithms to resolve the problems in particle physics experiments. We consider top quark pair production in the fully hadronic channel at the Large Hadron Collider. We show that the efficiency for selecting the correct pairing is greatly improved by utilizing quantum algorithms.
arXiv Detail & Related papers (2024-10-29T18:00: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)
Quantum-classical simulation of quantum field theory by quantum circuit learning [0.0]
We employ quantum circuit learning to simulate quantum field theories (QFTs) We find that our predictions closely align with the results of rigorous classical calculations. This hybrid quantum-classical approach illustrates the feasibility of efficiently simulating large-scale QFTs on cutting-edge quantum devices.
arXiv Detail & Related papers (2023-11-27T20:18:39Z)
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 data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z)
Quantum Phase Recognition via Quantum Kernel Methods [6.3286116342955845]
We explore the power of quantum learning algorithms in solving an important class of Quantum Phase Recognition problems. We numerically benchmark our algorithm for a variety of problems, including recognizing symmetry-protected topological phases and symmetry-broken phases. Our results highlight the capability of quantum machine learning in predicting such quantum phase transitions in many-particle systems.
arXiv Detail & Related papers (2021-11-15T06:17:52Z)
Towards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices [1.7242431149740054]
We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high energy physics. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices.
arXiv Detail & Related papers (2021-10-07T22:13:37Z)
Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z)
Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z)
A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex [0.0]
We develop a quantum algorithm to simulate any dynamical process represented by either the operator sum representation or the Lindblad master equation. We demonstrate the quantum algorithm by simulating the dynamics of the Fenna-Matthews-Olson complex on the IBM QASM quantum simulator.
arXiv Detail & Related papers (2021-01-13T19:00:02Z)
Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z)

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