Track clustering with a quantum annealer for primary vertex
reconstruction at hadron colliders
- URL: http://arxiv.org/abs/1903.08879v4
- Date: Mon, 3 Apr 2023 23:30:05 GMT
- Title: Track clustering with a quantum annealer for primary vertex
reconstruction at hadron colliders
- Authors: Souvik Das, Andrew J. Wildridge, Andreas Jung
- Abstract summary: Clustering of charged particle tracks along the beam axis is the first step in reconstructing the positions of hadronic interactions.
We use a 2036 physical qubit D-Wave quantum annealer to perform track clustering in a limited capacity on artificial events.
- Score: 0.9023847175654603
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Clustering of charged particle tracks along the beam axis is the first step
in reconstructing the positions of hadronic interactions, also known as primary
vertices, at hadron collider experiments. We use a 2036 physical qubit D-Wave
quantum annealer to perform track clustering in a limited capacity on
artificial events where the positions of primary vertices and tracks resemble
those measured by the Compact Muon Solenoid experiment at the Large Hadron
Collider. The algorithm, which is not a classical-quantum hybrid but relies
entirely on quantum annealing, is tested on a variety of event topologies. We
demonstrate a deterministic graph-embedding of the problem on the D-Wave
Chimera architecture, a method for optimizing the coupling strengths within
logical qubits, and a method for optimizing annealing time. Further, we
benchmark it against simulated annealing on a commercial CPU constrained to the
same processor time per anneal as the physical annealer. We note a quantum
advantage against simulated annealing up to a 56 logical qubit problem that
involves 665 physical qubits on average. Our embedding and optimization
methods, and the benchmarking paradigm, can be applied generally to other
clustering problems on quantum annealers. This algorithm may be used as a
building-block for more sophisticated algorithms to reach the number of primary
vertices at the LHC.
Related papers
- Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution.
We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions.
We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
arXiv Detail & Related papers (2024-05-27T17:40:39Z) - 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.
In this study, we show that the simulated bifurcation algorithms can be employed for solving the particle tracking problem.
arXiv Detail & Related papers (2024-02-22T17:19:03Z) - Quantum speedup for combinatorial optimization with flat energy
landscapes [0.0]
We develop a theoretical framework to analyze the relative performance of the optimized quantum adiabatic algorithm and a broad class of classical Markov chain Monte Carlo algorithms.
arXiv Detail & Related papers (2023-06-22T18:00:00Z) - 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) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - 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) - Quantum Optimization of Maximum Independent Set using Rydberg Atom
Arrays [39.76254807200083]
We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem.
We find the problem hardness is controlled by the solution degeneracy and number of local minima.
On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
arXiv Detail & Related papers (2022-02-18T19:00:01Z) - The Quantum Trellis: A classical algorithm for sampling the parton
shower with interference effects [9.690748017851927]
We present a classical algorithm called the quantum trellis to efficiently compute the un-normalized probability density over N-body phase space.
This provides a potential path forward for classical computers and a strong baseline for approaches based on quantum computing.
arXiv Detail & Related papers (2021-12-23T19:00:05Z)
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.