arXiv:2611.00885
Where Does a Variational Quantum Classifier Lose Accuracy? Angle Encoding, Readout and the Fidelity-Kernel Reference in Cyberattack Detection
Angelos Thomos, Theodore Andronikos
Abstract
When a variational quantum classifier performs poorly at detecting network attacks, it is hard to tell which part is to blame: the encoding, the trained circuit or the readout, which turns measurements into a class. In this work, we build upon a recent amplitude-encoded classifier, and we try to separate their contributions to the NSL-KDD benchmark in noiseless simulation. We compare angle and amplitude encoding, vary one component at a time, and measure each circuit against a classical yardstick: a support-vector machine on the encoded states, whose accuracy estimates what a well-trained circuit can reach. Most of the shortfall lies in the readout. Reading one qubit, or the parity of all qubits, leaves several percentage points unused, while a readout trained together with the circuit recovers most of them from the same measurements. This also explains why some classifiers stop improving as further layers are added. The encodings suit different needs. Angle encoding gives the more accurate detector on traffic like the training data and, from eight features up, shallower circuits; amplitude encoding needs far fewer qubits and catches more attacks of types never seen in training. Finally, we report that classical models, given the same inputs, are about as accurate as the best circuits, thus, registering no quantum advantage.
AI Summary
The paper asks whether encoding, variational training, or measurement readout limits quantum-classifier accuracy in network-attack detection. It compares amplitude and angle encodings on NSL-KDD using exact noiseless simulations, varying readout and depth, with matched circuit-parameter counts for 4, 8, and 16 principal components. A fidelity-kernel SVM provides an empirical reference for linear models on the encoded density matrices; this reference is not a rigorous test-accuracy upper bound. For the four-qubit amplitude-encoded baseline, replacing single-qubit readout with a co-trained linear head raises internal accuracy from 85.6% to 94.8%, versus 97.0% for the reference SVM. In matched comparisons, global parity falls 2.6–7.4 percentage points below the corresponding reference; co-trained heads recover most of this gap using observables obtainable from the same computational-basis samples. An eight-parameter circuit with a trained head reaches 91.7%, versus 88.2% for a 72-parameter circuit with single-qubit readout. Angle encoding improves in-distribution accuracy by 1.6–4.5 points, while amplitude encoding recalls 55–61% of previously unseen attack records versus 30–45% for angle encoding. Classical kernel references exhibit the same reversal, and no quantum advantage is observed. Limitations include one legacy binary-classification benchmark, five seeds except only one for the 16-qubit angle circuit, one angle bandwidth, no device-noise simulation, and finite-shot testing only at inference. The matched comparison also changes qubit count, state-space dimension, and readout-feature count, so it does not isolate encoding from these consequences.
Error found: The final paragraph incorrectly describes fidelity-kernel SVM test accuracy as an estimated upper bound, although it is a regularization-dependent empirical reference rather than a bound on circuit test accuracy. The abstract's finite-shot robustness statement is broader than the evidence, which tests only seed-0 angle-encoded circuits with inference-time sampling.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.