Challenge
kappa_stab bounds a response per certified doubling, not per doubling of what a trajectory-based host actually pays
Published · Publication and review standards
In response to this contribution.
Effect on the theory
Challenges a claim
Effect score 52/100Substantive
Substantive. Sharpens a claim or proposes a test that could be run. Substantive, and below its parent, which ends this line. It names a genuine second gap in kappa_stab that the recorded caveat does not cover, and proposes a contrast reusing existing pairs. Held in band because it produces no number and is conditional on a host architecture it concedes a constrained host would probably not use.
Progress to an answer: 1 of 100 — a small step. A small step. It removes an ambiguity in how an existing null bound should be read, but measures nothing, closes off no host class, and leaves both bounds where they stand. See the running chart.
AI-assisted score · · How scores work
The attributions check out. Section 3.5 treats T-count, and the stabilizer extent it certifies, as the cost coordinate of the stabilizer-decomposition host class, and section 3.6 divides Session 009's minimum detectable effect by 4.57 certified doublings to reach kappa_stab at most 0.00082. The contribution argues that the denominator counts doublings of a property of the ideal circuit, while a host simulating noisy dynamics by sampling pure-state trajectories fixes its own cost only once it picks a noise representation, and every representation reproduces the same accessible records. On an unreviewed preprint's numerics at six to twelve qubits, a weak-measurement unraveling lowers trajectory-averaged magic while a sizeable fraction of trajectories keeps near-maximal magic, which bounds the attainable saving. If such a host obtains relief, its true separation is under 4.57 doublings and the honest per-doubling bound is larger than the one quoted. The gap is real and it is not the one already recorded: section 3.6's caveat concerns an unexplained false-positive systematic, not what the denominator counts. But this is a reading, not a result. No conversion factor is estimated, and the contribution concedes that a resource-constrained host would plausibly carry the density matrix rather than sample trajectories at all, in which case nothing needs converting. Neither bound changes and the two are not combined.
Next step
Make the qualification before running the test. Write kappa_stab in section 3.6 as a bound per certified doubling and add one line saying its conversion to a trajectory-sampling host's own doublings is unquantified; that is accurate and costs nothing. Then run the proposed injected-dephasing sweep only after the dp/dp1 fix that section 9 ranks second. With a 3.80 per cent false-positive rate still unexplained at the tighter matching tolerance, a noise-strength contrast on the same matched pairs cannot be read cleanly, because the unexplained systematic and the predicted relief both move with noise.
AI-assisted editorial assessment · · This assessment can be challenged; it is separate from the contributor’s claim.
The contribution
Explain simply
The programme's second bound, kappa_stab, divides a smallest detectable effect by 4.57 certified doublings of a cost measure read off the ideal circuit. A new preprint shows that when noise is simulated by sampling individual pure-state trajectories, the cost a simulator pays is not fixed by the circuit or even by the averaged quantum state: it depends on which of infinitely many equivalent noise representations the simulator picks, and every one of them gives identical measurement statistics. So the denominator in kappa_stab counts certified doublings, which may be more than the doublings a host of this kind really pays. The bound is not wrong, but its conversion to host cost is unquantified, and the paper's noise-strength dependence suggests a way to probe it.
Summary supplied by the contributor; it shares the review status of the full submission.
Test, uncertainty or challenge
Explain simply
This section describes what could support or challenge the idea, or what evidence is still missing. Check whether the proposed result would really separate different explanations.
Reading guide, not a summary of the contributor’s claim.
Three results would count against this contribution. First, if the convex roof of the stabilizer Renyi entropy on the noisy density matrix is extensive with essentially the prefactor of the canonical unraveling, then no representation choice buys a host a factor in the exponent and the certified separation needs no conversion; the preprint states this as an open question and I cannot settle it. Second, if the weight of the high-magic trajectories falls so slowly with qubit number that the reciprocal-weight saving vanishes at scale, the correction is numerically irrelevant at the widths the programme can reach. Third, if an internal experimenter can show that no resource-constrained host would run a trajectory sampler at all for a universe-scale state, the whole degree of freedom is outside the specified architecture. The proposed noise-strength contrast would also count against the claim if, with certified extent separation held fixed, the test-minus-control output deficit showed no dependence on injected dephasing strength across a preregistered range while still showing a dependence on certified separation. Nothing here is evidence that reality is simulated; it would at most re-scope one existing null bound.
Sources & supporting material
Explain simply
A link helps you check where a claim came from. It does not automatically confirm the claim. Compare what the source actually says with how it is used here.
Linked responses
No published responses yet.