Quantum Associative Memory in Hep Track Pattern Recognition

We have entered the Noisy Intermediate-Scale Quantum Era. A plethora of quantum processor prototypes allow evaluation of potential of the Quantum Computing paradigm in applications to pressing computational problems of the future. Growing data input rates and detector resolution foreseen in High-Ene...

Full description

Saved in:
Bibliographic Details
Published in:EPJ Web of conferences 2019-01, Vol.214, p.1012
Main Authors: Shapoval, Illya, Calafiura, Paolo
Format: Article
Language:English
Subjects:
Algorithms
Associative memory
Complexity
Large Hadron Collider
MATHEMATICS AND COMPUTING
Microprocessors
Pattern recognition
Prototypes
Quantum computing
Storage capacity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We have entered the Noisy Intermediate-Scale Quantum Era. A plethora of quantum processor prototypes allow evaluation of potential of the Quantum Computing paradigm in applications to pressing computational problems of the future. Growing data input rates and detector resolution foreseen in High-Energy LHC (2030s) experiments expose the often high time and/or space complexity of classical algorithms. Quantum algorithms can potentially become the lower-complexity alternatives in such cases. In this work we discuss the potential of Quantum Associative Memory (QuAM) in the context of LHC data triggering. We examine the practical limits of storage capacity, as well as store and recall errorless efficiency, from the viewpoints of the state-of-the-art IBM quantum processors and LHC real-time charged track pattern recognition requirements. We present a software prototype implementation of the QuAM protocols and analyze the topological limitations for porting the simplest QuAM instances to the public IBM 5Q and 14Q cloud-based superconducting chips.
ISSN:2100-014X
2101-6275
2100-014X
DOI:10.1051/epjconf/201921401012