Quantum Pathways for Charged Track Finding in High-Energy Collisions
- URL: http://arxiv.org/abs/2311.00766v1
- Date: Wed, 1 Nov 2023 18:13:59 GMT
- Title: Quantum Pathways for Charged Track Finding in High-Energy Collisions
- Authors: Christopher Brown, Michael Spannowsky, Alexander Tapper, Simon
Williams and Ioannis Xiotidis
- Abstract summary: In high-energy particle collisions, charged track finding is a complex yet crucial endeavour.
We propose a quantum algorithm, specifically quantum template matching, to enhance the accuracy and efficiency of track finding.
- Score: 42.044638679429845
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In high-energy particle collisions, charged track finding is a complex yet
crucial endeavour. We propose a quantum algorithm, specifically quantum
template matching, to enhance the accuracy and efficiency of track finding.
Abstracting the Quantum Amplitude Amplification routine by introducing a data
register, and utilising a novel oracle construction, allows data to be parsed
to the circuit and matched with a hit-pattern template, without prior knowledge
of the input data. Furthermore, we address the challenges posed by missing hit
data, demonstrating the ability of the quantum template matching algorithm to
successfully identify charged-particle tracks from hit patterns with missing
hits. Our findings therefore propose quantum methodologies tailored for
real-world applications and underline the potential of quantum computing in
collider physics.
Related papers
- Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness [0.0]
We prove the natural robustness of quantum statistical queries for learning quantum processes.
We adapt a learning algorithm for constant-depth quantum circuits to the quantum statistical query setting.
We show the hardness of the quantum threshold search problem from quantum statistical queries.
arXiv Detail & Related papers (2024-05-20T14:55:20Z) - Quantum algorithms in particle physics [0.0]
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.
arXiv Detail & Related papers (2024-01-29T15:01:57Z) - Long-lived Particles Anomaly Detection with Parametrized Quantum
Circuits [0.0]
We propose an anomaly detection algorithm based on a parametrized quantum circuit.
This algorithm has been trained on a classical computer and tested with simulations as well as on real quantum hardware.
arXiv Detail & Related papers (2023-12-07T11:50:42Z) - 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) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Designing exceptional-point-based graphs yielding topologically
guaranteed quantum search [0.0]
We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, coalesce to zero.
The resulting search is guaranteed to succeed in a bounded time for any initial condition.
arXiv Detail & Related papers (2022-02-08T04:30:24Z) - Quantum speedup for track reconstruction in particle accelerators [51.00143435208596]
We identify four fundamental routines present in every local tracking method and analyse how they scale in the context of a standard tracking algorithm.
Although the found quantum speedups are mild, this constitutes to the best of our knowledge, the first rigorous evidence of a quantum advantage for a high-energy physics data processing task.
arXiv Detail & Related papers (2021-04-23T13:32:14Z) - Quantum information spreading in a disordered quantum walk [50.591267188664666]
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern.
We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport.
Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
arXiv Detail & Related papers (2020-10-20T20:03:19Z)
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.