Serialized quantum classifiers decouple the number of parameters from the number of qubits

Quantum machine learning models are usually compared with classical networks that have far more parameters and no restriction on how features are represented. We introduce a serialized classifier that reads four features at a time on a fixed seven-qubit register. Each input position has its own trainable block, and a three-qubit memory, coherent or measured, links the positions, so the parameter count grows with the input, not with the register. These parameters remain trainable: from a near-identity start, local-cost gradients do not decay as the register grows from five to eleven qubits. On MNIST, accuracy generally rises with the parameter count. On twelve further datasets the circuit is within 2.5 points of a same-size MLP on eight, ahead on two and behind on two with many classes, and beats amplitude encoding on eleven. Sharing one block across positions, removing entanglement or training only the readout lowers accuracy. No quantum advantage is claimed.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-08
DOI
https://doi.org/10.5281/zenodo.24059443
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Serialized quantum classifiers decouple the number of parameters from the number of qubits

Ammar Daskin
1 links
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Serialized quantum classifiers decouple the number of parameters from the number of qubits

Ammar Daskin
preprint en

Abstract

Quantum machine learning models are usually compared with classical networks that have far more parameters and no restriction on how features are represented. We introduce a serialized classifier that reads four features at a time on a fixed seven-qubit register. Each input position has its own trainable block, and a three-qubit memory, coherent or measured, links the positions, so the parameter count grows with the input, not with the register. These parameters remain trainable: from a near-identity start, local-cost gradients do not decay as the register grows from five to eleven qubits. On MNIST, accuracy generally rises with the parameter count. On twelve further datasets the circuit is within 2.5 points of a same-size MLP on eight, ahead on two and behind on two with many classes, and beats amplitude encoding on eleven. Sharing one block across positions, removing entanglement or training only the readout lowers accuracy. No quantum advantage is claimed.

Zenodo (CERN European Organization for Nuclear Research)
Istanbul Medeniyet University (TR)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon