Leveraging Quantum Annealer to identify an Event-topology at High Energy Colliders

• URL: http://arxiv.org/abs/2111.07806v1
• Date: Mon, 15 Nov 2021 14:42:05 GMT
• Title: Leveraging Quantum Annealer to identify an Event-topology at High Energy Colliders
• Authors: Minho Kim, Pyungwon Ko, Jae-hyeon Park, Myeonghun Park
• Abstract summary: We propose a simple and well motivated method with a quantum annealer to identify an event-topology. We show that a computing complexity can be reduced significantly to the order of the order of particles.
• Score: 3.39322931607753
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With increasing energy and luminosity available at the Large Hadron collider (LHC), we get a chance to take a pure bottom-up approach solely based on data. This will extend the scope of our understanding about Nature without relying on theoretical prejudices. The required computing resource, however, will increase exponentially with data size and complexities of events if one uses algorithms based on a classical computer. In this letter we propose a simple and well motivated method with a quantum annealer to identify an event-topology, a diagram to describe the history of particles produced at the LHC. We show that a computing complexity can be reduced significantly to the order of polynomials which enables us to decode the "Big" data in a very clear and efficient way. Our method achieves significant improvements in finding a true event-topology, more than by a factor of two compared to a conventional method.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
  We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex. Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
  arXiv  Detail & Related papers  (2024-04-23T18:00:17Z)
• The Computational Complexity of Concise Hypersphere Classification [49.57441416941195]
  This paper is the first complexity-theoretic study of the hypersphere classification problem for binary data. We use the fine-grained parameterized complexity paradigm to analyze the impact of structural properties that may be present in the input data.
  arXiv  Detail & Related papers  (2023-12-12T09:33:03Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Geometrical causality: casting Feynman integrals into quantum algorithms [0.0]
  We discuss efficient strategies based on the Loop-Tree Duality, its manifestly causal representation and the underlying geometrical interpretation. In concrete, we exploit the geometrical causal selection rules to define a Hamiltonian whose ground-state is directly related to the terms contributing to the causal representation. In this way, the problem can be translated into a minimization one and implemented in a quantum computer to search for a potential speed-up.
  arXiv  Detail & Related papers  (2023-05-15T11:22:51Z)
• Approximate complex amplitude encoding algorithm and its application to data classification problems [1.4843656413993453]
  The task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. In this work, we extend AAE so that it can handle a complex-valued data vector.
  arXiv  Detail & Related papers  (2022-11-23T15:46:29Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• A Quantum Graph Neural Network Approach to Particle Track Reconstruction [1.087475836765689]
  We present an improved model with an iterative approach to overcome the low accuracy of the initial oversimplified Tree Network (TTN) model. We aim to leverage the capability of quantum computing to evaluate a very large number of states simultaneously and thus to effectively search a large parameter space.
  arXiv  Detail & Related papers  (2020-07-14T07:25:24Z)
• A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention [96.77554122595578]
  We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference. Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
  arXiv  Detail & Related papers  (2020-06-22T08:35:58Z)

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.