{"id":"a2759a94-0cac-498b-bb24-23aa7108d3b8","arxiv_id":"2610.01446","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"For angle-encoded matchgate circuits the output variance stays at order 1/n for every pure product input, while a related off-diagonal family has exactly zero output on computational-basis inputs and regains order-1/n mean variance under uniform angles, certifiable classically before execution.","lead":"Quantum machine learning circuits often suffer from 'barren plateaus' where training gradients become exponentially small. This paper shows that the classical encoding feeding data into two specific circuit families fully determines whether the output landscape stays usable, and builds a classical test that certifies a healthy output variance before the quantum circuit runs.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"The variance and certificate results hinge on the unverified premise that finite-depth versions of the studied circuits reproduce Haar second moments; the paper states this premise but supplies no supporting schedule, so the certificate's Θ(1/n) bound describes the idealized ensemble rather than…","rationale":"I read the paper as a self-contained, algebraically sound analysis of how angle-encoded input distributions affect sample-wise output variance for two polynomial-DLA families, plus numerically explored exponential-DLA extensions. The reader's verdict (CONDITIONAL, moderate confidence) is correct, and I agree on the weakest assumption: the entire variance-and-certificate chain is gated on the trainable-parameter ensemble matching Haar or exact 2-design second moments on the relevant Lie group (Eq. 1 from Ragone et al.), with no finite-depth schedule shown to achieve it. I verified the core algebra independently: the matchgate telescoping purity band [n-1,n] (Eq. 2) and resulting Θ(1/n) variance for Zi readout; the off-diagonal closed form Eq. 3 (only sin²φj sin²φk terms survive under Ry encoding, odd separations per the cited algebra structure); the uniform mean μn = n/3 - 5/9 (Eq. 4); the extremal maximum n-1 at X-eigenstates matching dX = n-1; and the fully unconditional zero-output identity Eq. 6 (every algebra string contains an X or Y factor, whose expectation vanishes on computational-basis states). The Markov acceptance bound (Eq. 8) tending to 1/5 and the certificate's lower bound μn/dimgod = Θ(1/n) on mean variance are correct conditional on Eq. 7, i.e., on the per-input uniform angle law, which holds for D≥2n disjoint planes. The paper is notably candid: it flags the 2-design dependence (b233), the unresolved mixing depth (b236), the mean-not-per-input nature of the guarantee (b154), the pooled histogram's non-uniformity (b363), the training run's failure to establish BP scaling (b275), and the numerical-only verification of exponential-family structure. Because of this transparency and because the analytic content is internally consistent, the concern I identify does not move the verdict: it reinforces CONDITIONAL rather than changing it. The honest position is that the certificate's deliverable is proven for the idealized ensemble, and the paper's own unresolved mixing-depth caveat is precisely the condition under which that guarantee is realized; a depth-convergence check would settle whether the operational claim holds.","tokens_in":19269,"tokens_out":9590,"duration_ms":64775,"concrete_test":"On the off-diagonal ansatz ({XkXk+1, YkYk+1}) at n=8, fix one input at a generic angle (e.g., φk=π/4) and one at i.i.d. uniform angles; for depth L in {1,2,4,8,16,32}, draw S=10^4 independent uniform parameter vectors and compute the empirical Var_θ[fθ] for O = X1X2 + Y1Y2, then compare against the Eq.-1 prediction 2·Pgod(ρ(φ))/dimgod. The family is classically simulable, so S is cheap. If the empirical variance does not converge to within ~50% of the prediction by L=32, then the certificate (Eqs. 7–9) certifies only the Haar-ensemble variance, not the depth-L circuit's, and the operational claim needs explicit qualification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The single load-bearing link is the ensemble premise behind Eq. 1: every Θ(1/n) statement — the matchgate per-input band, the off-diagonal uniform-prior mean via Eq. 4, and the certificate's accepted-rotation guarantee (Eqs. 7–9) — assumes the trainable-parameter ensemble reproduces Haar (or exact 2-design) second moments on the dynamical Lie group. Eq. 6 is unconditional and gives only the zero endpoint; all nonzero-width variance claims are variances of the idealized ensemble, not of any concrete depth-L circuit. The paper states the premise and leaves the mixing depth unresolved (b233, b236), and its finite-depth probes (Fig. 12 re-uploading means; doped-chain empirical-to-Haar ratios 1.06/1.05/0.91 at n=6) do not establish convergence of Var_θ[fθ] to the Eq.-1 prediction for the baseline off-diagonal or matchgate schedules. Because the certificate's practical value is precisely to certify variance before circuit execution, this gap transfers directly to the paper's operational claim: an accepted rotation (Eq. 9) certifies Θ(1/n) under the 2-design ensemble, not under the depth-L circuit the user actually runs. All other potential concerns — per-input vs. mean purity (b154), pooled histogram non-uniformity (b363), non-BP-scaling training run (b275), numerically-verified-only exponential families — are stated by the authors and are not internal inconsistencies; they do not threaten the analytic content, which checks out. The 2-design premise is the hinge, it is acknowledged, and it is unresolved.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek/deepseek-v4-flash","summary":"The paper studies how the distribution of encoding angles controls the output variance of angle-encoded parameterized quantum circuits, framed through the DLA (g-)purity of the encoded input. For the matchgate algebra so(2n), it derives the closed form P_g(ρ) = (n-1) + ∏⟨Z_k⟩² (Eq. 2), showing every pure product input has purity in [n-1, n] and hence Var_θ = Θ(1/n) for the readout Z_i under Haar or exact group 2-design sampling. For the off-diagonal family g_od ≅ so(n)⊕so(n), it proves zero in-algebra output at computational-basis inputs for every parameter realization and every circuit depth (Eq. 6, unconditional), and mean purity E[P_god] = n/3 - 5/9 + O(2^{-n}) (Eq. 4) under independent uniform angles, giving mean variance Θ(1/n). It constructs a classical preprocessing certificate (Appendix C, Eqs. 7-9): a shared random rotation is accepted when the empirical mean purity from the closed form passes μ_n/2, with expected trials approaching 5, certifying dataset-mean variance Θ(1/n) under the stated ensemble. It further proves an exact mean-purity identity for dissociated weighted scalar encodings (Eq. 5) and studies numerically the extension to exponential-DLA graph families. All ensemble variance claims are explicitly conditional on trainable parameters reproducing Haar second moments or forming an exact group 2-design.","tokens_in":21377,"tokens_out":1706,"duration_ms":89042,"significance":"If the results stand, they provide a clean, parameter-free characterization of how input distributions govern output variation in Lie-algebra-supported ansatzes, with several concrete strengths. The closed forms (Eqs. 2, 3, 4) are analytic and verified against brute-force Pauli-basis summation; the zero-output identity (Eq. 6) is unconditional and holds for every circuit realization at the clustered endpoint; the acceptance test in Appendix C is classically computable in O(mn) time with a derived constant expected trial count; and the code is released for reproduction. The paper is also unusually scrupulous about its own scope, flagging that the certificate controls dataset-mean, not per-input, variance (b154, b361) and that the exponential-family statements are numerically verified only at small sizes (Table II daggers). The single load-bearing assumption is the Haar/2-design premise behind Eq. 1; every nonzero-width variance statement, including the certificate's guarantee, is a variance of that idealized ensemble rather than of any concrete depth-L circuit.","major_comments":[{"comment":"The certificate's operational guarantee is conditional on an unverified ensemble premise, and this is load-bearing for the paper's headline practical claim. Every accepted rotation certifies mean sample-wise variance Θ(1/n) 'for the specified readout and circuit ensemble', but that ensemble is the Haar or exact 2-design over the dynamical Lie group, and no finite-depth brickwork schedule that reproduces those second moments for the baseline off-diagonal or matchgate circuits is supplied. The authors acknowledge this directly (b233: 'It also presumes Haar or exact 2-design sampling'; b236: 'We therefore leave the mixing depth of the gate schedules studied here unresolved'), and the consistency evidence at finite depth is real but incomplete: the doped-chain ratios (1.06/1.05/0.91, n=6) and Fig. 12 do not establish convergence of Var_θ[f_θ] to the Eq.-1 prediction for the certificate's own schedule. Indeed, Fig. 12's uniform-branch multi-block variance at n=6 (0.031-0.038) lies below the single-block Haar prediction of roughly 0.096 from Eq. 1 with μ_6 = 14/9 and dim g_od = 30, so even the deepest probed schedule sits measurably short of its ensemble limit. As written, a user who runs the depth-L circuit actually at hand gets a certificate whose Θ(1/n) promise governs an idealized object unless the schedule happens to form a good 2-design. I recommend the authors either (i) supply a mixing-depth argument or explicit depth-convergence evidence for the certificate scenario, or (ii) rescope the claim in the abstract and conclusion—the sentence 'This certifies mean output variance of order 1/n for the off-diagonal family before circuit execution' currently carries no ensemble qualifier—so that the guarantee is stated as holding for the Haar/2-design ensemble, with a sentence explaining the practical status of the mixing-depth question.","section":"Sec. IIIc and Appendix C (Eqs. 7-9); cf. b233, b236","authors_acknowledge":"It also presumes Haar or exact 2-design sampling, or an approximation accurate enough to preserve the scaling.","authors_acknowledge_p":0.93}],"minor_comments":[{"comment":"The certificate sentence omits the ensemble condition that the body attaches to every such claim. Since the whole chain is conditional on 'Haar or exact group 2-design sampling', consider carrying that qualifier into the certificate sentence for consistency with the body's scoping.","section":"Abstract","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The caption should state explicitly that the two runs use differently labeled datasets (the text already notes this); as printed, the caption alone invites a reading in which the loss gap is attributed solely to the angle prior.","section":"Fig. 5 caption / Sec. IIId","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The sentence 'This range describes stability relative to the observed L=1 circuit and is not an equality with the single-block Haar prediction' is important for honest interpretation and deserves a place in the figure caption as well as the body text, so the measured 0.031-0.038 range is not misread as evidence of convergence to the Eq.-1 value.","section":"Fig. 12 discussion","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The conclusion states that for the exponential graph families 'input choice cannot remove the O(2^{-n}) variance cap' without the qualifier attached in Table II. Since the relevant simple-component structure for the doped chain is numerically verified only (and conjectured beyond n=9), consider adding the 'conditional on the conjectured component structure' phrase to the conclusion sentence for consistency with Table II's daggered entries.","section":"Conclusion (exponential families)","authors_acknowledge":null,"authors_acknowledge_p":null}],"recommendation":"major_revision"},"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"Dave —\n\nRead Strobl et al. on how angle-encoded input distributions shape output variance. Bottom line: the analytic core is sound, mostly new, and checked against brute force; the paper is unusually candid about its own limits; and the one real gap — the Haar/2-design ensemble premise behind every Theta(1/n) claim — is stated plainly but left open. Conditional, in the sense that the algebra holds and the operational promise outruns the proven ground.\n\nThe genuinely new pieces: the matchgate purity band [n-1, n] for every pure product input (Eq. 2), which gives per-input Theta(1/n) variance with the Zi readout, no averaging over inputs needed. The zero-output identity (Eq. 6): for the off-diagonal family, in-algebra output vanishes at computational-basis inputs for every circuit realization and every parameter choice — unconditionally, no design assumption. I checked the reasoning; it holds, because any string containing X or Y dies on computational-basis states under adjoint invariance. And the preprocessing certificate: shared SO(D) rotation, mean-purity threshold mu_n/2, Markov bound giving acceptance probability approaching 1/5 with constant expected trials. I re-derived the telescoping for Eq. 2 and the closed form mu_n = n/3 - 5/9; both check out. The brute-force sums over the full Pauli basis at small n and the shipped code are real evidence, not fits.\n\nThe soft spot, in proportion: the whole variance-and-certificate chain rests on Eq. 1 from Ragone et al., which presumes Haar or exact group 2-design sampling of the trainable parameters. The authors say exactly this (b233, b236) and leave the mixing depth of the gate schedules unresolved. So an accepted rotation certifies Theta(1/n) under the idealized ensemble, not under the depth-L circuit a user actually runs. The finite-depth probes do not close the gap: the re-uploading measurements in Fig. 12 sit in a range rather than at the ensemble prediction, and the doped-chain ratios (1.06, 1.05, 0.91 at n=6) represent a handful of draws. This is a premise about the sampling ensemble, not a flaw in the variance calculation itself — but it does make the paper's operational claim conditional on a design question left unanswered.\n\nEverything else is minor and mostly self-acknowledged: the training run does not establish BP scaling, the pooled histogram gives no per-site uniformity, and the exponential-family counts are purely numerical through n=8-9. None of these is an internal inconsistency.\n\nWho it's for: the barren-plateau and QML-preprocessing crowd. The certificate is a clean, classically-checkable diagnostic even with the ensemble caveat, and the zero-output identity will be useful on its own. It deserves a serious referee. Send it out.","headline":"Analytic core is sound and the zero-output identity is genuinely unconditional, but every Theta(1/n) variance and certificate claim hangs on the Haar/2-design ensemble premise the paper acknowledges and leaves unresolved.","tokens_in":20334,"tokens_out":2766,"duration_ms":19841},"pith_extraction":{"msc":["81P68","22E70"],"pacs":["03.67.-a"],"model":"deepseek/deepseek-v4-flash","headline":"Algebraic input purity decides whether an angle-encoded circuit's output variance survives at order 1/n or vanishes exactly; a classical shared-rotation test certifies the 1/n scaling before execution.","keywords":["barren plateaus","algebraic input purity","dynamical Lie algebra","angle encoding","output variance","matchgate circuits","preprocessing certificate","Pauli-string counting"],"falsifier":"Take the off-diagonal ansatz (god ≅ so(n)⊕so(n)) at a fixed moderate n with a depth-L brickwork schedule of XkXk+1 and YkYk+1 gates, draw parameters from the schedule's own distribution rather than from Haar, encode inputs with independent uniform angles, and measure the empirical variance of the readout XiXi+1 + YiYi+1 across parameter draws; if this variance deviates systematically from the Θ(1/n) prediction of Eq. 1 as n grows and the deviation persists over depth, the certificate's promise fails for that schedule. Simpler still, Eq. 6 is directly testable without any design assumption: a computational-basis input into the off-diagonal circuit should give exactly zero expectation for every parameter setting at any depth.","tokens_in":20567,"feed_emoji":"⚛️","tokens_out":6378,"duration_ms":36739,"temperature":0.7,"pith_summary":"The paper aims to explain why some angle-encoded parameterized quantum circuits show an output landscape that depends sharply on how classical data is encoded, and to turn that dependence into a usable preprocessing guarantee. Its central object is algebraic input purity: the squared overlap between the encoded state and the basis of the circuit's dynamical Lie algebra, which the circuit can neither create nor destroy. For the matchgate family (DLA so(2n)), this purity stays in the narrow band [n−1, n] for every pure product input, so with readout Zi the output variance is Θ(1/n) for all such inputs. For the off-diagonal family (DLA so(n)⊕so(n)), purity vanishes exactly at computational-basis inputs—zero output for every parameter value at any depth—while independent uniform angles restore mean variance Θ(1/n). The paper closes the loop with a fully classical certificate: a shared random rotation and polar-angle extraction pass a computable purity threshold with a constant expected number of trials, certifying mean variance Θ(1/n) before the quantum circuit is run.","feed_headline":"Input spread flips output variance between zero and 1/n","feed_subtitle":"Matchgates keep 1/n variance for all inputs, while off-diagonal circuits vanish at basis states; a classical test certifies recovery.","key_machinery":"The central object is algebraic input purity, Pg(ρ) = Σ_{P∈Bg} ⟨P⟩²_ρ, the sum of squared expectations of the Pauli-string basis of the dynamical Lie algebra g on the encoded state—the input's overlap with the operators the circuit can generate. It is carried by three pieces: the Lie-algebraic variance formula (Eq. 1, from Ragone et al. [21]), which gives Varθ[fθ] = Σ_j $P^{{HS}}$_{gj}(ρ)$P^{{HS}}$_{gj}(O)/dim gj for Haar or exact group 2-design sampling and shows a component contributes to variance only if both input and readout project onto it; the diagonal-Pauli-string count dA(g), which counts how many basis strings of ig survive on an eigenstate of the clustering observable A and equals the purity exactly at the clustered endpoint (dZ(god) = 0 marks the zero-output floor-free case); and the closed-form off-diagonal purity Eq. 3, a telescoping sum over odd-distance XX strings whose uniform-prior mean µn = n/3 − 5/9 (Eq. 4) is the target of the acceptance test. The acceptance test (Eqs. 7–9) uses linearity of expectation under the shared rotation together with Markov's inequality to bound the probability that the empirical mean purity passes µn/2, giving a classical O(mn) certificate check before any quantum circuit runs.","core_discovery":"On the paper's own terms, the discovery is that in angle-encoded product-state circuits the input distribution controls output variance through the input's overlap with the circuit's dynamical Lie algebra, and this control can flip the landscape between two extremes. For the matchgate ansatz (g ≅ so(2n)), the purity formula Pg(ρ) = (n−1) + ∏k ⟨Zk⟩² confines purity to [n−1, n] for every pure product input, giving output variance Θ(1/n) with readout Zi under Haar or exact group 2-design sampling. For the off-diagonal ansatz (god ≅ so(n)⊕so(n)), the diagonal-Pauli-string count dZ(god) = 0 identifies the computational-basis endpoint where ⟨a|U†OU|a⟩ = 0 for every circuit parameter realization at any depth (Eq. 6); the closed form Eq. 3 for Pgod and its uniform-prior mean µn = n/3 − 5/9 (Eq. 4) then give mean sample-wise variance Θ(1/n) under independent uniform angles. The supporting result is a classical preprocessing certificate: for any fixed dataset of nonzero inputs with at least 2n coordinates, a shared Haar rotation Q ∈ SO(D) followed by polar-angle extraction has dataset-mean purity whose Q-average is µn (Eq. 7), and accepting a rotation when the empirical mean passes µn/2 succeeds with probability approaching 1/5, so rejection sampling needs a constant expected number of trials (Eq. 8). Every accepted rotation certifies empirical mean sample-wise output variance Θ(1/n) for the specified readout and circuit ensemble before execution.","pith_inferences":["Because the zero-output statement (Eq. 6) holds per-circuit without any design assumption, that half of the paper is the more robust: any depth-L schedule on the off-diagonal ansatz must show exactly zero expectation on computational-basis inputs, independent of the unresolved mixing-depth question.","The acceptance-test structure is derived only for the off-diagonal chain, where a closed purity form and uniform-prior mean exist; extending the certificate to other floor-free algebras would require an analytic purity formula for each new family, which currently limits the method's reach.","A direct test of the design premise would simulate a depth-L brickwork off-diagonal circuit at moderate n under uniform angles and compare empirical output variance to the Θ(1/n) prediction; systematic deviation with depth would pinpoint where the certificate stops applying.","The learning-level implication is cautionary: the certificate guarantees mean sample-wise variance, not trainability—a dataset passing the test could still have zero per-input variance or label-mismatched outputs, so the method is a landscape diagnostic, not a performance predictor."],"forward_implications":["Any circuit family whose diagonal count dZ = 0 has exactly zero in-algebra output on computational-basis inputs at any depth and for every parameter choice, so training such a model on basis-aligned data starts from a constant loss equal to the mean squared target.","For the off-diagonal family under independent uniform angles, mean sample-wise output variance is Θ(1/n), so a data-encoding choice alone—not a circuit redesign—suffices to remove an exponentially small variance.","The matchgate family (DLA so(2n)) is provably protected: every pure product input keeps purity in [n−1, n], so no input-dependent preconditioning is needed for the Θ(1/n) scaling with readout Zi.","The certificate lets a practitioner verify classically, before running any quantum circuit, that an encoded dataset will produce inverse-polynomial mean output variance, complementing loss-based barren-plateau diagnostics.","Dissociated binary and ternary scalar encodings inherit the independent-angle mean purity exactly for uniform scalar inputs (Eq. 5), extending the protected scaling to single-parameter encodings."],"supporting_citations":[{"why":"Supplies the Lie-algebraic variance formula (Eq. 1, Theorem 1) on which all variance claims and the Haar/2-design sampling premise rest.","marker":"[21]"},{"why":"Classifies the off-diagonal algebra god ≅ so(n)⊕so(n) and gives its Pauli-string basis, the foundation of the purity closed form Eq. 3.","marker":"[29]"},{"why":"Establishes matchgate classical simulability, grounding the matchgate family's role as the analytically tractable baseline.","marker":"[11]"},{"why":"Provides the linearity-of-expectation and Markov-inequality machinery behind Eqs. 7–8 and the dissociation condition for weighted encodings.","marker":"[27]"},{"why":"Supplies the rotational-invariance facts on SO(D) that make polar-angle extraction yield independent uniform angles per input.","marker":"[17]"},{"why":"Gives the exponential dimensions and simple-ideal structure of the graph-based algebras used in the extension to larger algebras.","marker":"[12]"},{"why":"Provides the quantum Fourier model frequency-set framework used for the weighted scalar encodings.","marker":"[22]"}],"fun_headline_variants":["Input distribution decides quantum circuit variance extremes","Matchgate circuits keep variance, off-diagonal vanish at basis states","Quantum variance flips with input purity: zero to 1/n","Purity threshold certifies 1/n variance before circuit runs","How input spread controls angle-encoded circuit output variance"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The entire Θ(1/n) variance chain and the preprocessing certificate assume the trainable parameters are sampled so the circuit matches Haar second moments or forms an exact group 2-design on its dynamical Lie algebra—a premise the paper states but does not supply a finite-depth schedule to realize, as it leaves mixing depths unresolved.","fun_headline_variants_meta":{"raw":{"variants":["Input distribution decides quantum circuit variance extremes","Matchgate circuits keep variance, off-diagonal vanish at basis states","Quantum variance flips with input purity: zero to 1/n","Purity threshold certifies 1/n variance before circuit runs","How input spread controls angle-encoded circuit output variance"]},"model":"deepseek/deepseek-v4-flash","effort":"low","cost_usd":0.000166,"raw_usage":{"cost":0.000166488,"is_byok":false,"cost_details":{"upstream_inference_cost":0.000166488,"upstream_inference_prompt_cost":0.000134568,"upstream_inference_completions_cost":3.192e-05},"total_tokens":1280,"prompt_tokens":1166,"completion_tokens":114,"prompt_tokens_details":{"audio_tokens":0,"video_tokens":0,"cached_tokens":256,"cache_write_tokens":0},"completion_tokens_details":{"audio_tokens":0,"image_tokens":0,"reasoning_tokens":29}},"tokens_in":1166,"tokens_out":114,"cost_source":"openrouter_usage","duration_ms":2496,"image_pages":[],"temperature":1.0,"billed_attempts":1,"reasoning_tokens":29,"transport_provider":"openrouter","cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-10-02T14:28:58.648620+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":"Take the off-diagonal ansatz (god ≅ so(n)⊕so(n)) at a fixed moderate n with a depth-L brickwork schedule of XkXk+1 and YkYk+1 gates, draw parameters from the schedule's own distribution rather than from Haar, encode inputs with independent uniform angles, and measure the empirical variance of the readout XiXi+1 + YiYi+1 across parameter draws; if this variance deviates systematically from the Θ(1/n) prediction of Eq. 1 as n grows and the deviation persists over depth, the certificate's promise fails for that schedule. Simpler still, Eq. 6 is directly testable without any design assumption: a computational-basis input into the off-diagonal circuit should give exactly zero expectation for every parameter setting at any depth.","supporting_citations":[{"cited_title":"A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits","cited_arxiv_id":null,"evidence_quote":"Supplies the Lie-algebraic variance formula (Eq. 1, Theorem 1) on which all variance claims and the Haar/2-design sampling premise rest."},{"cited_title":"Classification of dynamical Lie algebras of 2-local spin systems on linear, circular and fully connected topologies","cited_arxiv_id":null,"evidence_quote":"Classifies the off-diagonal algebra god ≅ so(n)⊕so(n) and gives its Pauli-string basis, the foundation of the purity closed form Eq. 3."},{"cited_title":"Matchgates and classical simulation of quantum circuits","cited_arxiv_id":null,"evidence_quote":"Establishes matchgate classical simulability, grounding the matchgate family's role as the analytically tractable baseline."},{"cited_title":"Additive Combinatorics","cited_arxiv_id":null,"evidence_quote":"Provides the linearity-of-expectation and Markov-inequality machinery behind Eqs. 7–8 and the dissociation condition for weighted encodings."},{"cited_title":"The Random Matrix Theory of the Classical Compact Groups","cited_arxiv_id":null,"evidence_quote":"Supplies the rotational-invariance facts on SO(D) that make polar-angle extraction yield independent uniform angles per input."},{"cited_title":"Classification of Dynamical Lie Algebras Gen- erated by Spin Interactions on Undirected Graphs","cited_arxiv_id":null,"evidence_quote":"Gives the exponential dimensions and simple-ideal structure of the graph-based algebras used in the extension to larger algebras."},{"cited_title":"Effect of data encoding on the expressive power of variational quantum machine-learning models,","cited_arxiv_id":"2008.08605","evidence_quote":"Provides the quantum Fourier model frequency-set framework used for the weighted scalar encodings."}],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}