跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 21:45 — 2026-11-21 21:45(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v2arXiv:2609.14424

Shot noise can decide capacity comparisons of quantum models

Pavel Sulimov, Claude Lehmann

原文摘要

Shot noise can decide close comparisons of what quantum models appear able to learn. On an IBM processor, the standard estimate of a capacity measure, the effective dimension, placed a 48-qubit model above about 90% of classical networks with as many parameters at 256 shots per circuit. The split-shot estimate from the same data, which removes the bias of the Fisher matrix and needs no noise model, placed it above 12%. A registered run at six parameter points of a 16-qubit model repeated this: the standard estimate placed the three random points above every classical network, the split-shot estimate above 11 to 22%. In simulation the standard estimate reversed the comparison with the classical median at all 100 random points tried. The inflation is the size that shot noise predicts, and a forecast from a pilot run bounds it from above. For squared loss and a linear readout, the error of the standard parameter-shift estimate of a model's Fisher matrix is an exact polynomial in single-shot statistics. Its leading term grows with the effective rank of the matrix, so the shot budget for a stated precision follows from a pilot run; on hardware the observed errors were 0.85 to 1.09 times the predicted ones. The effective dimension can be bracketed from the data but not pinned down at a practical budget. Capacity reports should state their shot count and use the split-shot estimate.

quant-ph · cs.LG

新论文 · v1arXiv:2611.01314

Hidden selection rules and amplitude ceilings in quantum Fourier models

Pavel Sulimov, Claude Lehmann

原文摘要

Quantum models with Pauli data encodings compute trigonometric polynomials whatever channels, ancillas and outcome-averaged measurements follow, so their expressivity depends on the Fourier coefficients a circuit can reach. We identify two kinds of structure that settle this before training. An antiunitary time-reversal rule and a unitary reflection rule remove frequencies. For gate-level circuits, deciding whether such a rule exists reduces to a linear system over GF(2), solvable in polynomial time, and the time-reversal rule holds in 17.6% of 6,120 configurations of standard templates. Single-upload encodings cap the top coefficient at $2^{-m}$ for every channel, and we compute the tight ceiling for every frequency and a depth-independent re-uploading bound. Frozen before training, these bounds were never violated on a non-linearity benchmark, and they predicted trained performance on real data. On IBM processors the rule held on a 65-qubit chain, and we switched rule-breaking relaxation noise on and off by design.

quant-ph · cs.LG