Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.30908

Fine-Tuning Low-Bit Models with Gradient in Quantized Code Space

Shiguang Wu, Zhouchen Lin, Quanming Yao

Published Aug 31, 2026• 1 citation
arXivHTMLPDF

Abstract

Fine-tuning Low-bit models aims to adapt a quantized model while keeping the final deployed checkpoint in the same low-bit form. This setting is practically important as it reduces memory and inference cost for storage and deployment. Under this constraint, adaptation becomes an optimization problem over quantization codes and scales. Existing continuous low-bit training is efficient, but it can be distorted by straight through estimation error or by post-quantize gap; discrete search is deployment-faithful, but it is often too inefficient under a finite training budget. We propose code surrogate gradient as the first order signal in deployable code space to acceleate optimization, and performing guided search to preserve deployment faithfulness. Experiments across arithmetic reasoning, instruction following, and structured language understanding show that GradCodes consistently improves fine-tuning low-bit models across different quantization datatypes. Code is provided at https://github.com/ovo67/GradCodes.

DOI
10.48550/arxiv.2608.30908

Related papers

Discretization-Aware Fine-Tuning for Quantum Machine Learning with Chemical Foundation Models

Shunji Matsuura, Sonika Johri

A key challenge in practical quantum machine learning (QML), particularly for discriminative tasks such as classification, is the limited capacity of near-term quantum devices to encode high-dimensional classical data into small quantum registers. In optimized basis-encoded (bit-bit) settings, this constraint leads to cross-class collisions, where samples with different labels are mapped to the same discrete bit-string and thus become indistinguishable to any downstream model. In this work, we investigate how data representation affects QML performance under such severe information bottlenecks. We introduce discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization. DAFT reduces collision probability through a differentiable soft collision loss. We evaluate both quantum and classical models under a controlled setting in which they receive identical discretized bit-string inputs, isolating the effect of representation from model architecture. On the blood-brain barrier penetration (BBBP) molecular property prediction benchmark using ChemBERTa-77M, DAFT reduces collision counts by several orders of magnitude and improves quantum classification accuracy by more than 12 percentage points compared to a frozen backbone. Importantly, without DAFT, classical models outperform QML under the same input constraints. With DAFT, however, this comparison reverses at higher qubit counts. At 10 qubits, the quantum model surpasses a matched classical baseline trained on identical bit-strings (0.883 vs. 0.855, $p = 0.026$). These results show that, in information-constrained regimes, achieving a quantum advantage critically depends on aligning continuous representations with discrete quantum encodings.

quant-pharXiv:2609.03220•Sep 4, 2026•0 citations

E8-QAT: Efficient 2-Bit Quantization-Aware Training with Implicit Lattice Codebooks

Xinyu Lei, Hong Huang, Jiebin Zhang +6 more

Low-bit quantization reduces the memory footprint of large language models, but preserving accuracy with efficient training remains challenging. Scalar quantization encodes weights independently, while explicit-codebook vector quantization introduces costly search during training. We propose E8-QAT, a 2-bit quantization-aware training framework that uses the $E_8$ lattice as an implicit eight-dimensional codebook. It jointly quantizes weight groups through arithmetic projection without storing or searching an explicit codebook during the training forward pass. A 2-bit core encoding and sparse extension preserve the selected lattice points exactly, adding less than 0.1\% to core index storage. On Qwen3.6-35B-A3B, E8-QAT matches the performance of the full-precision model in terms of the average score across the four tasks. E8-QAT improves over the state-of-the-art baseline by 2.03\% on IFEval and by 1.51\% on LiveCodeBench, under the same data, schedule, and bit width. The 2-bit representation reduces peak memory by 80\% and supports a $4\times$ larger batch. At each representation's largest feasible batch, E8-QAT reaches $1.97\times$ the decoding throughput of BF16.

arXiv:2610.27699•Oct 20, 2026•1 citation

PEFT Fine-Tuning with 1.58-Bit Quantization for a Quantum Computing Research Agent Chatbot: Architecture, Mathematical Foundations, and Practical Implementation

