Stronger Welch Bounds and Optimal Approximate $k$-Designs

• URL: http://arxiv.org/abs/2602.13099v1
• Date: Fri, 13 Feb 2026 17:05:26 GMT
• Title: Stronger Welch Bounds and Optimal Approximate $k$-Designs
• Authors: Riccardo Castellano, Dmitry Grinko, Sadra Boreiri, Nicolas Brunner, Jef Pauwels,
• Abstract summary: A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space.<n>Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar moments.<n>We derive strengthened Welch-type inequalities that remain sharp in this regime by exploiting rank constraints from partial transposition and spectral properties of the partially transposed Haar moment operator.
• Score: 0.13048920509133805
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar moments. However, these bounds quickly become uninformative when the number of states is below that required for an exact $k$-design. We derive strengthened Welch-type inequalities that remain sharp in this regime by exploiting rank constraints from partial transposition and spectral properties of the partially transposed Haar moment operator. We prove that the deviation from the Welch bound captures the average-case approximation error, hence characterizing a natural notion of minimum achievable error at fixed cardinality. For $k=3$, we prove that SICs and complete MUB sets saturate our bounds, making them optimal approximate 3-designs of their cardinality. This leads a natural variational criterion to rule out the existence of a complete set MUBs, which we use to obtain numerical evidence against such set in dimension $6$. As a key technical ingredient, we compute the complete spectrum of the partially transposed symmetric-subspace projector, including multiplicities and eigenvectors, which may find applications beyond the present work.

Related papers

• Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry [0.0]
  We prove by a direct reduction from Hstad's theorem that no-time algorithm can exceed the randomassignment ratio $r/q$ by any constant.<n>This threshold coincides with the $ell/m to 0$ limit of the semicircle law governing decoded quantum interferometry.
  arXiv  Detail & Related papers  (2026-03-04T19:26:26Z)
• Sharp Inequalities for Schur-Convex Functionals of Partial Traces over Unitary Orbits [0.0]
  We show that we can find the equivalent quantities of the spectrum for partial trace information theory.<n>We also show that we can maximize the bounds for any Schuform upper bounds for any dimension functional.
  arXiv  Detail & Related papers  (2026-01-20T17:05:45Z)
• Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond [40.79840141270367]
  Given an unnormalized probability density $piproptomathrme-V$, estimating its normalizing constant $Z=int_mathbbRdmathrme-V(x)mathrmdx$ or free energy $F=-log Z$ is a crucial problem in Bayesian statistics, statistical mechanics, and machine learning.<n>We propose a new algorithm based on reverse diffusion samplers, establish a framework for analyzing its complexity, and empirically demonstrate its efficiency in tackling multimodality.
  arXiv  Detail & Related papers  (2025-02-07T00:05:28Z)
• Further Evidence for Near-Tsirelson Bell-CHSH Violations in Quantum Field Theory via Haar Wavelets [0.0]
  This paper investigates a recent construction using bumpified Haar wavelets to demonstrate explicit violations of the Bell-Clauser-Horne-Shimony-Holt inequality.<n>Although a complete proof remains elusive, we present further compelling evidence to support it.
  arXiv  Detail & Related papers  (2024-10-17T09:14:39Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Maximal Clauser-Horne-Shimony-Holt violation for qubit-qudit states [41.99844472131922]
  We evaluate the maximal Clauser-Horne-Shimony-Holt violation for a generic (typically mixed) qubit-qudit state.<n>This represents the optimal (2-2-2) Bell nonlocality for this kind of systems.
  arXiv  Detail & Related papers  (2024-04-02T16:40:57Z)
• One-shot holography [0.0]
  We prove that the min- and max-entanglement wedges obey various properties necessary for this conjecture. We extend both the frameworks of one-shot quantum Shannon theory and state-specific reconstruction to finite-dimensional von Neumann algebras.
  arXiv  Detail & Related papers  (2023-07-24T18:00:03Z)
• Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach [36.88301225561535]
  offline reinforcement learning aims to learn from pre-collected datasets without active exploration. Existing approaches adopt a pessimistic stance towards uncertainty by penalizing rewards of under-explored state-action pairs to estimate value functions conservatively. We show that the distributionally robust optimization (DRO) based approach can also address these challenges and is asymptotically minimax optimal
  arXiv  Detail & Related papers  (2023-05-22T17:50:18Z)
• The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions [6.675805308519987]
  The exact characterization of the slowest decrease of the mutual information with the distance to $Pi_mathcalA$ is determined on small neighborhoods of $Pi_mathcalA$.<n>Results for classical-quantum channels are established under separable output Hilbert space assumption for the quadratic bound and under finite-dimensional output Hilbert space assumption for the exact characterization.
  arXiv  Detail & Related papers  (2023-04-27T14:27:08Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize [41.38162218102825]
  This paper provides a non-asymptotic analysis of linear approximation (LSA) algorithms with fixed stepsize. We derive high probability bounds on the performance of LSA under weaker conditions on the sequence $(bf A_n, bf b_n): n in mathbbN*$. We show that our conclusions cannot be improved without additional assumptions on the sequence $bf A_n: n in mathbbN*$.
  arXiv  Detail & Related papers  (2021-06-02T16:10:37Z)
• Nonparametric approximation of conditional expectation operators [0.3655021726150368]
  We investigate the approximation of the $L2$-operator defined by $[Pf](x) := mathbbE[ f(Y) mid X = x ]$ under minimal assumptions. We prove that $P$ can be arbitrarily well approximated in operator norm by Hilbert-Schmidt operators acting on a reproducing kernel space.
  arXiv  Detail & Related papers  (2020-12-23T19:06:12Z)

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.