- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper defines quantum feature accessibility as whether predictive information can be used under specified processing and learning resources. It distinguishes encoded information, readout visibility, and learned reliance. For product-encoded local circuits with local measurements and affine heads, it proves additive logits and, under conditional-marginal assumptions, cue-only population-risk minimizers even when relational coordinates jointly contain the label.
However, the core population theorem is an additive-model result rather than an intrinsically quantum phenomenon, and only the constructed Q-LINK setting closely instantiates its assumptions.
Critical strengths
The cue-only theorem links a circuit restriction to shortcut dependence under explicit assumptions. This is a cute and novel results at least to me.
The shared splits and representations in the realistic suite, absence of OOD-based selection, and extensive caveats improve credibility.
Critical weaknesses
The main theorem applies to any additive model satisfying the closure assumptions; several propositions are standard trace-distance, calculus, least-squares, or concentration results. The specifically quantum theoretical novelty is limited.
Some comparisons are confounded by preprocesing. In controlled spectral tasks, classical models receive full inputs while VQCs receive six-dimensional PCA inputs. In realistic scaling, increasing the dimension d changes both representation and circuit width, right?
Questions for authors
Can a pre-training accessibility metric predict reliance across architectures?
How does a classical additive model compare on Q-LINK under identical optimization and interventions?
Do controlled spectral conclusions persist with exactly matched input representations?
Can hardware findings be replicated across sessions or devices with confidence intervals so we have some uncertainty quantifications?
11 comments
Thank you for the revision, I will keep the original score, the concern is partially addressed but insufficient.
Thank you for taking the time to review the revision. Could you clarify which concern remains unresolved and what you found insufficient in our response? This would help us address the specific issue during the discussion.
Thank you for highlighting the theorem's link to shortcut reliance and the shared inputs, splits, and absence of OOD-based selection.
1. Response to the critical weaknesses
1. What is theoretically new. Theorem 4 uses a standard convexity argument that also applies to classical additive models (Appendix A.9). The new result is a circuit-level prediction of which competing feature a VQC uses at a population optimum and how that choice affects test risk. Product encoding with one coordinate per qubit, local input-independent channels and readouts, and an affine head force additive logits (Proposition 3). In Q-LINK, the stable relative phase predicts the label, while each phase coordinate has a fixed conditional marginal given the label and cue (Appendix C.9). Under the theorem's conditional-mean and closure assumptions, every attained finite population optimum is cue-only. Under Proposition 6's support condition, test risk then depends on the cue–label law, so reversing the accessible cue can cause failure with the stable predictor still encoded.
With basis encoding and target-Z measurement fixed, a CNOT changes the effective observable from Z2 to Z1Z2 and raises affine label recovery from 0 to 1 under the cue-balanced law (Appendix A.4). Swapping feature roles at fixed Local VQC architecture makes the accessible cue stable. OOD reversed accuracy rises from 9.8% on Q-LINK to 100% on Q-LINK-Reversed (Tables 69 and 123). Other tasks probe feature reliance empirically.
2. Preprocessing and scaling. We refit spectral baselines on the exact six-angle VQC inputs. The realistic suite shares frozen inputs and splits at each d. Across d=6,12,24, the sweep changes representation and circuit width together (§5, Appendix E.3).
2. Answers to the questions
Answer. At initialization, the Taylor diagnostic uses the first labeled minibatch's Adam step to estimate the change in stable-minus-shortcut logit contrast on a balanced 64-example Random probe. It matches 24/27 first-update directions versus 18/27 for always predicting shortcut. Final contrast agreement is 16/27 versus 15/27 for always predicting stable. First-update/final matches are 8/9 and 9/9 for Local, 7/9 and 6/9 for Entangling, and 9/9 and 1/9 for Reuploading. The diagnostic predicts early shifts in reliance, with little evidence of predicting final reliance (§4.3, Figure 5b, Table 126).
Answer. The sine–cosine head matches the Local VQC's angles, source examples, initial logits, minibatches, logistic loss, Adam settings, and interventions. Adam updates coefficients or VQC parameters. Table 123 reports OOD reversed mean accuracies over three seeds.
Both additive models recover to 90.2% when only the shortcut is flipped. Adding 16 cross-block products at fixed inputs enables reliance on the stable relation, as in the Entangling VQC (§4.3, Figure 5a).
Answer. On Spurious-Fourier, matching inputs lowers logistic regression and MLP accuracy by 4.1 and 4.5 points to 95.9% and 95.0% OOD reversed, near the Local VQC's 95.6%. On Q-FOS, matched classical models reach 99.8–100% OOD reversed versus 45.2–59.5% for default-scale VQCs. Classical stable-only accuracy is 100%, showing the projection retains the stable signal. Halving the rotation scale on the same PCA inputs brings Local and Entangling VQCs to 100% OOD reversed, tying use of the signal to encoding (§4.3, Tables 52 and 124–125).
Answer. Appendix F.3 pairs 21,600 rows from 18 clean-trained runs on Q-LINK and Spurious-Fourier with matched checkpoints, examples, and 1,000 shots. Entangling Q-LINK OOD reversed accuracy falls from 98.67% in simulation to 50.33% on MonarQ (−48.33 pp, 95% CI [−53.67, −42.67]). The drop is 44–55 pp across the three checkpoints and persists on stable-only inputs (−49.33 pp, 95% CI [−54.67, −44.00], Table 127). Exact and 1,000-shot simulation give the same full-input accuracy at each checkpoint. The wider 405-run archive spans June 30–August 22, 2026 (Appendices D and F.3). The clustered bootstrap quantifies example-sampling uncertainty for the archived runs. Session and device repeatability require matched reruns across identified sessions or devices.
If these clarifications address your concerns, we would appreciate any updates to your assessment and rating.