Rasikannan.L Rasikannan.L, Mohamed Israk.B Mohamed Israk.B, Vijay.K Vijay.K +2 more

Quantum computing represents one of the most technically dense frontiers in modern science, with specialized vocabulary spanning quantum gates, superposition, entanglement, variational quantum algorithms, and error-correction codes. Providing accurate, real-time research-grade assistance in this domain requires an LLM that is both highly capable and deployable on resource-constrained hardware. This paper presents the design and deployment of a Quantum Computing Research Agent Chatbot powered by PEFT fine-tuning of a 1.58-bit quantized LLM (BitNet b1.58). We extend the mathematical frameworks of Low-Rank Adaptation (LoRA), Adapter Layers, and Prefix Tuning to the quantum-domain fine-tuning context, incorporating a bespoke quantum-terminology corpus and a Retrieval-Augmented Generation (RAG) layer backed by a curated quantum literature index. We derive the rank–accuracy trade-off in the context of quantum NLP tasks, show that LoRA at rank r = 16 achieves an F1 score of 88.7 on quantum question-answering benchmarks while using only 0.13% of full model parameters, and demonstrate end-to-end inference at 4.2 tokens/second on a single NVIDIA T4 GPU. The proposed agent pipeline integrates with academic literature APIs (arXiv, Semantic Scholar) and supports multi-turn research dialogues, citation generation, and mathematical expression rendering. Keywords— Quantum Computing Chatbot, PEFT, BitNet 1.58-bit Quantization, Low-Rank Adaptation, Research Agent, Retrieval-Augmented Generation, Ternary Weight Matrices, Quantum NLP

International Journal of Creative and Open Research in Engineering and Management•May 1, 2026•0 citations

Boosting Learning for LDPC Codes to Improve the Error-Floor Performance

Hee-Youl Kwak, Dae-Young Yun, Yongjune Kim +2 more

Low-density parity-check (LDPC) codes have been successfully commercialized in communication systems due to their strong error correction capabilities and simple decoding process. However, the error-floor phenomenon of LDPC codes, in which the error rate stops decreasing rapidly at a certain level, presents challenges for achieving extremely low error rates and deploying LDPC codes in scenarios demanding ultra-high reliability. In this work, we propose training methods for neural min-sum (NMS) decoders to eliminate the error-floor effect. First, by leveraging the boosting learning technique of ensemble networks, we divide the decoding network into two neural decoders and train the post decoder to be specialized for uncorrected words that the first decoder fails to correct. Secondly, to address the vanishing gradient issue in training, we introduce a block-wise training schedule that locally trains a block of weights while retraining the preceding block. Lastly, we show that assigning different weights to unsatisfied check nodes effectively lowers the error-floor with a minimal number of weights. By applying these training methods to standard LDPC codes, we achieve the best error-floor performance compared to other decoding methods. The proposed NMS decoder, optimized solely through novel training methods without additional modules, can be integrated into existing LDPC decoders without incurring extra hardware costs. The source code is available at https://github.com/ghy1228/LDPC_Error_Floor .

arXiv:2310.07194•neural information processing systems•Jan 1, 2023•13 citations

Rethinking Practical and Efficient Quantization Calibration for Vision-Language Models

Zhenhao Shang, Haizhao Jing, Guoting Wei +4 more

Post-training quantization (PTQ) is a primary approach for deploying large language models without fine-tuning, and the quantized performance is often strongly affected by the calibration in PTQ. By contrast, in vision-language models (VLMs), substantial differences between visual and text tokens in their activation distributions and sensitivities to quantization error pose significant challenges for effective calibration during PTQ. In this work, we rethink what PTQ calibration should align with in VLMs and propose the Token-level Importance-aware Layer-wise Quantization framework (TLQ). Guided by gradient information, we design a token-level importance integration mechanism for quantization error, and use it to construct a token-level calibration set, enabling a more fine-grained calibration strategy. Furthermore, TLQ introduces a multi-GPU, quantization-exposed layer-wise calibration scheme. This scheme keeps the layer-wise calibration procedure consistent with the true quantized inference path and distributes the complex layer-wise calibration workload across multiple RTX3090 GPUs, thereby reducing reliance on the large memory of A100 GPUs. TLQ is evaluated across two models, three model scales, and two quantization settings, consistently achieving performance improvements across all settings, indicating its strong quantization stability. The code will be released publicly.

