Pith. sign in

REVIEW 2 cited by

Quantum Associative Memory in HEP Track Pattern Recognition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.00498 v2 pith:T4SH5NFJ submitted 2019-01-30 hep-ex quant-ph

classification hep-exquant-ph
keywords quantumquamalgorithmsassociativedatamemorypatternpotential
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Algorithms for Jet Clustering

    hep-ph 2019-08 accept novelty 7.0 of 10

    Thrust can be computed in O(N^2) time with a Grover-based quantum algorithm under a sequential data-loading model, and in O(N^2 log N) time classically with sorting, but the quantum advantage is only formal for very r...

  2. Charged particle tracking with quantum annealing-inspired optimization

    quant-ph 2019-08 conditional novelty 6.0 of 10

    A Denby-Peterson style QUBO model, extended with LHC-specific geometry terms, reconstructs simulated HL-LHC tracks via simulated and quantum annealing, demonstrating feasibility but leaving the quantum speedup question open.

Pith tools