Skip to content

Parameter-Efficient Quantum NLP for Paraphrase Detection: Performance, Robustness, and Entanglement

Sep 2026 · 0 citations · 35 references
Physics Computer Science

TL;DR

This work evaluates a 10-qubit hybrid quantum-classical variational circuit for paraphrase detection across three benchmarks: MRPC, Quora Question Pairs, and adversarial PAWS to constitute the first systematic parameter-matched multi-benchmark empirical validation of hybrid variational circuits for NLP.

Abstract

Rigorous empirical validation of quantum machine learning on natural language tasks remains scarce. We evaluate a 10-qubit hybrid quantum-classical variational circuit (2,148 parameters) for paraphrase detection across three benchmarks: MRPC, Quora Question Pairs (QQP), and adversarial PAWS. On QQP (n = 10 seeds), the circuit achieves 75.53% +/- 0.75%. accuracy, statistically outperforming parameter-matched classical baselines (DeepMLP: p = 0.015, Cohen's d = 1.20; F1: p<0.001, d = 2.32) and surpassing DistilBERT-4bit with 31,191 fewer parameters. On MRPC the optimal 2-layer variant reaches 92% of BERT-base accuracy at 54,000 lower parameter cost. Circuit depth analysis reveals a dataset-depth scaling effect; entanglement analysis via the Meyer-Wallach measure identifies multi-qubit entanglement as the primary performance driver (r = 0.85 across four variants). Adversarial evaluation on PAWS reveals emergent robustness: 98.2% recall versus 81.6% classical (+16.6 pp, d = 1.24, p<0.001), without adversarial training. These results constitute the first systematic parameter-matched multi-benchmark empirical validation of hybrid variational circuits for NLP. All results are from classical simulation; hardware validation is future work.

View source

Similar papers

#machine learning Preprint Oct 2026

What Does It Cost to Simulate a Quantum Sentence Classifier? An Energy and Compute Perspective on Near-Term QNLP

Near-term quantum natural language processing (QNLP) experiments often run on classical simulators, so simulator cost is part of the field's practical compute burden, yet accuracy tables do not show it. We measure that cost for a variational quantum classifier (VQC) on binary SST-2 sentiment classification, using Penny...

Kishlay Kashyap, Sandipan Ganguly · 0 citations
Open access Oct 2026

Quantum Autoencoders for Network Anomaly Detection: A Comparative Benchmark with Classical Methods

The practical value of quantum machine learning for network anomaly detection remains unclear under controlled and comparable benchmarking conditions. This study evaluates a trash-qubit-based Quantum Autoencoder (QAE) against seven classical anomaly-detection methods on UNSW-NB15 using shared data partitions, preproces...

Gönül Altay, E. Küçüksille · 0 citations
Open access Oct 2026

Machine learning-assisted noise characterization and entanglement verification in superconducting qubits

The scalability of superconducting quantum processors is fundamentally limited by environmental noise and the exponential measurement overhead required for multi-qubit entanglement verification. In this work, we introduce a hybrid machine learning (ML) framework utilizing convolutional neural networks (CNNs)...

R. Delhibabu · 0 citations
Preprint Sep 2026

Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver

This work performs approximate matrix product state simulations for up to 50 qubits and 100 layers and quantifies entanglement by the bond dimension, showing that, in this regime, a substantial fraction of the optimization power of QAOA survives even in the complete absence of entanglement.

B. Bantysh, A. Chernyavskiy, Denis A. Kulikov et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.