arXiv:2602.07899•Feb 8, 2026•2 citations

Quantum Gradient Descent for Deep Learning Problems

Mohtasebi, Seyed Mojtaba

RÉSUMÉ: Cette thèse présente la conception et l'évaluation d'un réseau neuronal adaptatif quantique (QEANN-QGD), qui intègre des paradigmes d'apprentissage quantique et classique pour traiter efficacement du données complexes. Le modèle exploite la descente de gradient quan- tique (QGD) et intègre une Fusion de caractéristiques hybride (HFI), où les caractéristiques améliorées par le quantum sont combinées avec des caractéristiques extraites à l'aide de méthodes classiques. Cette architecture utilise les forces des deux paradigmes, garantissant une performance d'apprentissage évolutive et adaptative. Notre approche été évaluée sur des ensembles de données de référence, ycompris MNIST et CIFAR-10, enutilisant diversestech- niques d'optimisation telles que SGD et Adam comme points de référence. Pour l'ensemble de données MNIST on a atteint une précision de 99,26% avec QEANN-QGD, comparé à 99,84% avec SGD et 99,97% avec Adam, tout en maintenant une faible valeur de perte de 0,0281. Pour CIFAR-10, le modèle atteint une précision de 82,57%, restant compétitif a plu- sieurs modèles classiques, avec une valeur finale de perte de 0,2791. Les couches contribuent considérablement à capturer des motifs non triviaux, reflétés dans les courbes de précision et la convergence progressive de l'énergie de l'état fondamental au cours de l'optimisation. De plus, des techniques de modélisation et de réduction du bruit ont été appliquées pour atténuer les erreurs quantiques et assurer la fiabilité des calculs quantiques. En utilisant les circuits quantiques variationnels et les techniques de décalage de paramètres ont permis une optimisation efficace des caractéristiques quantiques. Les résultats montrent que notre entraînement basé sur la QGD offreune robustesse et une capacité d'extraction de caractéris- tiques comparables aux méthodes classiques conventionnelles. Cela démontre la capacité des systèmes hybrides quantiques-classiques à s'adapter à des ensembles de données diversifiés avec des améliorations en termes de précision, rappel, score F1 et ROC-AUC. Cependant, l'architecture hybride introduit des défis tels qu'une surcharge computationnelle accrue et des besoins en qubits, qui sont discutés en détail. Les travaux futurs se concentreront sur le développement de circuits quantiques plus efficaces pour réduire l'utilisation des qubits et explorer des algorithmes quantiques alternatifs pour l'optimisation afin d'améliorer encore les performances du modèle. Cette étude fait progresser l'apprentissage machine quantique en proposant un réseau neuronal hybride et évolutif qui équilibre avec succès les composant quantiques et classiques, avec des applications potentielles dans des domaines nécessitant une extraction de caractéristiques améliorées et des capacités d'apprentissage adaptatives. ABSTRACT: This thesis presents the design and verification of a Quantum-Enhanced Adaptive Neural Network with quantum gradient descent (QEANN-QGD), which integrates quantum and classical learning paradigms to address complex data patterns effectively. The model lever- ages Quantum Gradient Descent(QGD) and incorporates Hybrid Feature Integration (HFI), where quantum-enhanced features are combined with classical features extracted through traditional methods. This architecture exploits the strengths of both paradigms, ensuring scalable and adaptive learning performance. The proposed approach is verified on bench- mark datasets, including MNIST and CIFAR-10, using various optimization techniquessuch as SGD and Adam as baselines. For the MNIST dataset, we achieve an accuracy of 99.26% with QEANN-QGD, compared to 99.84% with SGD and 99.97% with Adam, while main- taining a low loss value of 0.0281. For CIFAR-10, the model has 82.57% accuracy, remaining competitive with several classical models, with a final loss value of 0.2791. The quantum layers significantly contributes to capturing non-trivial patterns, reflected in the gradual convergence of the ground-state energy during optimization. In addition, noise reduction techniques are applied to mitigate quantum errors and ensure the reliability of the quantum computations. Using variational quantum circuits and parameter-shift techniques enable ef- fective optimization of quantum features. The results show that our QGD-based training provides comparable robustnessand feature extraction capabilities to conventional classical methods. But the classical counterpart showed better accuracy and precision when compared to hyprid model. The hybrid architecture introduces challenges such as increased computa- tional overhead and qubit requirements, which are discussed in detail. Future work will focus on developing more efficient quantum circuit designs to reduce gthe number of qubit used and exploring alternative quantum algorithms for optimization to further enhance model per- formance. This study advances quantum machine learning by proposing a scalable, hybrid neural network that successfully balances quantum and classical components, with potential applications in domains requiring enhanced feature extraction and adaptive learning capa- bilities.

