惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Last Week in AI
Last Week in AI
有赞技术团队
有赞技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
人人都是产品经理
人人都是产品经理
博客园 - 司徒正美
博客园 - 聂微东
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
罗磊的独立博客
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
V
Visual Studio Blog
T
Tailwind CSS Blog
大猫的无限游戏
大猫的无限游戏
Hugging Face - Blog
Hugging Face - Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
N
Netflix TechBlog - Medium
MyScale Blog
MyScale Blog
J
Java Code Geeks
L
LangChain Blog
S
SegmentFault 最新的问题
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Apple Machine Learning Research
Apple Machine Learning Research
G
Google Developers Blog

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Moment-Based Evidence for Simple Rational-Valued Hilbert-...
Paul B. Slater · 2011-09-13 · via math.ST updates on arXiv.org

Employing Hilbert-Schmidt measure, we explicitly compute and analyze a number of determinantal product (bivariate) moments |rho|^k |rho^{PT}|^n, k,n=0,1,2,3,..., PT denoting partial transpose, for both generic (9-dimensional) two-rebit (alpha = 1/2) and generic (15-dimensional) two-qubit (alpha=1) density matrices rho. The results are, then, incorporated by Dunkl into a general formula (Appendix D6), parameterized by k, n and alpha, with the case alpha=2, presumptively corresponding to generic (27-dimensional) quaternionic systems. Holding the Dyson-index-like parameter alpha fixed, the induced univariate moments (|rho| |rho^{PT}|)^n and |rho^{PT}|^n are inputted into a Legendre-polynomial-based (least-squares) probability-distribution reconstruction algorithm of Provost (Mathematica J., 9, 727 (2005)), yielding alpha-specific separability probability estimates. Since, as the number of inputted moments grows, estimates based on |rho| |rho^{PT}| strongly decrease, while ones employing |rho^{PT}| strongly increase (and converge faster), the gaps between upper and lower estimates diminish, yielding sharper and sharper bounds. Remarkably, for alpha = 2, with the use of 2,325 moments, a separability-probability lower-bound 0.999999987 as large as 26/323 = 0.0804954 is found. For alpha=1, based on 2,415 moments, a lower bound results that is 0.999997066 times as large as 8/33 = 0.242424, a (simpler still) fractional value that had previously been conjectured (J. Phys. A, 40, 14279 (2007)). Furthermore, for alpha = 1/2, employing 3,310 moments, the lower bound is 0.999955 times as large as 29/64 = 0.453125, a rational value previously considered (J. Phys. A, 43, 195302 (2010)).