Geometric Optimization over Quantum State Spaces: Tight Uncertainty Relations and Resource Certification

The gist: This work introduces a generic support-function-based outer-approximation framework for solving concave-minimization (or convex-maximization) problems over quantum state space by mapping the problem onto a reduced Z-space and characterizing the exact quantum boundary through supporting half-spaces derived from the largest eigenvalues of effective observables.

How it works

The core methodology involves reformulating the general optimization problem, which seeks to find the exact bound f(A) = inf ρ F⟨A1⟩ρ · · ·,⟨Am⟩ρ (1) over all density operators ρ on the underlying Hilbert space, into an optimization over a reduced Z-space. This reduction is achieved by exploiting an affine reduction to a lower-dimensional Z-space and characterizing the feasible region through its dual representation. The set C(A) of accessible expectation value vectors is shown to be an affine image of the Bloch space B(π), which itself is related to the quantum state space D(H) via an affine mapping α(ρ) = s + Mr (6).

The optimization is then recast in terms of a reduced variable z over the feasible set Z = Z = min z∈Z F(α(z)) (8). The feasible set Z-space inherits compactness and convexity from the quantum state space. To tackle the implicit boundary of Z, the authors utilize the dual representation of convex sets, which is characterized by a support function σC(u) = sup α∈C(A) ⟨u, α⟩ = λmax (omega(u)) (10). This allows the set C to be expressed as the intersection of infinitely many half-spaces C = α ∈ R m ⟨u, α⟩ ≤ σC(u), ∀u ∈ R m (11). Substituting the affine relationship yields the dual representation of Z: z ∈ R r ⟨u, Qz⟩ ≤ σC(u) − ⟨u, s⟩, ∀u ∈ R m (12).

Outer-approximation algorithm of concave minimization

For concave minimization problems where F is a concave function [43], the algorithm approximates the feasible set Z by a sequence of shrinking polytopes Ck ⊃ C1 ⊃ · · · ⊃ Z. The procedure involves iterative steps to refine the approximation, as detailed in Algorithm 1.

The algorithm proceeds as follows:

1. Initialize: Construct affine basis (s, Q).

2. Initial Polytope: Build C0 with Box/Pair constraints derived from spectral limits of measurement operators.

3. Iteration Loop: While Gap > ϵ do.

4. Lower Bound via Vertices: Compute vertices Vk of Ck; z∗ ← arg min z∈Vk F(s + Qz); ppoly ← s + Qz∗, f− ← F(αpoly).

5. Upper Bound via Spectral Decomposition: Compute the gradient vector g = ∇F(αpoly); compute ψmin as ground state of omega(g) = P i giAi; αreal ← α(ψmin⟩), f+ ← F(αreal).

6. Cut Generation: Gap ← f+ − f−; if Gap ≤ ϵ then break. Add cut: −(g⊤Q)z ≤ fval + g⊤s. k ← k + 1.

Lower and Upper Bound Derivations

The lower bound for any outer polytope Ck is defined by minimizing the concave objective function F(α(z)) over the vertices Vk of the polytope, yielding f(A) ≥ min z∈Vk F(α(z)) = F(αpoly) = f− (A). The upper bound is established by mapping the optimal vertex z∗ to a feasible state inside Z by considering the effective Hamiltonian omega(g) = P i giAi, where ψmin⟩ is its ground state, leading to f(A) ≤ F(αreal) = f+(A) (15).

Tight entropic uncertainty relations

The method is applied to reformulate tight entropic uncertainty relations (EURs) as the minimization of an entropy functional associated with a single effective positive operator-valued measures (POVM) over the quantum probability space. This approach yields tight EUR bounds, substantially improving upon standard analytical and majorization-based bounds.

The comparison of optimal EUR bounds obtained from the proposed method with existing analytical and majorization-based bounds shows that for generic measurement settings, relying solely on the maximal overlaps and the second-largest c2, and even majorization technique that incorporate additional overlaps, are insufficient to characterize the complex boundary of the QPS. In contrast, our method precisely traces the optimal boundary.

Steering detection with asymmetric settings

