Pith. sign in

REVIEW 2 cited by

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 1911.01117 v1 pith:3EU44YTX submitted 2019-11-04 quant-ph cs.ET

Quantum Algorithms for Deep Convolutional Neural Networks

classification quant-ph cs.ET
keywords quantumdeepnetworksapplicationsconvolutionallearningneuralqcnn
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum computing is a new computational paradigm that promises applications in several fields, including machine learning. In the last decade, deep learning, and in particular Convolutional neural networks (CNN), have become essential for applications in signal processing and image recognition. Quantum deep learning, however remains a challenging problem, as it is difficult to implement non linearities with quantum unitaries. In this paper we propose a quantum algorithm for applying and training deep convolutional neural networks with a potential speedup. The quantum CNN (QCNN) is a shallow circuit, reproducing completely the classical CNN, by allowing non linearities and pooling operations. The QCNN is particularly interesting for deep networks and could allow new frontiers in image recognition, by using more or larger convolution kernels, larger or deeper inputs. We introduce a new quantum tomography algorithm with $\ell_{\infty}$ norm guarantees, and new applications of probabilistic sampling in the context of information processing. We also present numerical simulations for the classification of the MNIST dataset to provide practical evidence for the efficiency of the QCNN.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy

    quant-ph 2026-06 unverdicted novelty 6.0

    The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulat...

  2. Design and Benchmarking of a Quantum Photonic Chip

    quant-ph 2026-07 conditional novelty 4.0

    A room-temperature CMOS-compatible photonic chip encoding three qubits in single-photon degrees of freedom demonstrates competitive accuracy on ML tasks and superior noise tolerance compared to a superconducting processor.