Quantum-annealing-inspired algorithms for multijet clustering

• URL: http://arxiv.org/abs/2410.14233v1
• Date: Fri, 18 Oct 2024 07:31:04 GMT
• Title: Quantum-annealing-inspired algorithms for multijet clustering
• Authors: Hideki Okawa, Xian-Zhe Tao, Qing-Guo Zeng, Man-Hong Yung,
• Abstract summary: We introduce novel quantum-annealing-inspired algorithms for clustering multiple jets in electron-positron collision events. One of these quantum-annealing-inspired algorithms, ballistic simulated bifurcation, overcomes problems previously observed in multijet clustering with quantum-annealing approaches.
• Score: 0.0
• License:
• Abstract: Jet clustering or reconstruction, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons, is a key component at high energy colliders. It is a complicated combinatorial optimization problem and requires intensive computing resources. In this study, we formulate jet reconstruction as a quadratic unconstrained binary optimization (QUBO) problem and introduce novel quantum-annealing-inspired algorithms for clustering multiple jets in electron-positron collision events. One of these quantum-annealing-inspired algorithms, ballistic simulated bifurcation, overcomes problems previously observed in multijet clustering with quantum-annealing approaches. We find that both the distance defined in the QUBO matrix as well as the prediction power of the QUBO solvers have crucial impacts on the multijet clustering performance. This study opens up a new approach to globally reconstruct multijet beyond dijet in one-go, in contrast to the traditional iterative method.

Related papers

• A Novel Quantum Realization of Jet Clustering in High-Energy Physics Experiments [8.841173525787223]
  In high-energy particle collisions, quarks and gluons are produced and immediately form collimated particle sprays known as jets. Accurate jet clustering is crucial as it retains the information of the originating quark or gluon. This study highlights the feasibility of quantum computing to revolutionize jet clustering.
  arXiv  Detail & Related papers  (2024-07-12T07:26:22Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• 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)
• A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms [18.075115172621096]
  We present a formal analysis of hybrid algorithms in the context of solving mixed-binary quadratic programs via Ising solvers. We propose to solve this reformulation with a hybrid quantum-classical cutting-plane algorithm.
  arXiv  Detail & Related papers  (2022-07-27T16:47:32Z)
• Quantum Annealing for Jet Clustering with Thrust [0.0]
  In high-energy collider physics, quantum-assisted algorithms might accelerate the clustering of particles into jets. We find that quantum annealing yields similar performance to exact classical approaches. Without tuning, comparable performance can be obtained through a hybrid quantum/classical approach.
  arXiv  Detail & Related papers  (2022-05-05T17:46:07Z)
• Spectral density reconstruction with Chebyshev polynomials [77.34726150561087]
  We show how to perform controllable reconstructions of a finite energy resolution with rigorous error estimates. This paves the way for future applications in nuclear and condensed matter physics.
  arXiv  Detail & Related papers  (2021-10-05T15:16:13Z)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• Adiabatic Quantum Algorithm for Multijet Clustering in High Energy Physics [0.0]
  This paper introduces a novel quantum binary clustering algorithm to tackle dijet event clustering. The benchmarked efficiency is of the order of $96%$, thus yielding substantial improvements over the current quantum state-of-the-art. We also show how to generalize the proposed objective function into a more versatile form, capable of solving the clustering problem in multijet events.
  arXiv  Detail & Related papers  (2020-12-28T22:45: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.