Quantum jet clustering with LHC simulated data
- URL: http://arxiv.org/abs/2209.08914v1
- Date: Mon, 19 Sep 2022 10:51:13 GMT
- Title: Quantum jet clustering with LHC simulated data
- Authors: Jorge J. Mart\'inez de Lejarza, Leandro Cieri, Germ\'an Rodrigo
- Abstract summary: Two new quantum algorithms might speed up classical jet clustering algorithms.
In the first two algorithms, an exponential speed up in dimensionality and data length can be achieved.
In the $k_T$ algorithm, a quantum version of the same order as FastJet is achieved.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the case where quantum computing could improve jet clustering by
considering two new quantum algorithms that might speed up classical jet
clustering algorithms. The first one is a quantum subroutine to compute a
Minkowski-based distance between two data points, while the second one consists
of a quantum circuit to track the rough maximum into a list of unsorted data.
When one or both algorithms are implemented in classical versions of well-known
clustering algorithms (K-means, Affinity Propagation and $k_T$-jet) we obtain
efficiencies comparable to those of their classical counterparts. Furthermore,
in the first two algorithms, an exponential speed up in dimensionality and data
length can be achieved when applying the distance or the maximum search
algorithm. In the $k_T$ algorithm, a quantum version of the same order as
FastJet is achieved.
Related papers
- 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) - Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture [1.072460284847973]
We show that Variational Quantum Algorithms can be a viable alternative to classical algorithms in the near future.
In particular, we compare the performances, in terms of success probability, of two algorithms, i.e., Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE)
The simulation experiments, performed for a set of simple problems, %CM230124 that involve a Cloud and two Edge nodes, show that the VQE algorithm ensures better performances when it is equipped with appropriate circuit textitansatzes that are able to restrict the search space
arXiv Detail & Related papers (2024-01-25T17:37:40Z) - Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - A quantum advantage over classical for local max cut [48.02822142773719]
Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs.
Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
arXiv Detail & Related papers (2023-04-17T16:42:05Z) - 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) - Variational Quantum and Quantum-Inspired Clustering [0.0]
We present a quantum algorithm for clustering data based on a variational quantum circuit.
The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices.
arXiv Detail & Related papers (2022-06-20T17:02:19Z) - 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 clustering and jet reconstruction at the LHC [0.0]
Jet clustering at the CERN's Large Hadron Collider is computationally expensive.
We consider two novel quantum algorithms which may speed up the classical jet clustering algorithms.
arXiv Detail & Related papers (2022-04-13T16:27:04Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Quantum K-medians Algorithm Using Parallel Euclidean Distance Estimator [0.0]
This paper proposes an efficient quantum k-medians clustering algorithm using the powerful quantum Euclidean estimator algorithm.
The proposed quantum k-medians algorithm has provided an exponential speed up as compared to the classical version of it.
arXiv Detail & Related papers (2020-12-21T06:38:20Z)
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.