QUANT-PHLGMLAug 22, 2024

Quantum Convolutional Neural Networks are Effectively Classically Simulable

arXiv:2408.12739v284 citationsh-index: 46
Originality Incremental advance
AI Analysis

This reveals a critical limitation in quantum machine learning, indicating that current models may only succeed on trivial problems, which is incremental as it challenges existing assumptions.

The paper shows that Quantum Convolutional Neural Networks (QCNNs) are effectively classically simulable because they rely on low-body measurements and are benchmarked on simple datasets, enabling simulation up to 1024 qubits for phases of matter classification.

Quantum Convolutional Neural Networks (QCNNs) are widely regarded as a promising model for Quantum Machine Learning (QML). In this work we tie their heuristic success to two facts. First, that when randomly initialized, they can only operate on the information encoded in low-bodyness measurements of their input states. And second, that they are commonly benchmarked on "locally-easy'' datasets whose states are precisely classifiable by the information encoded in these low-bodyness observables subspace. We further show that the QCNN's action on this subspace can be efficiently classically simulated by a classical algorithm equipped with Pauli shadows on the dataset. Indeed, we present a shadow-based simulation of QCNNs on up-to $1024$ qubits for phases of matter classification. Our results can then be understood as highlighting a deeper symptom of QML: Models could only be showing heuristic success because they are benchmarked on simple problems, for which their action can be classically simulated. This insight points to the fact that non-trivial datasets are a truly necessary ingredient for moving forward with QML. To finish, we discuss how our results can be extrapolated to classically simulate other architectures.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes