Pith. sign in

REVIEW 1 cited by

Classical versus Quantum: comparing Tensor Network-based Quantum Circuits on LHC data

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 2202.10471 v2 pith:7ZA4J3OE submitted 2022-02-21 quant-ph cs.LGhep-exhep-ph

classification quant-phcs.LGhep-exhep-ph
keywords quantumclassicaldatacircuitshighlytensoransatzdimensionality
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Tensor Networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This study provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of Machine Learning on highly complex, simulated LHC data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase-space from the data. We offer our results using three main TN ansatz: Tree Tensor Networks, Matrix Product States, and Multi-scale Entanglement Renormalisation Ansatz.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. On the Effectiveness of Random Weights in Graph Neural Networks

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A GNN with on-the-fly random diagonal weights and a frozen pretrained embedding matches end-to-end trained GNNs on several graph benchmarks while reducing training time and memory.

Pith tools