/ Модель

Характеристики

Контекст
2 048 токенов
Параметры
19,1 млн
Лицензия
Apache 2.0
Архитектура
llama · dense
Библиотека
transformers
Опубликована
28 сен 2026

WQT20M-Beta

Генерация текстаТекст → текст3 профессии

Экспериментальная модель WestQuant Open ранжирует квантовые преобразования и предсказывает оставшуюся стоимость оптимизации квантовых схем.

336скачиваний за 30 дней2лайкавеса обновлены28 сен 2026

Бенчмарки

Как модель справилась с задачами пользователей ailist и что о ней публикуют открытые лидерборды

Тесты пользователейпока нет

Никто ещё не опубликовал тест этой модели. Соберите бенчмарк из своих задач — результат появится здесь.

  1. Добавьте модель в бенчмарк

    Вместе с другими моделями категории «Текст» — сравнение идёт внутри одной категории.

  2. Опишите свои задачи

    Напишите запросы, при необходимости приложите файлы и эталонные ответы.

  3. Запустите и опубликуйте

    Модели ответят на каждую задачу, судья оценит ответы. Опубликованный результат появится на этой странице.

Публичные оценки

Из открытых лидербордов. Сравнивайте результаты одного теста при одинаковых условиях — отсутствие оценки не значит, что модель хуже.

В подключённых источниках результатов для этой модели пока нет.

Что умеет модель

Описание составлено по карточке модели и метаданным Hugging Face

WQT20M-Beta — экспериментальная модель WestQuant Open на базе Transformer с архитектурой Llama и 19,1 млн параметров. Она предназначена для ранжирования квантовых преобразований: по состоянию оптимизации оценивает, какое из допустимых преобразований выглядит наиболее перспективным. Модель также предсказывает оставшуюся стоимость оптимизации; выполнение преобразований и независимая проверка результата остаются за детерминированными движками.

Это proof-of-concept и базовый ориентир для исследователей, работающих над моделями оптимизации квантовых компиляторов. README сообщает о 73% точности выбора лучшего действия при ранжировании через предсказание стоимости и средней ошибке предсказания около 8. Обучение проводилось на синтетических данных; контекст составляет 2048 токенов.

Модель принимает текстовое представление состояния оптимизации и выдаёт текстовые оценки или ранжирование кандидатов. Она не исполняет квантовые преобразования. Указана лицензия Apache-2.0; качество на реальных данных с квантовых процессоров не заявлено.

Сценарии применения

  • ранжирование допустимых преобразований квантовой схемы
  • выбор перспективного шага оптимизации квантового состояния
  • оценка оставшейся стоимости оптимизации
  • создание базового ориентира для исследований оптимизации квантовых компиляторов

Ограничения

Это proof-of-concept, обученный на синтетических данных; README не заявляет обучение на реальных данных квантовых процессоров. Модель только оценивает и ранжирует действия, а преобразования должен выполнять внешний детерминированный движок.

Для каких профессий подходит3

Разделы каталога профессий, в задачах которых используется эта модель

Все профессии

Карточка модели

README от автора на Hugging Face, как он его опубликовал

Открыть на Hugging Face

WQT20M-Beta

WestQuant Transformer 20M — Quantum Representation Scheduler

AI schedules. Deterministic mathematics executes. Independent verification certifies.

WQT20M-Beta is a 19M-parameter Transformer that ranks quantum transformations. Given a quantum optimization state, it predicts which transformation is most promising. It does not execute transformations — deterministic engines do that.

WQT20M-Beta is a proof-of-concept that a 19M-parameter Transformer can learn structured quantum optimization preferences from synthetic data. Researchers building better compiler-optimization models can use this as a baseline.

This is WestQuant Open's first step toward a production-ready transformer with calibrated value predictions (wider range, objective sensitivity, real QPU training data) that could replace heuristic transpiler defaults in large complex Quantum Computing production pipelines.


What It Does — 3 Tested Examples

Example 1: Preference Comparison (96% accuracy)

Given two candidate transformations with their costs, the model predicts which is better:

