One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization

• URL: http://arxiv.org/abs/2608.05240v1
• Date: Wed, 05 Aug 2026 14:04:50 GMT
• Title: One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization
• Abstract summary: One-bit post-training quantization represents each weight using only its sign, requiring all deployment contexts to share the same binary weight matrix.<n>We study this shared-sign constraint and introduce Quantum Random Access Quantization (QRAQ)<n>This framework encodes context-dependent signs in a quantum random-access code and retrieves them via context-matched Pauli measurements.
• Score: 7.09016563801433
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: One-bit post-training quantization represents each weight using only its sign, requiring all deployment contexts to share the same binary weight matrix even when their activation statistics favor different sign patterns. We study this shared-sign constraint and introduce Quantum Random Access Quantization (QRAQ). This framework encodes context-dependent signs in a quantum random-access code and retrieves them via context-matched Pauli measurements. Under an explicit fresh-copy logical readout model, QRAQ produces an unbiased, context-specific binary surrogate with a tractable shot-noise penalty. We prove a row-wise separation from shared-sign one-bit PTQ with signed per-row scales. When the optimal context-wise signs are incompatible, QRAQ achieves a strictly lower ideal reconstruction risk. We also derive finite-shot and calibrated-noise conditions under which this separation is retained. Fixed-readout quantum schemes are classically simulable, so the relevant resource in this model is measurement incompatibility rather than quantization alone. Finally, we characterize the role of scale granularity, provide finite-sample certificates, and evaluate the predicted ideal, finite-shot, noisy, and multi-context regimes in simulator experiments.

Related papers

• Quantum Incremental Learning with Mixed State Prototypes [53.319426778720434]
  We introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes.<n>Our model achieves high-dimensional feature concentration using a minimal number of qubits.
  arXiv  Detail & Related papers  (2026-08-11T04:22:42Z)
• A Unified Framework for Quantized and Continuous Strong Lottery Tickets [3.772827533440353]
  We provide an analysis of the Random Subset Sum Problem (RSSP) in the discrete setting, and use it to derive tight SLTH guarantees in the quantized case.<n>Our analysis obtains tight bounds on the failure probability of finding a strong lottery ticket in the quantized regime, providing an exponential improvement over previous results.
  arXiv  Detail & Related papers  (2026-07-04T13:00:39Z)
• LFQ: Logit-aware Final-block Quantization for Boosting the Generation Quality of Low-Bit Quantized LLMs [52.1276403258812]
  We introduce Logit-aware Final-block Quantization (LFQ), a simple yet effective enhancement to block-wise PTQ.<n>LFQ consistently improves the accuracy of complex generation tasks over state-of-the-art block-wise PTQ.
  arXiv  Detail & Related papers  (2026-05-28T11:02:23Z)
• Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains [0.0]
  We present a new end-to-end framework requiring only one ancilla qubit in the working register.<n>The key technical ingredient is a selective phase compiler circuit using one ancilla qubit.<n>As a direct application, we apply the quantum algorithm to prepare a Gibbs QSAMPLE and obtain a rigorous complexity analysis.
  arXiv  Detail & Related papers  (2026-05-22T09:55:28Z)
• Quantum Injection Pathways for Implicit Graph Neural Networks [0.8826339811274068]
  Deep Equilibrium Models replace a stack of explicit layers with a single operator whose fixed point defines the output.<n>textitIndependent injection computes the quantum signal once per graph and forward fixed-point solve, and holds it fixed throughout the solve.<n>textitState-dependent injection instead recomputes the signal at every solver step and applies it to the current iteration.<n>textitBackbone-dependent injection likewise recomputes at every but applies the signal to the classical backbone's output evaluated at the current iteration.
  arXiv  Detail & Related papers  (2026-05-09T23:51:46Z)
• Iterative Optimization with Partial Convergence Guarantees on Neutral Atom Quantum Computers [0.0]
  Lp-Quts is a hybrid quantum-classical framework that integrates an NAQC sampler into a classical cutting-plane algorithm.<n>We show how Lp-Quts can be effectively embedded within classical optimization frameworks to deliver near-optimal solutions with reduced quantum resources.
  arXiv  Detail & Related papers  (2026-03-30T19:12:21Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Non-Unitary Quantum Machine Learning [0.0]
  We introduce several probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning. We show that residual connections between layers of a variational ansatz can prevent barren plateaus in models which would otherwise contain them. We also demonstrate a novel rotationally invariant encoding for point cloud data via Schur-Weyl duality.
  arXiv  Detail & Related papers  (2024-05-27T17:42:02Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Secure and robust randomness with sequential quantum measurements [0.0]
  We prove a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users.<n>Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise.<n>This study advances understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
  arXiv  Detail & Related papers  (2023-09-21T17:50:29Z)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)

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.