arXiv Machine Learning
Jun 9
Quantum feature-map learning with reduced resource overhead
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
SQUARE: Structured Quantum Representation Adapters as Compact Quadratic Feature Maps for Frozen Language Models
Related stories
arXiv Computation and Language
Sep 22
Circuit Hypernetworks for Quantum-Augmented Diffusion Language Models
arXiv:2609.24657v1 Announce Type: cross Abstract: Language models can be adapted by changing the computations applied to individual tokens. Quantum circuits offer one such approach, but evaluating wi...
arXiv AI
Aug 10
Investigating Quantum-Embedded Transformers on Classical Datasets for Cross-Modality Classification
arXiv:2608. 06846v1 Announce Type: cross Abstract: We test whether a parameterized quantum circuit (PQC) improves a hybrid quantum-classical model's performance on classical datasets, using an interface-matched classical map as the control while holding all other components fixed.
arXiv AI
Aug 3
InferQ: A Database-Oriented Benchmark for Quantum Circuits Simulation
arXiv:2607. 29134v1 Announce Type: cross Abstract: Recent work suggests that relational database management systems (RDBMSs) can execute quantum circuit simulation by compiling the simulation into SQL workloads (primarily join-and-aggregate tensor contractions).
arXiv Machine Learning
Jun 11
Higher-Order Token Interactions via Quantum Attention
arXiv:2606. 11673v1 Announce Type: cross Abstract: Standard dot-product self-attention computes, in a single layer, only pairwise (order-2) interactions between tokens; representing a generic order-$k$ interaction is known to require either super-quadratic resources in one layer or composition across depth.
Hugging Face Trending Papers
Jul 14
When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.
arXiv Machine Learning
Jun 24
Quantum Adaptive Self-Attention for Quantum Transformer Models
arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.
arXiv Machine Learning
Aug 3
Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization
arXiv:2607. 29145v1 Announce Type: cross Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems.
arXiv AI
Jul 15
When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis
arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
arXiv AI
Aug 14
AutoQuREO: A Framework for Automated Quantum Resource Estimation and Optimization
arXiv:2608. 12936v1 Announce Type: cross Abstract: As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks.
arXiv Machine Learning
Aug 19
Dynamic Entanglement-Weighted Pruning for Quantum Federated Unlearning in Supply-Chain Risk Prediction
The paper proposes Entanglement-Weighted Pruning (EWP), a method for unlearning a client’s contribution from a federated quantum classifier without retraining from scratch. EWP scores each trainable circuit parameter by combining a Fisher‑information estimate on the target client’s data with a structural entanglement weight, pruning the lowest‑scoring parameters and optionally fine‑tuning the remaining ones. Experiments on a four‑qubit data‑re‑uploading ansatz trained with FedAvg across five simulated supply‑chain‑risk clients show that EWP achieves accuracy comparable to full retraining while reducing forgetting and wall‑clock time by about sixteenfold, outperforming random, Fisher‑only, or entanglement‑only pruning.
arXiv Machine Learning
Sep 18
QEncodeBench: Can Large Language Models Encode Classical Problems into Verified Quantum Oracles?
QEncodeBench evaluates whether large language models can translate classical constraint problems into verified quantum phase oracles. The benchmark measures the correctness of generated circuits using an adversarial self‑validated verifier that checks full solution‑set equivalence while enforcing resource limits. Results show that models lacking a reasoning mode perform poorly, whereas enabling native reasoning improves accuracy tenfold; semantic errors dominate, and neuro‑symbolic pipelines close most gaps by delegating critical composition to deterministic procedures.