mlsanityData to 14 Oct 2026

SQUARE: Structured Quantum Representation Adapters as Compact Quadratic Feature Maps for Frozen Language Models

arXiv 2609.37134 ↗First posted 29 Sep 2026quant-ph cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Frozen language models (LMs) are increasingly used as fixed feature extractors for downstream reranking, scoring, and preference modeling, raising a practical question: how should a compact module represent interactions among features in a fixed low-dimensional bottleneck? Common linear and low-rank adapters remain linear at the adaptation module itself, whereas explicit second-order alternatives introduce pairwise interactions through direct parameterization or predefined factorizations. We propose SQUARE, a Structured QUAntum REpresentation adapter that amplitude-encodes the bottleneck vector, applies a parameterized quantum circuit, and measures the resulting state. We show that each basis-probability feature is exactly a normalized quadratic form in the bottleneck coordinates, while the additional Pauli-Z readouts are signed linear combinations of these probabilities. The measured map can therefore parameterize interactions over O(d2) coordinate pairs through a small set of shared circuit parameters, where d is the bottleneck dimension. It provides a structured parameterization within, rather than beyond, the classical normalized-quadratic feature class. In a disjoint same-pipeline evaluation over eight GLUE-derived controlled interaction tasks and five shared seeds, SQUARE achieves an average test accuracy of 0.7565, compared with 0.7355 for an affine normalized-quadratic predictor, 0.7271 for the evaluated parameter-matched Givens mixing model, 0.6817 for an MLP, and 0.6155 for a frozen-circuit control. Under reduced supervision, it also shows consistent gains over the strongest evaluated classical comparator, with the same qualitative pattern across multiple frozen LM backbones. All circuit experiments use simulation, while the learned feature map can be evaluated exactly in batched PyTorch without quantum hardware.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 64 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

44 of 64 references.

References · 44

  1. 2022Training language models to follow instructions with human feedbackcited by 15,971
  2. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  5. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  7. 2023Mistral 7Bcited by 3,164
  8. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  9. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  10. 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 876
  11. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  12. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
32 more
  1. 2022What Can Transformers Learn In-Context? A Case Study of Simple Function Classescited by 715
  2. 2018Supervised learning with quantum enhanced feature spacescited by 665
  3. 2019Designing and Interpreting Probes with Control Taskscited by 640
  4. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
  5. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  6. 2020Power of data in quantum machine learningcited by 338
  7. 2020The effect of data encoding on the expressive power of variational quantum machine learning modelscited by 333
  8. 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 312
  9. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 307
  10. 2020A rigorous and robust quantum speed-up in supervised machine learningcited by 271
  11. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  12. 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
  13. 2021UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuningcited by 162
  14. 2023Representational Strengths and Limitations of Transformerscited by 133
  15. 2023The Expressive Power of Low-Rank Adaptationcited by 102
  16. 2021Parametrized quantum policies for reinforcement learningcited by 90
  17. 2024Asymmetry in Low-Rank Adapters of Foundation Modelscited by 86
  18. 2024RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptationcited by 48
  19. 2022Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuitscited by 43
  20. 2025GRAM: A Generative Foundation Reward Model for Reward Generalizationcited by 25
  21. 2024Quantum Implicit Neural Representationscited by 16
  22. 2024A Unified Theory of Quantum Neural Network Loss Landscapescited by 12
  23. 2023Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuitscited by 10
  24. 2025Benchmarking Quantum Reinforcement Learningcited by 10
  25. 2024eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channelscited by 8
  26. 2025TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture searchcited by 7
  27. 2024Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuningcited by 6
  28. 2025Quantum Doubly Stochastic Transformerscited by 6
  29. 2025Quantum Visual Fields with Neural Amplitude Encodingcited by 6
  30. 2025QuIC: Quantum-Inspired Compound Adapters for Parameter Efficient Fine-Tuningcited by 5
  31. 2025Layerwise Federated Learning for Heterogeneous Quantum Clients using Quoruscited by 5
  32. 2025BoRA: Towards More Expressive Low-Rank Adaptation with Block Diversitycited by 4

Built on by

Not cited yet.