{
 "artifacts": null,
 "category": "architecture",
 "description": "Insert a fixed expander channel before a covariance-dependent feature transformation. The channel repeatedly conjugates the feature covariance by a constant number of sparse Pauli/CNOT unitaries, preserving total feature energy while contracting anisotropic covariance components. Use the mixed covariance for whitening or as a regularized normalization statistic, and test whether it gives more stable training than dense whitening or an explicit isotropy penalty.",
 "formulas_latex": [
  "$$\\Phi(X)=\\frac{1}{m}\\sum_{i=1}^{m}U_i X U_i^\\dagger,$$",
  "$$\\|\\Phi(X)\\|_2\\leqslant(1-\\Delta)\\|X\\|_2\\qquad\\text{for }\\operatorname{Tr}X=0,$$",
  "$$\\bar C=\\frac{\\operatorname{Tr}(C)}{d}I_d,\\qquad \\|\\Phi^k(C)-\\bar C\\|_F\\leq (1-\\Delta)^k\\|C-\\bar C\\|_F,$$",
  "$$\\widetilde C=\\Phi^k(C)+\\varepsilon I_d,\\qquad y_b=\\widetilde C^{-1/2}(h_b-\\mu),\\quad C=\\frac1B\\sum_{b=1}^{B}(h_b-\\mu)(h_b-\\mu)^\\top.$$"
 ],
 "id": 3018,
 "implementation": "1. Integration point: choose a hidden tensor with channel width \\(d=2^n\\), initially \\(d=32\\) or \\(64\\). For a minibatch of activations \\(h_b\\in\\mathbb R^d\\) at one spatial position, token, or MLP layer, compute the centered covariance \\(C\\). Replace the covariance used by a whitening or covariance-based feature transform with \\(\\widetilde C=\\Phi^k(C)+\\varepsilon I\\). Keep mean subtraction unchanged. For the first MVP use \\(m=14\\) fixed generators and \\(k=1\\) or \\(2\\). Each generator is a binary linear map from the paper's \\(\\mathrm{SL}(3s;\\mathbb F_2)\\) construction; implement its action on channel coordinates as a sparse CNOT permutation, optionally composed with a diagonal Pauli sign flip. 2. Pseudocode: `mu = mean(h, batch); C = mean_b((h[b]-mu) @ (h[b]-mu).T); Cmix = zeros_like(C); for i in range(m): U = expander_generator[i]; Cmix += U @ C @ U.T; Cmix /= m; for t in range(1,k): Cnext = zeros_like(Cmix); for i in range(m): U = expander_generator[i]; Cnext += U @ Cmix @ U.T; Cmix = Cnext/m; Ctilde = Cmix + eps*I; y[b] = invsqrt(Ctilde) @ (h[b]-mu)`. Use eigendecomposition for the first experiment; later use 3--5 Newton-Schulz inverse-square-root iterations if runtime matters. 3. Compute from the paper: the conjugation map, trace preservation, sparse generators, and the predicted contraction factor \\((1-\\Delta)^k\\). Estimate empirically: minibatch anisotropy \\(\\|C-\\operatorname{Tr}(C)I/d\\|_F\\), post-mixing anisotropy, condition number of \\(\\widetilde C\\), gradient norms, and validation accuracy. Treat the theoretical \\(1/400\\) gap as a conservative reference and measure the effective contraction because the finite representation and generator subset may alter it. 4. First cheap experiment: train a 4-layer CIFAR-10 CNN or a 6-layer width-64 MLP on standardized CIFAR-10. Compare ordinary whitening, an explicit penalty \\(\\lambda\\|C-\\operatorname{Tr}(C)I/d\\|_F^2\\), and expander covariance mixing against BatchNorm or LayerNorm. Sweep \\(k\\in\\{1,2,4\\}\\) with identical seeds and optimizer settings. Record training-loss descent at equal FLOPs, validation accuracy, covariance anisotropy, whitening condition number, gradient clipping frequency, and wall-clock cost. Success means lower anisotropy and fewer unstable updates than unregularized whitening, with at most 20% extra wall-clock cost and either faster loss descent or higher validation accuracy at equal training budget.",
 "math_summary": "Definition 1.1 defines a quantum expander channel \\(\\Phi(X)=\\frac{1}{m}\\sum_{i=1}^{m}U_i X U_i^\\dagger\\), where \\(U_i\\in\\mathrm{U}(d)\\), \\(m\\) is the degree, and \\(X\\) is any \\(d\\times d\\) matrix. If \\(\\operatorname{Tr}X=0\\), the expander satisfies \\(\\|\\Phi(X)\\|_2\\le (1-\\Delta)\\|X\\|_2\\), where \\(\\|\\cdot\\|_2\\) is the Hilbert-Schmidt/Frobenius norm and \\(\\Delta\u003e0\\) is the spectral gap. Each conjugation preserves trace and the identity, so for a covariance matrix \\(C\\), defining \\(\\bar C=\\operatorname{Tr}(C)I_d/d\\), one obtains \\(\\|\\Phi^k(C)-\\bar C\\|_F\\le (1-\\Delta)^k\\|C-\\bar C\\|_F\\). The construction uses the representation \\(\\Gamma(g)|x\\rangle=|g x\\rangle\\) of \\(\\mathrm{SL}(n;\\mathbb F_2)\\), turning binary linear maps into computational-basis permutations implemented by CNOT gates. Fact 2.10 gives 14 generators \\(E_{a,b}(I_s)\\) and \\(E_{a,b}(A),E_{a,b}(B)\\) for adjacent block indices, while Theorem 2.11 states that the associated Cayley graph has gap greater than \\(1/400\\); over \\(\\mathbb F_2\\), these generators are involutions. In the neural adaptation, \\(C\\in\\mathbb R^{d\\times d}\\) is a minibatch feature covariance and the \\(U_i\\) are real signed/permutation matrices generated by sparse CNOT/Pauli actions.",
 "math_tags": [
  "spectral-theory",
  "linear-algebra",
  "representation-theory",
  "algebra"
 ],
 "ml_areas": [
  "mlp",
  "cnn",
  "regularization",
  "training-dynamics"
 ],
 "paper": {
  "arxiv_id": "2609.01605",
  "arxiv_url": "https://arxiv.org/abs/2609.01605",
  "summary_what_math_gives_to_ml": "The paper provides an explicit constant-degree quantum channel whose repeated conjugation contracts every traceless matrix component while preserving the identity component. The transferable asset is not quantum computation itself, but a sparse, norm-preserving mixing operator with a dimension-independent contraction rate, constructed from Pauli and CNOT gates. This can be turned into an expander-smoothed covariance module for neural features, isotropizing channel correlations using fixed sparse transformations rather than a learned dense transformation. The first implementation should target moderate channel widths, where the exact covariance update is cheap enough to compare against LayerNorm, whitening, and ordinary covariance penalties.",
  "title": "Depth-1 expanders on the unitary group and applications",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 8,
  "usefulness": 6
 },
 "solves": [
  "stability",
  "generalization",
  "accuracy"
 ],
 "title": "Quantum-Expander Covariance Mixer",
 "url": "https://synthcore.org/idea/3018/quantum-expander-covariance-mixer",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}