•May 1, 2025•0 citations
Fine-tuning Low-bit models aims to adapt a quantized model while keeping the final deployed checkpoint in the same low-bit form. This setting is practically important as it reduces memory and inference cost for storage and deployment. Under this constraint, adaptation becomes an optimization problem over quantization codes and scales. Existing continuous low-bit training is efficient, but it can be distorted by straight through estimation error or by post-quantize gap; discrete search is deployment-faithful, but it is often too inefficient under a finite training budget. We propose code surrogate gradient as the first order signal in deployable code space to acceleate optimization, and performing guided search to preserve deployment faithfulness. Experiments across arithmetic reasoning, instruction following, and structured language understanding show that GradCodes consistently improves fine-tuning low-bit models across different quantization datatypes. Code is provided at https://github.com/ovo67/GradCodes.
A key challenge in practical quantum machine learning (QML), particularly for discriminative tasks such as classification, is the limited capacity of near-term quantum devices to encode high-dimensional classical data into small quantum registers. In optimized basis-encoded (bit-bit) settings, this constraint leads to cross-class collisions, where samples with different labels are mapped to the same discrete bit-string and thus become indistinguishable to any downstream model. In this work, we investigate how data representation affects QML performance under such severe information bottlenecks. We introduce discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization. DAFT reduces collision probability through a differentiable soft collision loss. We evaluate both quantum and classical models under a controlled setting in which they receive identical discretized bit-string inputs, isolating the effect of representation from model architecture. On the blood-brain barrier penetration (BBBP) molecular property prediction benchmark using ChemBERTa-77M, DAFT reduces collision counts by several orders of magnitude and improves quantum classification accuracy by more than 12 percentage points compared to a frozen backbone. Importantly, without DAFT, classical models outperform QML under the same input constraints. With DAFT, however, this comparison reverses at higher qubit counts. At 10 qubits, the quantum model surpasses a matched classical baseline trained on identical bit-strings (0.883 vs. 0.855, p=0.026p = 0.026p=0.026). These results show that, in information-constrained regimes, achieving a quantum advantage critically depends on aligning continuous representations with discrete quantum encodings.
Low-bit quantization reduces the memory footprint of large language models, but preserving accuracy with efficient training remains challenging. Scalar quantization encodes weights independently, while explicit-codebook vector quantization introduces costly search during training. We propose E8-QAT, a 2-bit quantization-aware training framework that uses the E8E_8E8​ lattice as an implicit eight-dimensional codebook. It jointly quantizes weight groups through arithmetic projection without storing or searching an explicit codebook during the training forward pass. A 2-bit core encoding and sparse extension preserve the selected lattice points exactly, adding less than 0.1\% to core index storage. On Qwen3.6-35B-A3B, E8-QAT matches the performance of the full-precision model in terms of the average score across the four tasks. E8-QAT improves over the state-of-the-art baseline by 2.03\% on IFEval and by 1.51\% on LiveCodeBench, under the same data, schedule, and bit width. The 2-bit representation reduces peak memory by 80\% and supports a 4×4\times4× larger batch. At each representation's largest feasible batch, E8-QAT reaches 1.97×1.97\times1.97× the decoding throughput of BF16.
Quantum computing represents one of the most technically dense frontiers in modern science, with specialized vocabulary spanning quantum gates, superposition, entanglement, variational quantum algorithms, and error-correction codes. Providing accurate, real-time research-grade assistance in this domain requires an LLM that is both highly capable and deployable on resource-constrained hardware. This paper presents the design and deployment of a Quantum Computing Research Agent Chatbot powered by PEFT fine-tuning of a 1.58-bit quantized LLM (BitNet b1.58). We extend the mathematical frameworks of Low-Rank Adaptation (LoRA), Adapter Layers, and Prefix Tuning to the quantum-domain fine-tuning context, incorporating a bespoke quantum-terminology corpus and a Retrieval-Augmented Generation (RAG) layer backed by a curated quantum literature index. We derive the rank–accuracy trade-off in the context of quantum NLP tasks, show that LoRA at rank r = 16 achieves an F1 score of 88.7 on quantum question-answering benchmarks while using only 0.13% of full model parameters, and demonstrate end-to-end inference at 4.2 tokens/second on a single NVIDIA T4 GPU. The proposed agent pipeline integrates with academic literature APIs (arXiv, Semantic Scholar) and supports multi-turn research dialogues, citation generation, and mathematical expression rendering. Keywords— Quantum Computing Chatbot, PEFT, BitNet 1.58-bit Quantization, Low-Rank Adaptation, Research Agent, Retrieval-Augmented Generation, Ternary Weight Matrices, Quantum NLP
Low-density parity-check (LDPC) codes have been successfully commercialized in communication systems due to their strong error correction capabilities and simple decoding process. However, the error-floor phenomenon of LDPC codes, in which the error rate stops decreasing rapidly at a certain level, presents challenges for achieving extremely low error rates and deploying LDPC codes in scenarios demanding ultra-high reliability. In this work, we propose training methods for neural min-sum (NMS) decoders to eliminate the error-floor effect. First, by leveraging the boosting learning technique of ensemble networks, we divide the decoding network into two neural decoders and train the post decoder to be specialized for uncorrected words that the first decoder fails to correct. Secondly, to address the vanishing gradient issue in training, we introduce a block-wise training schedule that locally trains a block of weights while retraining the preceding block. Lastly, we show that assigning different weights to unsatisfied check nodes effectively lowers the error-floor with a minimal number of weights. By applying these training methods to standard LDPC codes, we achieve the best error-floor performance compared to other decoding methods. The proposed NMS decoder, optimized solely through novel training methods without additional modules, can be integrated into existing LDPC decoders without incurring extra hardware costs. The source code is available at https://github.com/ghy1228/LDPC_Error_Floor .
Post-training quantization (PTQ) is a primary approach for deploying large language models without fine-tuning, and the quantized performance is often strongly affected by the calibration in PTQ. By contrast, in vision-language models (VLMs), substantial differences between visual and text tokens in their activation distributions and sensitivities to quantization error pose significant challenges for effective calibration during PTQ. In this work, we rethink what PTQ calibration should align with in VLMs and propose the Token-level Importance-aware Layer-wise Quantization framework (TLQ). Guided by gradient information, we design a token-level importance integration mechanism for quantization error, and use it to construct a token-level calibration set, enabling a more fine-grained calibration strategy. Furthermore, TLQ introduces a multi-GPU, quantization-exposed layer-wise calibration scheme. This scheme keeps the layer-wise calibration procedure consistent with the true quantized inference path and distributes the complex layer-wise calibration workload across multiple RTX3090 GPUs, thereby reducing reliance on the large memory of A100 GPUs. TLQ is evaluated across two models, three model scales, and two quantization settings, consistently achieving performance improvements across all settings, indicating its strong quantization stability. The code will be released publicly.
RÉSUMÉ: Cette thèse présente la conception et l'évaluation d'un réseau neuronal adaptatif quantique (QEANN-QGD), qui intègre des paradigmes d'apprentissage quantique et classique pour traiter efficacement du données complexes. Le modèle exploite la descente de gradient quan- tique (QGD) et intègre une Fusion de caractéristiques hybride (HFI), où les caractéristiques améliorées par le quantum sont combinées avec des caractéristiques extraites à l'aide de méthodes classiques. Cette architecture utilise les forces des deux paradigmes, garantissant une performance d'apprentissage évolutive et adaptative. Notre approche été évaluée sur des ensembles de données de référence, ycompris MNIST et CIFAR-10, enutilisant diversestech- niques d'optimisation telles que SGD et Adam comme points de référence. Pour l'ensemble de données MNIST on a atteint une précision de 99,26% avec QEANN-QGD, comparé à 99,84% avec SGD et 99,97% avec Adam, tout en maintenant une faible valeur de perte de 0,0281. Pour CIFAR-10, le modèle atteint une précision de 82,57%, restant compétitif a plu- sieurs modèles classiques, avec une valeur finale de perte de 0,2791. Les couches contribuent considérablement à capturer des motifs non triviaux, reflétés dans les courbes de précision et la convergence progressive de l'énergie de l'état fondamental au cours de l'optimisation. De plus, des techniques de modélisation et de réduction du bruit ont été appliquées pour atténuer les erreurs quantiques et assurer la fiabilité des calculs quantiques. En utilisant les circuits quantiques variationnels et les techniques de décalage de paramètres ont permis une optimisation efficace des caractéristiques quantiques. Les résultats montrent que notre entraînement basé sur la QGD offreune robustesse et une capacité d'extraction de caractéris- tiques comparables aux méthodes classiques conventionnelles. Cela démontre la capacité des systèmes hybrides quantiques-classiques à s'adapter à des ensembles de données diversifiés avec des améliorations en termes de précision, rappel, score F1 et ROC-AUC. Cependant, l'architecture hybride introduit des défis tels qu'une surcharge computationnelle accrue et des besoins en qubits, qui sont discutés en détail. Les travaux futurs se concentreront sur le développement de circuits quantiques plus efficaces pour réduire l'utilisation des qubits et explorer des algorithmes quantiques alternatifs pour l'optimisation afin d'améliorer encore les performances du modèle. Cette étude fait progresser l'apprentissage machine quantique en proposant un réseau neuronal hybride et évolutif qui équilibre avec succès les composant quantiques et classiques, avec des applications potentielles dans des domaines nécessitant une extraction de caractéristiques améliorées et des capacités d'apprentissage adaptatives. ABSTRACT: This thesis presents the design and verification of a Quantum-Enhanced Adaptive Neural Network with quantum gradient descent (QEANN-QGD), which integrates quantum and classical learning paradigms to address complex data patterns effectively. The model lever- ages Quantum Gradient Descent(QGD) and incorporates Hybrid Feature Integration (HFI), where quantum-enhanced features are combined with classical features extracted through traditional methods. This architecture exploits the strengths of both paradigms, ensuring scalable and adaptive learning performance. The proposed approach is verified on bench- mark datasets, including MNIST and CIFAR-10, using various optimization techniquessuch as SGD and Adam as baselines. For the MNIST dataset, we achieve an accuracy of 99.26% with QEANN-QGD, compared to 99.84% with SGD and 99.97% with Adam, while main- taining a low loss value of 0.0281. For CIFAR-10, the model has 82.57% accuracy, remaining competitive with several classical models, with a final loss value of 0.2791. The quantum layers significantly contributes to capturing non-trivial patterns, reflected in the gradual convergence of the ground-state energy during optimization. In addition, noise reduction techniques are applied to mitigate quantum errors and ensure the reliability of the quantum computations. Using variational quantum circuits and parameter-shift techniques enable ef- fective optimization of quantum features. The results show that our QGD-based training provides comparable robustnessand feature extraction capabilities to conventional classical methods. But the classical counterpart showed better accuracy and precision when compared to hyprid model. The hybrid architecture introduces challenges such as increased computa- tional overhead and qubit requirements, which are discussed in detail. Future work will focus on developing more efficient quantum circuit designs to reduce gthe number of qubit used and exploring alternative quantum algorithms for optimization to further enhance model per- formance. This study advances quantum machine learning by proposing a scalable, hybrid neural network that successfully balances quantum and classical components, with potential applications in domains requiring enhanced feature extraction and adaptive learning capa- bilities.