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-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.

[1]  Tony R. Martinez,et al.  A Quantum Associative Memory Based on Grover's Algorithm , 1999, ICANNGA.

[2]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[3]  Jehoshua Bruck,et al.  On the number of spurious memories in the Hopfield model , 1990, IEEE Trans. Inf. Theory.

[4]  Lov K. Grover Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[5]  P. Pani,et al.  GEMS: Underwater spectrometer for long-term radioactivity measurements , 2011 .

[6]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[7]  T. Martinez,et al.  Quantum associative memory with exponential capacity , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[8]  Tony R. Martinez,et al.  Quantum associative memory , 2000, Inf. Sci..

[9]  N. Turini,et al.  The AMchip: a VLSI associative memory for track finding , 1992 .

[10]  Dan Ventura,et al.  Quantum associative memory with distributed queries , 2000, Inf. Sci..

[11]  K. Perez Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment , 2014 .

[12]  C. Trugenberger Probabilistic quantum memories. , 2000, Physical review letters.

[13]  Christof Zalka GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.

[14]  Markus Grassl,et al.  Grover's quantum search algorithm for an arbitrary initial amplitude distribution , 1999 .

[15]  N. Turini,et al.  The AMchip: a full-custom CMOS VLSI associative memory for pattern recognition , 1991, Conference Record of the 1991 IEEE Nuclear Science Symposium and Medical Imaging Conference.

[16]  Isaac L. Chuang,et al.  Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .

[17]  Lov K. Grover Beyond Factorization and Search , 1998, Science.

[18]  Andris Ambainis,et al.  Dense quantum coding and a lower bound for 1-way quantum automata , 1998, STOC '99.

[19]  Markus Grassl,et al.  Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.