The paper introduces byte‑level autoregressive language models that use a small quantum register as hidden state, with token‑conditioned quantum channels and Born‑rule measurements providing next‑byte probabilities. Unitary dynamics alone fail to retain memory beyond one token, but adding learned dissipative gating improves test negative log‑likelihood and key‑value recall up to a limited capacity. Experiments on IBM Heron hardware show measurable quantum memory signals and autoregressive byte generation, though the models remain classically simulable and do not outperform classical n‑gram baselines.
arXiv:2605. 12713v3 Announce Type: replace-cross Abstract: In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed.
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: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: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...
The paper demonstrates that quantum transformer blocks can be intrinsically interpretable by tracking quantum mutual information, entanglement entropy, and state fidelity across layers. Experiments on four synthetic tasks show that learned mutual information aligns with task structure, entanglement is essential for accuracy, and mutual information predicts prediction correctness. These findings are validated on IBM Quantum hardware, illustrating that quantum computation’s physics can provide observable interpretability signals.
arXiv:2608. 14691v1 Announce Type: new Abstract: Sequence models are conventionally distinguished by their backbone, the mechanism that routes information across positions, such as attention or recurrence.
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.
The paper introduces LatentPort, a method that allows a language model to transfer its live memory to another model without requiring the receiver to reread the context. Experiments on a Qwen3.5 4B-to-9B sibling pair show that adding a Gated DeltaNet (GDN) persistent-state package reduces negative log‑likelihood by 0.747 nats/token and improves performance across 64 PG19 documents. The study also demonstrates that direct recurrent and convolution reuse outperforms learned GDN maps, and a 434,176‑parameter correction further narrows the performance gap to the native 9B model.
The paper introduces a compact, NISQ‑compatible quantum transformer for synthetic QNLP sequence modelling. It replaces classical attention and feed‑forward layers with variational quantum encoder blocks, connector circuits, decoder blocks, and a two‑qubit measurement readout, while preserving the autoregressive next‑token interface. The authors evaluate several variants on deterministic and lexicographic grammar‑generation tasks, finding that the quantum models can learn nontrivial grammar structure but are less accurate and stable than a compact classical transformer baseline.
QART is a quantum‑classical hybrid architecture that augments a language model with quantum encoding, CIM‑based QUBO optimization, and quantum decoding to improve long‑horizon reasoning. The authors claim that, under certain assumptions, QART can maintain a non‑zero probability of recovering an optimal reasoning path while traditional autoregressive LLMs see their acceptance probability drop to zero as cumulative risk grows. Experiments on six benchmarks with three backbone models show that QART outperforms the baselines in 14 of 15 pairings, with relative gains up to 84.0% on SciCode.
arXiv:2607. 02363v1 Announce Type: cross Abstract: Quantum Fast-Weight Programmers (QFWPs) store temporal information in dynamically programmed variational-circuit parameters rather than in nonlinear recurrent hidden states, offering a practical route to quantum sequence modeling.
arXiv:2605. 06734v2 Announce Type: replace-cross Abstract: Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states.