Difference-Set Weyl Channels: Exact Capacity, Optimizer Bifurcation, and Scalable Entanglement Separation

• URL: http://arxiv.org/abs/2608.20726v1
• Date: Fri, 21 Aug 2026 04:15:10 GMT
• Title: Difference-Set Weyl Channels: Exact Capacity, Optimizer Bifurcation, and Scalable Entanglement Separation
• Abstract summary: In odd local $D$, complete Wigner positivity yields phase-space dynamics on Wigner-nonnegative states but does not control signed inputs, entanglement across channel uses, or collective decoding.<n>We use a subsystem-trivial Weyl decomposition to characterize the equality conditions of the tensor-stable output-purity bound.<n>For an identity-dephasing profile we determine the exact-power collision-entropy phase diagram, derive rigorous capacity bounds, and isolate a distinct von Neumann crossover.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In odd local dimension $D$, complete Wigner positivity yields stochastic phase-space dynamics on Wigner-nonnegative states but does not control signed inputs, entanglement across channel uses, or collective decoding. Using a subsystem-resolved Weyl decomposition, we characterize the equality conditions of the tensor-stable output-purity bound. Cyclic difference sets are precisely the uniform shift supports saturating the universal Parseval lower bound on the worst nontrivial collision mode. For factorized shift--phase noise with shift support $R$, $|R|=r$, and phase distribution $h$ of no larger collision radius, we obtain $S_{α,\min}(Φ_{R,h}^{\otimes n})=n\log_2 r$ for all $n\ge1$ and $0\leα\le2$, the unrestricted capacity $C=\log_2(D/r)$, and a finite-blocklength strong converse. For a balanced bi-difference-set interpolation $h_\varepsilon=(1-\varepsilon)q_H+\varepsilon u_D$, the unassisted capacity is constant for $0\le\varepsilon\le1$, while the Choi state is NPT for every $\varepsilon<1$ and becomes entanglement breaking at $\varepsilon=1$. At $\varepsilon=0$, all tensor-power minimum-output states are products with local factors in one of two mutually unbiased Weyl bases; for $\varepsilon>0$, only the computational basis remains. For Singer parameters $D=q^2+q+1$ and $r=q+1$, $C_{\mathrm E}/C\to2-\varepsilon$. Finally, for an identity--dephasing profile we determine the exact tensor-power collision-entropy phase diagram, derive rigorous capacity bounds, and isolate a distinct von Neumann crossover, with a tensor-power R'enyi conjecture supported by numerics. Thus complete Wigner positivity can coexist with persistent channel entanglement and a scalable entanglement-assisted advantage.

Related papers

• Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory [0.0]
  Asymptotic matching predicts a bias-induced crossover in the region $1-2q=O( N/Nl n/2rfloor-1)$.<n>Activity-dependent control potential that cancels the conditional crosstalk mean restores the $Nn-1/ln N$ capacity for fixed $0q1/2$.
  arXiv  Detail & Related papers  (2026-09-15T17:16:38Z)
• Low-Dimensional Embeddings for Gaussian Kernels on Manifolds [0.42970700836450487]
  We show that for points in a $d$-dimensional Euclidean ball in $mathbb RN$, $t=((d/varepsilon2)log(dR/varepsilon))$ features suffice to preserve all pairwise Gaussian kernel distances.<n>We also prove a topological consequence: under the same RFF embedding, persistent homology is preserved in the sense that weighted Cech and Rips filtrations built from Gaussian kernel power distance are $(pmvarepsilon_star)$-interleaved.
  arXiv  Detail & Related papers  (2026-09-14T08:00:56Z)
• Weak Typicality of von Neumann Entanglement Entropy in Gaussian Boson Sampling [2.8224889996383395]
  We study the von Neumann entanglement entropy generated by a Haar distributed passive interferometer acting on $n$ equally squeezed input modes with fixed nonzero squeezing strength $s$.<n>For subsystem of $k_n$ modes satisfying $k_n/nto rin(0,1)$, we prove that, for every $varepsilon>0$ and all sufficiently large $n$, $mathbbPleft(left|fracS_1,nmathbbES_1,n$ to $1$, a typical
  arXiv  Detail & Related papers  (2026-08-18T02:04:28Z)
• The Physical Cutoff Does Not Restore Homogenization: Phase-Dependent Burning in the Strain G-Equation [2.538209532048867]
  We prove that for any $C2$ incompressible periodic flow, every $varepsilon$-outward barrier certificate has covering radius at most $2dvarepsilon$ for all sufficiently small $varepsilon$.
  arXiv  Detail & Related papers  (2026-08-15T17:41:14Z)
• The Sample Complexity of Distributionally Robust PAC Learning under Cressie--Read Divergences [4.588028371034407]
  We study robust PAC learning for the $0$--$1$-loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order $k>1$ and radius $geq 0$.<n>For hypothesis classes with VC dimension $d$, we establish realizable and agnostic sample-complexity bounds tight up to constant and logarithmic factors.
  arXiv  Detail & Related papers  (2026-08-05T10:53:13Z)
• Tikhonov-regularised projected gradient flow for equality-constrained bilinear quantum control [0.0]
  We study a projection-type gradient flow for equality-constrained control objective on $mathcalH=L(0,T;mathbbR)$.<n>We replace $$ with $_varepsilon:=+varepsilon2I$ and prove: (i) an exact spectral identity giving $(_varepsilon)=(_min2+varepsilon2)$; (ii) objective monotonicity $mathrmdJ/
  arXiv  Detail & Related papers  (2026-04-29T12:53:58Z)
• Rényi exponent landscape of multipartite entanglement in free-fermion systems [51.56484100374058]
  We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
  arXiv  Detail & Related papers  (2026-03-09T22:27:00Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Efficient Sampling of Stochastic Differential Equations with Positive Semi-Definite Models [91.22420505636006]
  This paper deals with the problem of efficient sampling from a differential equation, given the drift function and the diffusion matrix. It is possible to obtain independent and identically distributed (i.i.d.) samples at precision $varepsilon$ with a cost that is $m2 d log (1/varepsilon)$ Our results suggest that as the true solution gets smoother, we can circumvent the curse of dimensionality without requiring any sort of convexity.
  arXiv  Detail & Related papers  (2023-03-30T02:50:49Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
  Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector. We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
  arXiv  Detail & Related papers  (2020-06-12T10:21:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.