State:    <DOMAIN:quantum_annealing> <LEVEL:ISING> <N_QUBITS:18> ...
          <RES:n_q=18 D=8 G1=12 G2=4 T=0 M=3 A=0 E=0.0100 C=1.0000>
          <OBJ_TYPE:balanced>

Candidate A: QUENCH          (cost 1278.25)
Candidate B: SET_BIAS        (cost 1245.57)

Model predicts: B>A   (SET_BIAS is better)
Correct answer: B>A   ✓

Example 2: Value Prediction (mean error ~8)

Given a state, the model predicts the cost-to-go (remaining optimization cost):

State:    <DOMAIN:graph_optimization> <LEVEL:GRAPH> <N_NODES:21> ...
          <RES:n_q=21 D=5 G1=10 G2=3 T=0 M=2 A=0 E=0.0100 C=1.0000>
          <OBJ_TYPE:balanced>

Model predicts cost-to-go: 1275.93
Actual cost-to-go:         1264.63
Error:                     11.30 (0.9%)

Example 3: Ranked Policy (73% Top-1 via value ranking)

Given a state and all legal candidate actions, the model ranks them by predicted cost and picks the best:

State:    <DOMAIN:hardware_mapping> <LEVEL:COMPILED> <N_QUBITS:12> ...
          <RES:n_q=12 D=6 G1=8 G2=2 T=0 M=1 A=0 E=0.0050 C=1.0000>
          <OBJ_TYPE:2q_focused>

Candidates ranked by predicted cost:
  1. NOISE_AWARE        predicted=620.83   ← model picks this
  2. LAYOUT_SCORE       predicted=631.83
  3. DENSE_PLACE        predicted=639.83

Oracle (actual best):   NOISE_AWARE        ✓ Correct!

Quick Start

pip install transformers torch
from transformers import AutoModelForCausalLM, AutoTokenizer
import torch

model = AutoModelForCausalLM.from_pretrained("WestQuantStudio/WQT20M-Beta")
tokenizer = AutoTokenizer.from_pretrained("WestQuantStudio/WQT20M-Beta")
device = "mps" if torch.backends.mps.is_available() else "cpu"
model = model.to(device).eval()

text = ("<SOLVE> <DOMAIN:quantum_annealing> <LEVEL:ISING> "
        "<N_QUBITS:18> <N_GROUND:14> <COUPLING_STRENGTH:0.8000> "
        "<RES:n_q=18 D=8 G1=12 G2=4 T=0 M=3 A=0 E=0.0100 C=1.0000> "
        "<OBJ_TYPE:balanced> "
        "<CAND_A> QUENCH <COST_A> 1278.25 "
        "<CAND_B> SET_BIAS <COST_B> 1245.57 "
        "<PREF>")

ids = tokenizer.encode(text, add_special_tokens=False, return_tensors="pt").to(device)
with torch.no_grad():
    for _ in range(5):
        out = model(input_ids=ids)
        nxt = out.logits[0, -1].argmax().unsqueeze(0).unsqueeze(0)
        ids = torch.cat([ids, nxt], dim=1)
        if nxt.item() == tokenizer.eos_token_id:
            break

print(tokenizer.decode(ids[0].tolist()).split("<PREF>")[-1].strip())
# → "B>A" (SET_BIAS is better because cost 1245 < 1278)

What WQT20M-Beta Predicts

TaskInputOutputAccuracy
PreferenceState + 2 candidates with costsWhich candidate is better96.1%
ValueStatePredicted cost-to-goSpearman 0.98, mean error ~8
Ranked PolicyState + all legal actionsBest action (via value ranking)73% Top-1
LegalityState + actionIs this action legal?76.9%
HardwareState + backendIs this feasible?91.2%

Model

ConfigValue
ArchitectureLlama-style decoder Transformer
Parameters19.06M
Layers8
Hidden size384
Attention heads6 (2 KV heads, GQA)
FFN1536 (SwiGLU)
Context length2048
Vocab4561 (quantum-native structured tokens + BPE)
Model size76 MB

Standard HuggingFace LlamaForCausalLM. Compatible with AutoModelForCausalLM, AutoTokenizer, and SafeTensors.


Validation

All 6 release gates passed:

GateResult
Data integrityPASS
Structural learning (no cheating)PASS
Search improvement over randomPASS (+35% at budget=100)
Generalization to unseen problemsPASS (96%)
No regressionPASS
ReproductionPASS