The tighter entropic bounds translate directly into stronger robustness against white noise, enabling the certification of quantum steering in regimes where analytical or majorization-based bounds fail. Specifically, for isotropic states [47] with α = 2, the non-steerability condition simplifies to a visibility threshold η: η ≤ s 1 − d · q T 2 (A1, · · ·, AN) N(d − 1) (24). The results show that the tighter entropic bounds translate directly into stronger robustness against white noise, enabling the certification of quantum steering in regimes where analytical or majorizationbased bounds fail.

Certifiable athermality resource under the restricted measurements

The method is applied to determine the maximal athermality resource certifiable from a restricted measurement scenario. The certifiable athermality is naturally quantified by Wobs E(ρ) = β − 1 DKL(ρ) E(τβ) (26). This motivates the optimization problem: given a fixed measurement apparatus E, what is the largest athermality that it can detect? Wobs max(E) = β − 1 sup ρ DKL(ρ) E(τβ) (27) = β − 1 max p∈P(E) DKL(p∥E(τβ)) (28).

The method efficiently computes the certifiable athermality, revealing how the measurement noise level and the system temperature jointly govern the maximum detectable athermality with restricted measurements. The algorithm’s complexity is governed primarily by the reduced affine dimension r = rank(M) ≤ min[m, d2 − 1] rather than the underlying Hilbert space dimension d.

Computationally

The framework is driven by a support-function oracle u 7→ σC(u), which corresponds to finding the largest eigenvalue of an effective observable. As new constraints are iteratively added, the outer polytope converges to the true convex set in the Hausdorff metric, yielding strictly certified and shrinking bounds. The algorithm’s complexity is governed primarily by the reduced affine dimension r = rank(M) ≤ min[m, d2 − 1] rather than the underlying Hilbert space dimension d <ref:2602.

1. Bold header: Exact Bound Certification for Nonlinear Functionals

By employing a generic support-function-based outer-approximation framework, AI systems can determine tight bounds for general measurements in finite-dimensional quantum systems with preassigned numerical precision by iteratively enclosing the true quantum boundary within a sequence of shrinking polytopes, thus avoiding local minima issues.

2. Bold header: Efficient Calculation of Entropic Uncertainty Relations (EURs)

The method allows for the efficient computation of optimal entropic uncertainty relations by reformulating them as the minimization of an entropy functional associated with a single effective positive operator-valued measures (POVM) over the quantum probability space, which yields tight EUR bounds, substantially improving upon standard analytical and majorization-based bounds.

3. Bold header: Enhanced Quantum Steering Detection

The derived tighter entropic bounds directly translate into stronger robustness against white noise, enabling the certification of quantum steering in regimes where analytical or majorization-based bounds fail, which is crucial for detecting quantum correlations under asymmetric measurement settings.

4. Bold header: Certifiable Athermal Resource Quantification

The framework can be applied to determine the maximal athermality resource certifiable from a restricted measurement scenario by reformulating the problem as minimizing DKLE(ρ) E(τβ) over the reduced Z-space, providing a tool to quantify extractable work under limited observational access.

5. Bold header: Generalization Across Measurement Settings

The methodology provides a universal computational tool for exploring the boundaries of quantum state space and the limits of quantum resources, allowing AI models to characterize complex geometric boundaries for any set of measurement operators by mapping them onto a reduced Z-space.

Determining the fundamental limits of nonlinear functionals of quantum measurement statistics is a crucial yet generally intractable nonconvex optimization problem. We introduce a generic support-function-based outer-approximation framework for solving concave-minimization (or convex-maximization) problems over the quantum state space. By mapping the problem onto a reduced Z space, we characterize the exact quantum boundary through supporting half space derived from the largest eigenvalues of effective observables. This yields an effective method that produces tight bounds for general measurements in finite-dimensional quantum systems with preassigned numerical precision. As an initial application, we recover the exact variance-based uncertainty relations of [PRL 119, 170404 (2017)] and efficiently compute optimal entropic uncertainty relations (EURs). Our results reveal that standard analytical and majorization-based EUR bounds are fundamentally loose for generic measurements, and we show that the resulting exact bounds directly enhance quantum steering detection under asymmetric settings. We further apply the framework to determine the maximal athermality resource certifiable from a restricted measurement scenario. Our method thus provides a universal computational tool for exploring the boundaries of quantum state space and the limits of quantum resources.