跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19985 · v1

When Zero Is Competitive: A Descriptive Pilot of Transformer and Gate-Graph Surrogates on Random-Angle Quantum Circuits

首次提交 2026-11-15 20:47
版本更新 2026-11-15 20:47
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

We examine supervised classical prediction of all one-qubit Z and two-qubit ZZ expectation values on noiseless, layered 4-10-qubit RX/RY/RZ-CNOT circuits. In a 63-cell stratified workload with disjoint circuit-template tests, we evaluate one transformer encoder and gate-dependency graph neural networks against literal-zero and training-derived constant predictors. On the Arm K training labels, 44.89% of scalar targets have absolute magnitude below 0.05. The held-out-template zero predictor has equal-instance mean absolute error 0.193399, and none of the evaluated transformer checkpoints or final graph-network endpoints achieves a lower score. A separate product-state positive control achieves MAE 0.007755 versus 0.514811 for zero, but does not explain the failure on the entangled workload. The difference between zero and a training-fitted mean constant under training MSE is only 0.14%, a descriptive point estimate without uncertainty analysis. The transformer's 815,233-parameter source identity is locally verified; detailed packed-input semantics have not been independently audited. These results constitute a descriptive pilot, not a causal explanation, formal equivalence test, or impossibility claim. Comparable circuits can be regenerated from the workload specification, but exact frozen datasets and model-run evidence remain private.

作者备注:9 pages, 1 figure. Descriptive pilot study. Exact experimental evidence archive currently private

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 20:47 · 最新观测版本

When Zero Is Competitive: A Descriptive Pilot of Transformer and Gate-Graph Surrogates on Random-Angle Quantum Circuits

We examine supervised classical prediction of all one-qubit Z and two-qubit ZZ expectation values on noiseless, layered 4-10-qubit RX/RY/RZ-CNOT circuits. In a 63-cell stratified workload with disjoint circuit-template tests, we evaluate one transformer encoder and gate-dependency graph neural networks against literal-zero and training-derived constant predictors. On the Arm K training labels, 44.89% of scalar targets have absolute magnitude below 0.05. The held-out-template zero predictor has equal-instance mean absolute error 0.193399, and none of the evaluated transformer checkpoints or final graph-network endpoints achieves a lower score. A separate product-state positive control achieves MAE 0.007755 versus 0.514811 for zero, but does not explain the failure on the entangled workload. The difference between zero and a training-fitted mean constant under training MSE is only 0.14%, a descriptive point estimate without uncertainty analysis. The transformer's 815,233-parameter source identity is locally verified; detailed packed-input semantics have not been independently audited. These results constitute a descriptive pilot, not a causal explanation, formal equivalence test, or impossibility claim. Comparable circuits can be regenerated from the workload specification, but exact frozen datasets and model-run evidence remain private.

查看此版本解读 →查看此版本原文 ↗