Anti-cheating

The model reads structure, not identifiers:

  • ID-only accuracy: 24% (domain token alone can't predict the answer)
  • Shuffled structure: 74% (scrambling the structure hurts performance)

Search improvement

Search budgetRandomWQT20M-BetaImprovement
10 evalsbaseline—+3.5%
50 evalsbaseline—+17.5%
100 evalsbaseline—+35.0%

QFT & Grover experiments

Independent experiments on QFT and Grover circuits across 18 configurations:

  • 0.0 regret in all 18 configs — the model consistently picked CANCEL, the best action
  • CANCEL ranked at position 1/15 (median model rank of true-best action)
  • Top-3 rate: 63% — the true-best action is in the model's top-3 63% of the time
  • CALL_PYZX is always correctly identified as the worst action

Honest Assessment

Where WQT20M-Beta has narrow real-world value

The core limitation: exhaustive search over 15 transpiler configs takes <0.01s per circuit. Any user who can afford to run Qiskit at all can afford to try all candidates and pick the best. In experiments, many configurations were ties (model and random both found the optimum), and the model did not consistently beat random on small search spaces.

Where it would add genuine value

1. Scaling to large search spaces where exhaustive is infeasible

If the candidate space grows to hundreds or thousands of configurations (e.g., combining routing methods × layout methods × synthesis engines × basis gates × opt levels × seeds), exhaustive evaluation becomes expensive. The model's value-ranking approach becomes meaningful when each evaluation costs real QPU time or long simulation. A user compiling 10,000 circuits × 500 candidate configs would benefit from model-guided pruning.

2. Multi-step optimization pipelines

The model predicts cost-to-go, not just immediate cost. In a sequential optimization pipeline (apply transformation A, then B, then C), the model could guide intermediate decisions where the full tree is exponentially large. This is the model's actual design intent — it's a scheduler, not a single-shot selector.

3. Researchers studying AI-guided quantum compilation

The model is a research artifact. Its value is as a proof-of-concept that a 19M-parameter Transformer can learn structured quantum optimization preferences from synthetic data. Researchers building better compiler-optimization models would use this as a baseline.

4. WestQuant iterating toward a production model

The Beta is explicitly a stepping stone. A future version with calibrated value predictions (wider range, objective sensitivity, real QPU training data) could replace heuristic transpiler defaults in production pipelines.

Who would NOT benefit

  • Practitioners running small circuits — exhaustive search is free and optimal
  • Users needing guaranteed optimality — the model has nonzero regret and 76.9% legality accuracy
  • Anyone with objective-dependent optimization — the model has 0% objective sensitivity
  • Users on real QPUs today — the model was trained on synthetic data, not hardware

Bottom line

The model adds real value only when the candidate search space is large enough that exhaustive evaluation is expensive, and when approximate guidance is acceptable. In its current Beta form, that threshold is well above what Qiskit's built-in transpiler exposes. The honest framing is: this is a research prototype demonstrating that learned quantum-structure preferences are feasible, not a production tool that outperforms brute force on practical workloads.


Roadmap to Production

GapCurrent (Beta)Production Target
Training dataSynthetic surrogateReal Qiskit/TKET transpilation outputs
Value calibrationNarrow range (6.0–6.6)Actual cost magnitudes (50–25,000)
Objective sensitivity0%Changes ranking with objective
Legality76.9%>95%
Optimization stepsSingle-stepMulti-step trajectory planning
Backend awarenessTopology tokens onlyPer-edge error rates, per-qubit T1/T2
Model size19M100–200M
Feedback loopNoneActive learning from user compilations
DeploymentStandalone scriptQiskit transpiler plugin with budget parameter

Key changes needed

1. Real compiler outputs, not synthetic — Train on actual transpilation trajectories from Qiskit/TKET/PyZX across 10,000+ circuits from MQT Bench, QASMBench, and circuit libraries, with 20-50 real backend coupling maps.

2. Calibrated value prediction — Add a regression head that predicts cost in the actual cost range of the training data, not a narrow band.

3. Objective conditioning that works — Train with objective-dependent labels where the same (state, action) pair has different costs depending on the objective (depth-focused, 2q-focused, fidelity-focused, time-focused).

4. Multi-step trajectory planning — Train on real optimization trajectories with cumulative cost at each step, so the model learns which sequences are promising, not just which single action looks good.

5. Legality prediction — A binary classification head trained on real constraint data (which actions are valid for a given backend, circuit family, and optimization level). Target >95% accuracy.

6. Real backend calibration — Include actual per-edge error rates, per-qubit T1/T2, gate durations, and queue/wait times in the state encoding.

7. Larger model — 100-200M parameters, 12-16 layers, 768 hidden, 4096+ context length to encode full circuit metrics + backend calibration + action history.

8. Active learning — A feedback loop where the model improves from real user compilations: user compiles, model suggests, Qiskit applies, real cost is measured, (state, action, real_cost) is logged, model is fine-tuned.

9. Production deployment — A Qiskit transpiler plugin where the model ranks candidates, top-K are evaluated by real Qiskit, and the user specifies a budget parameter (how many real evaluations they can afford).

The model's architecture and approach (value-prediction-based ranking, quantum-native tokenization, structured state encoding) are sound. The gap is entirely in training data quality, calibration, and multi-step capability. Fix those three and it becomes a model someone would use in production.


Coverage

15 quantum optimization domains:

DomainExample Actions
Quantum chemistryUCCSD_ANSATZ, ADAPT_VQE, FROZEN_CORE
Graph optimizationMAXCUT_ROUND, COLOR_GRAPH, SDP_RELAX
Error correctionSYNDROME_MEASURE, DECODE_SURFACE, MAGIC_STATE_DISTILL
Quantum annealingREVERSE_ANNEAL, MINOR_EMBED, HYBRID_SOLVE
VariationalQAOA_P1/P2/P3, WARM_START, ADAPTIVE_LAYER
Hamiltonian simulationTROTTER_STEP, LCU_DECOMPOSE, QUBITIZE
Circuit optimizationCANCEL_GATES, ZX_SIMPLIFY, FUSE_ROTATIONS
Hardware mappingSABRE_ROUTE, PULSE_OPTIMIZE, NOISE_AWARE
Neutral atomSET_RYDBERG, PULSE_SHAPE, ADIABATIC_PASS
PhotonicKLM_CNOT, CLUSTER_STATE, HERALD
TopologicalBRAID_ANYON, FIBONACCI_BRAID
Quantum walkCOINED_WALK, GROVER_COIN, AMPLIFY
State preparationMPS_PREP, TENSOR_NETWORK, COMPRESS_STATE
Amplitude amplificationGROVER_ITER, QSEARCH, ITERATIVE_QPE
Quantum MLIQP_KERNEL, DATA_REUPLOADING, FIDELITY_KERNEL

Limitations

This is a Beta release:

  • Policy Top-1 (generation): 0.8% — The model cannot reliably generate the best action name. However, ranked policy via value prediction achieves 73% Top-1 — use the value-ranking approach, not generation.
  • Legality: 76.9% — Below target. The model sometimes marks illegal actions as valid.
  • Objective sensitivity: 0% — The model does not yet change its predictions when the optimization objective changes.
  • Value calibration — Predicted values cluster in a narrow range (6.0–6.6), while actual costs range from 50 to 25,000. The model has good rank correlation (Spearman 0.98) but poor absolute calibration.
  • Not a circuit compiler — The model works on its own structured state representation, not on raw Qiskit/TKET circuits. The plugins translate between the model's representation and real frameworks.

License

Apache 2.0

Citation

@misc{westquant2026wqt20m,
  title={WQT20M-Beta: A 19M-Parameter Transformer for Quantum Representation Scheduling},
  author={Vesterlund, David},
  year={2026},
  url={https://huggingface.co/WestQuantStudio/WQT20M-Beta},
  note={WestQuant Open Source Project}
}

Как запустить

На своей GPU в ailist. Цена — по текущим предложениям провайдеров

GPU в ailist

Универсальный рантайм · transformers

Можно запустить

Подбираем GPU…

Класс архитектуры
LlamaForCausalLM
Ревизия весов
1898eba

0 моделей