Quantum Classifier Slashes Circuit Runs While Beating Baseline Accuracy

Quantum machine learning has long promised a new kind of computation, but the hardware available today is noisy, small, and expensive to run. Every prediction made by a variational quantum classifier requires the quantum circuit to be executed many times, often thousands of shots, simply to estimate an expectation value with enough statistical confidence. A research team at VSB – Technical University of Ostrava in the Czech Republic has now introduced a redesign of the variational quantum classifier that attacks this bottleneck directly. Their unambiguous quantum classifier, described in the journal Quantum Machine Intelligence, combines Hamming distance measurements with classical post-processing to extract more information from fewer circuit runs, and it does so without sacrificing accuracy.

The work, led by Petr Ptáček together with Paulina Lewandowska and Ryszard Kukulski, both of whom contributed equally, addresses one of the most pressing practical constraints in near-term quantum computing. Devices in the so-called NISQ era, a term coined by John Preskill, operate without full quantum error correction. Every circuit execution is subject to noise, queue times on shared hardware are long, and the cost of running a model scales with the number of shots required per prediction. If quantum machine learning is ever to leave the laboratory and compete with classical methods, reducing the number of circuit evaluations is arguably as important as improving raw accuracy.

The core idea behind the new classifier lies in how it reads out answers from the quantum state. Conventional variational quantum classifiers typically measure the expectation value of an observable, often a Pauli operator, on the output state produced by a parameterized ansatz circuit. This expectation value is then thresholded to assign a class label. The problem is statistical: to estimate an expectation value to a given precision, the circuit must be run repeatedly, and the number of repetitions grows quadratically with the desired precision. The Ostrava team instead draws on the concept of unambiguous state discrimination, in which measurements are designed so that outcomes are either conclusive or explicitly inconclusive, never misleading. By measuring in a way that compares computational basis strings through Hamming distance, the classifier obtains richer, more informative samples from each circuit run.

Hamming distance, the number of bit positions in which two binary strings differ, has a precedent in quantum algorithms for classification. Earlier work on quantum k-nearest-neighbor algorithms used Hamming distance as a similarity metric between encoded data points. The new approach folds that metric into a variational framework: the parameterized circuit transforms and encodes data, and the measurement stage compares the resulting bit strings against reference patterns. Classical post-processing then weighs the conclusive outcomes to produce a classification decision. Because each shot carries more decision-relevant information, far fewer shots are needed per prediction, and the ansatz’s expressivity is exploited more effectively rather than being diluted by coarse averaging.

The theoretical backing matters here. The authors substantiate their experimental results with formal evidence supporting why the approach should perform well, rather than merely reporting empirical wins. This kind of grounding is notable in a field where many proposed quantum machine learning methods have been criticized for lacking provable advantages or for suffering from trainability pathologies such as barren plateaus, the flat regions of the training landscape described by McClean and colleagues in 2018. By tying the measurement scheme to information-theoretic principles and to established discrimination theory, the team provides a rationale for both the accuracy gains and the resource savings.

The empirical testbed was a demanding and socially significant one: the Wisconsin Diagnostic Breast Cancer dataset from the UCI Machine Learning Repository, a standard benchmark in medical classification involving distinguishing malignant from benign tumors based on features derived from digitized images of fine needle aspirate samples. The choice is apt for demonstrating practical relevance, since medical decision support is exactly the kind of domain where classification errors carry real costs and where the efficiency of a model matters if it is ever to run on scarce quantum hardware.

The headline numbers are striking. The unambiguous quantum classifier achieved an average accuracy of 90 percent on the breast cancer dataset, an improvement of 6.9 percentage points over the baseline variational quantum classifier. At the same time, it required eight times fewer circuit executions per prediction. That combination, better accuracy and an eightfold reduction in execution cost, is unusual in quantum machine learning, where improvements in one metric frequently come at the expense of the other. The savings compound across training as well: since model training involves evaluating the objective function many times over many optimization steps, cutting shots per evaluation by a factor of eight can dramatically shorten wall-clock training time and reduce access fees on cloud quantum platforms.

Noise robustness is the second major finding. When noise was injected into the simulations to emulate realistic hardware conditions, the accuracy advantage shrank from 6.9 to approximately 3.1 percentage points, but the eightfold reduction in execution cost persisted. The fact that the method degrades gracefully rather than collapsing is crucial. Many quantum algorithms that look compelling in idealized simulations lose their advantage entirely under realistic noise levels. A classifier that retains a meaningful improvement over its baseline while remaining dramatically cheaper to execute is far more plausible as a candidate for deployment on actual quantum processors, where gate errors, decoherence, and readout imperfections are unavoidable facts of life.

The authors implemented and evaluated their method using the PennyLane framework, the widely used open-source library for hybrid quantum-classical computation, and they have made both the code and the data openly available in a public GitHub repository. The optimizations were handled with classical techniques suited to noisy objective functions, including simultaneous perturbation stochastic approximation, an optimizer originally developed by Spall that estimates gradients from very few function evaluations, a natural pairing with a classifier designed to be frugal with circuit runs.

The broader significance of the study lies in what it suggests about where quantum advantage might first materialize in machine learning. Rather than waiting for large fault-tolerant machines, resource-efficient redesigns of existing algorithms could deliver practical value on today’s hardware. Related efforts in the literature have pursued shot optimization, quantum kernel methods, and data re-uploading schemes, and recent theoretical work on single-shot quantum machine learning has explored how few measurements are truly needed. The Ostrava results sit squarely in this emerging conversation, offering a concrete demonstration that smarter measurement and post-processing can unlock both accuracy and efficiency. If follow-up work confirms these gains on physical quantum processors and across additional datasets, the unambiguous classifier could become a template for building quantum machine learning models that are genuinely competitive, not just conceptually interesting. The research also underscores the value of collaboration between quantum algorithm theorists and application domain experts, a combination that will be essential as the field moves from proof-of-concept demonstrations toward tools that practitioners in medicine, materials science, and beyond can actually rely upon.

Subject of Research: A resource-efficient variational quantum classifier using Hamming distance measurements and classical post-processing

Article Title: Resource-efficient variational quantum classifier

Article References: Resource-efficient variational quantum classifier. (n.d.). https://doi.org/10.1007/s42484-026-00439-9

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00439-9

Keywords: quantum machine learning, variational quantum classifier, Hamming distance, unambiguous state discrimination, NISQ era, breast cancer dataset, circuit evaluations, noise robustness, PennyLane, binary classification, variational circuits, resource efficiency