OQMD: Single-Qubit Rotation Control Improves Low-CNOT Multiclass Quantum Classification

• URL: http://arxiv.org/abs/2606.14088v1
• Date: Fri, 12 Jun 2026 04:05:48 GMT
• Title: OQMD: Single-Qubit Rotation Control Improves Low-CNOT Multiclass Quantum Classification
• Abstract summary: This work studies Optimal Quantum Measurement Decoding (OQMD)<n>OQMD: optimizing how quantum outcomes are mapped to classical labels by training a readout layer before measurement.<n>Experiments use trainable triple single-qubit rotations as one concrete, hardware-native realization of OQMD.
• Score: 4.669017653337737
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Near-term variational classifiers incur substantial error and latency from two-qubit gates, yet practitioners often assume that additional entangling depth is the default route to higher accuracy. This work studies Optimal Quantum Measurement Decoding (OQMD): optimizing how quantum outcomes are mapped to classical labels by training a readout layer before measurement, jointly with the variational circuit, without adding CNOTs. Experiments use trainable triple single-qubit rotations as one concrete, hardware-native realization of OQMD; other single-qubit parametrizations fit the same classical outer loop. On the Iris benchmark with a 30-point stratified test split, the best observed 0-CNOT configuration with OQMD reaches 83.33\% accuracy, with a 96\% at 9 CNOTs, exceeding the best 18-CNOT controls (56.67\%) and the best 18-CNOT configuration with OQMD (66.67\%) under a common protocol. A six-point CNOT-depth series from 0 to 18 (fixed optimizer, iteration budget, random-seed count, and ZXZ readout) shows that the highest raw scores need not occur at the largest template, so aggregate complexity is not summarized by CNOT count alone. Because run-level accuracies are discrete and non-Gaussian, we emphasize best-observed scores and, where a global comparison of pooled runs is required, Mann--Whitney $U$ tests rather than parametric tests on means. Across architectures, OQMD shows statistically consistent but magnitude-dependent gains: large peak lifts on minimal circuits coexist with a small pooled mean shift on complex 18-CNOT runs ($p\approx 0.03$) that is not ``universal'' in the sense of uniformly large practical effects.%

Related papers

• Parameter-Efficient Quantum NLP for Paraphrase Detection: Performance, Robustness, and Entanglement [0.05999777817331314]
  We evaluate a 10-qubit hybrid quantum-classical variational circuit for paraphrase detection.<n>On QQP the circuit achieves 75.53% +/- 0.75% accuracy.<n>On MRPC the optimal 2-layer variant reaches 92% of BERT-base accuracy at 54,000 lower parameter cost.<n>These results constitute the first systematic parameter-matched multi-benchmark empirical validation of hybrid variational circuits for NLP.
  arXiv  Detail & Related papers  (2026-09-13T14:06:49Z)
• On the Design of Qwen3.8-Next Architecture: Evaluation, Efficiency, and Training Stability [57.03393882933515]
  We describe the architecture and ablations of Qwen3.8-Flash-Next, a sparse mixture-of-experts model with 125B parameters, 6B activated per token, and 51B parameters of n-gram embedding tables held off the accelerator.<n>On fourteen pre-training benchmarks the model leads the 397B-A17B predecessor on eight and trails it on the rest by at most 2.6 points, at 1/3 the activated parameters, 1/3 the training tokens, and roughly 1/9 the training FLOPs.
  arXiv  Detail & Related papers  (2026-08-31T06:35:07Z)
• Quantum King-Ring Domination in Chess: A QAOA Approach [2.7474031534471384]
  Quantum King-Ring Domination (QKRD) is a NISQ-scale benchmark derived from chess tactical positions.<n>We systematically evaluate QAOA design choices and find that constraint-preserving mixers converge approximately 13 steps faster than standard mixers.<n>Intrinsic validation shows QAOA outperforms greedys by 12.6% and random selection by 80.1%.
  arXiv  Detail & Related papers  (2026-01-01T11:59:40Z)
• DeepPrune: Parallel Scaling without Inter-trace Redundancy [53.62015294143274]
  Over 80% of parallel reasoning traces yield identical final answers, representing substantial wasted computation.<n>We propose DeepPrune, a novel framework that enables efficient parallel scaling through dynamic pruning.<n>Our work establishes a new standard for efficient parallel reasoning, making high-performance reasoning more efficient.
  arXiv  Detail & Related papers  (2025-10-09T17:24:54Z)
• CNOT-Optimal Clifford Synthesis as SAT [0.0]
  Minimization of noisy gates, like 2-qubit CNOT gates, is crucial for practical computing.<n>We propose an exhaustive search only on Clifford circuits in a certain normal form to guarantee CNOT count optimality.<n>In experiments, our encodings significantly outperform existing SAT approaches on random Clifford circuits.
  arXiv  Detail & Related papers  (2025-04-01T10:35:58Z)
• ParetoQ: Improving Scaling Laws in Extremely Low-bit LLM Quantization [73.60493264901359]
  We present a unified framework for rigorous comparisons across 1-bit, 1.58-bit, 2-bit, 3-bit, and 4-bit quantization settings.<n>We show that ternary, 2-bit, and 3-bit quantization maintains comparable performance in the size-accuracy trade-off.<n>Considering hardware constraints, 2-bit quantization offers promising potential for memory reduction and speedup.
  arXiv  Detail & Related papers  (2025-02-04T18:59:26Z)
• COMQ: A Backpropagation-Free Algorithm for Post-Training Quantization [8.214857267270807]
  Post-training quantization (PTQ) has emerged as a practical approach to compress large neural networks. We propose an innovative PTQ algorithm termed COMQ, which sequentially conducts coordinate-wise minimization of the layer-wise reconstruction errors. COMQ achieves remarkable results in quantizing 4-bit Vision Transformers, with a negligible loss of less than 1% in Top-1 accuracy.
  arXiv  Detail & Related papers  (2024-03-11T20:04:03Z)
• Quantum State Preparation Using an Exact CNOT Synthesis Formulation [8.078625517374967]
  Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation. We propose an effective state preparation algorithm using an exact CNOT synthesis formulation.
  arXiv  Detail & Related papers  (2024-01-02T03:37:00Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
  We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
  arXiv  Detail & Related papers  (2021-06-22T11:07:38Z)
• HAWQV3: Dyadic Neural Network Quantization [73.11579145354801]
  Current low-precision quantization algorithms often have the hidden cost of conversion back and forth from floating point to quantized integer values. We present HAWQV3, a novel mixed-precision integer-only quantization framework.
  arXiv  Detail & Related papers  (2020-11-20T23:51:43Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.