Quantum speedup for track reconstruction in particle accelerators

• URL: http://arxiv.org/abs/2104.11583v3
• Date: Wed, 20 Apr 2022 09:20:35 GMT
• Title: Quantum speedup for track reconstruction in particle accelerators
• Authors: Duarte Magano, Akshat Kumar, M\=arti\c{n}\v{s} K\=alis, Andris Loc\=ans, Adam Glos, Sagar Pratapsi, Gon\c{c}alo Quinta, Maksims Dimitrijevs, Aleksander Rivo\v{s}s, Pedrame Bargassa, Jo\~ao Seixas, Andris Ambainis, Yasser Omar
• Abstract summary: 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.
• Score: 51.00143435208596
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To investigate the fundamental nature of matter and its interactions, particles are accelerated to very high energies and collided inside detectors, producing a multitude of other particles that are scattered in all directions. As charged particles traverse the detector, they leave signals of their passage. The problem of track reconstruction is to recover the original trajectories from these signals. This challenging data analysis task will become even more demanding as the luminosity of future accelerators increases, leading to collision events with a more complex structure. We identify four fundamental routines present in every local tracking method and analyse how they scale in the context of a standard tracking algorithm. We show that for some of these routines we can reach a lower computational complexity with quantum search algorithms. 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.

Related papers

• Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
  We study a class of maximally chaotic circuits known as dual unitary circuits. We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
  arXiv  Detail & Related papers  (2024-11-01T17:57:13Z)
• Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders [0.0]
  Track reconstruction can be formulated as a quadratic unconstrained binary optimization problem. We show that simulated bifurcation algorithms can be employed to solve the particle tracking problem.
  arXiv  Detail & Related papers  (2024-02-22T17:19:03Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum Pathways for Charged Track Finding in High-Energy Collisions [42.044638679429845]
  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.
  arXiv  Detail & Related papers  (2023-11-01T18:13:59Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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)
• Particle Track Reconstruction with Quantum Algorithms [1.087475836765689]
  We present our work on the implementation of a quantum-based track finding algorithm aimed at reducing background during the initial seeding stage. The reconstruction of charged particle tracks will be a major challenge to the correct interpretation of the HL-LHC data.
  arXiv  Detail & Related papers  (2020-03-18T09:59:20Z)
• Quantifying Computational Advantage of Grover's Algorithm with the Trace Speed [0.0]
  We report a close connection between the trace speed and the quantum speed-up in Grover's search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state.
  arXiv  Detail & Related papers  (2020-01-13T19:01:09Z)

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.