Pith. sign in

REVIEW 1 cited by

Benchmarking Quantum Convolutional Neural Networks for Classification and Data Compression Tasks

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 2411.13468 v1 pith:GLLBOY3S submitted 2024-11-20 quant-ph

Benchmarking Quantum Convolutional Neural Networks for Classification and Data Compression Tasks

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

Quantum Convolutional Neural Networks (QCNNs) have emerged as promising models for quantum machine learning tasks, including classification and data compression. This paper investigates the performance of QCNNs in comparison to the hardware-efficient ansatz (HEA) for classifying the phases of quantum ground states of the transverse field Ising model and the XXZ model. Various system sizes, including 4, 8, and 16 qubits, through simulation were examined. Additionally, QCNN and HEA-based autoencoders were implemented to assess their capabilities in compressing quantum states. The results show that QCNN with RY gates can be trained faster due to fewer trainable parameters while matching the performance of HEAs.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Inherent interpretability provides inherent value in quantum machine learning

    quant-ph 2026-07 conditional novelty 4.0

    Quantum machine learning models can be valuable for their inherent mathematical interpretability, and quantum Fourier models offer a bottom-up route to Gaussian-process kernel design that random Fourier features do no...