Search arXiv⌕ Search

arXiv · 2610.16153

Architectural Robustness to Label Noise Using Variational Quantum Circuits for Medical Image Classification

Abstract

Label noise is prevalent in medical image datasets, arising from observer disagreement and ambiguous cases and deep networks memorize the mislabeled examples at the cost of generalization. Current solutions such as loss correction and sample selection add training complexity and generally assume the noise rate is known or estimable. This paper investigates whether robustness can be obtained architecturally, by routing a frozen backbone's features through a low-dimensional bounded bottleneck and classifying them with a head whose function class is intrinsically smooth. Variational quantum circuits with angle encoding and a linear cost function realise exactly such a class. Their use in medical imaging, however, has been limited by the small number of qubits available on noisy intermediate-scale devices, which typically restricts inputs to low-resolution grayscale images. We therefore couple a frozen ImageNet-pretrained ViT-B/16 backbone to a trainable linear bottleneck and an eight-qubit variational quantum circuit, allowing 224x224 RGB inputs to be processed. Under clean labels the model leads five of six MedMNISTv2 benchmarks against published hybrid quantum-classical models, with margins of 17.4 and 15.7 percentages on BloodMNIST and PathMNIST. The advantage emerges under corrupted labels. At symmetric noise rates of 30% and 50% the model outperforms many published quantum and noise-robust classical baselines on all six datasets without any explicit noise-handling component. Against a control that shares the backbone, bottleneck, parameter count and optimizer and replaces only the circuit with a ReLU layer, it retains 89.75% accuracy on PathMNIST at 50% noise where the control falls to 78.96%. Direct measurement of training dynamics shows that this advantage is not an inability to fit corrupted labels, which the circuit retains, but greater stability under prolonged training on them.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yasoda Lasiru Ariyarathna Epa, Yaseema Rusiru Ariyarathna Epa, Sandaru Liyanaarachchi, Kavindu Jayathissa, Kalana G. Abeywardena, Kithmin Wickremasinghe, Theshani Nuradha Piliththuwasam Gallage, Chamira U. S. Edussooriya. 2026-10-12. Architectural Robustness to Label Noise Using Variational Quantum Circuits for Medical Image Classification. https://arxiv.org/abs/2610.16153

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

All you need is Trotter

The work here enables a cost scaling of $\tilde{O}\left( \frac{T ^{1+o(1)}\,{\rm log}^2 (1/ε)}{\varepsilon}\right)$ and maximum depth $\tilde{O}\left( \frac{T^{1+o(1)}\,{\rm log} (1/ε)}{\varepsilon}\right)$ for estimating observables after some Hamiltonian evolution $e^{i H T}$ using no extra block-encoding qubits, where $ε$ is the algorithmic error of the target Hamiltonian evolution and $\varepsilon$ is the statistical error from the observable estimation. Throughout, $\tilde{O}$ suppresses factors that are doubly logarithmic in $1/ε$ (i.e. ${\rm polyloglog}(1/ε)$), which are subdominant to the displayed ${\rm polylog}(1/ε)$ factors. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used. This is an improvement over similar work using interpolation methods which have a superlinear scaling of the form $5^p T^{1+1/p}$, where $p$ is the order of the product formula used and an improvement on required qubits over Quantum Signal Processing methods while maintaining scaling with ${\rm polylog}{1/ε}$. This is accomplished through an optimized and variable (with $T$) order $p$. The slightly better $\log^2(1/ε)$ compared to $\log^3(1/ε)$ comes from the use of cardinal sine interpolation compared to other methods using Chebyshev interpolation and product formulas. The work presented here also provides an alternative to Quantum Signal Processing techniques to calculate observables or amplitudes after a fractional query evolution with a cost $O(T\log{1/ε})$ through this cardinal sine interpolation.

quant-ph↗

Relativistic generalization of Feynman's path integral on the basis of extended Lagrangians

In the extended Lagrange formalism of classical point dynamics, the system's dynamics is parametrized along a system evolution parameter $s$, and the physical time $t$ is treated as a \emph{dependent} variable $t(s)$ on equal footing with all other configuration space variables $q^{i}(s)$. In the action principle, the conventional classical action $L dt$ is then replaced by the generalized action $L_{e}ds$. A direct reparametrization of the conventional action yields an extended Lagrangian that is homogeneous of degree one in the velocities. A regular extended Lagrangian that is not homogeneous of degree one can also reproduce the conventional dynamics on a suitably selected invariant hypersurface. With this representation, the physical motion takes place on a hypersurface within a symplectic extended phase space of even dimension. The formal similarity of conventional and extended Lagrange formalisms provides a direct connection with the proper-time path integral approach to relativistic quantum physics. To provide an example, the non-homogeneous extended Lagrangian $L_{e}$ of a classical relativistic spinless point particle in an external electromagnetic field will be presented. This extended Lagrangian is a quadratic function in the velocities, and its selected zero-energy hypersurface is the classical mass shell. With this $L_{e}$, the generalized path integral first yields an evolution equation in $s$. Imposing the corresponding quantum mass-shell condition then yields the Klein-Gordon equation as the physical wave equation. This establishes the relation between the classical extended Lagrangian description and proper-time quantization for a charged spin-zero particle.

quant-ph↗

Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography

This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs derived from the Navascués-Pironio-Acin (NPA) hierarchy, our tool enables efficient computation of entropy bounds based solely on observed statistics, assuming the validity of quantum mechanics. The method's computational efficiency is ensured by its reliance on projective operators within the non-commutative polynomial optimization problem. The method facilitates provable bounds for extractable randomness in noisy scenarios and aligns with modern entropy accumulation theorems. Consequently, the framework offers an adaptable tool for practical quantum cryptographic protocols, expanding secure communication possibilities in untrusted environments.

quant-ph↗