Full-state information-disturbance tradeoff for direction estimation with antiparallel spin-coherent pairs

• URL: http://arxiv.org/abs/2606.18040v1
• Date: Tue, 16 Jun 2026 15:17:37 GMT
• Title: Full-state information-disturbance tradeoff for direction estimation with antiparallel spin-coherent pairs
• Abstract summary: We determine the optimal information--disturbance tradeoff for estimating an unknown direction encoded in two antiparallel spins.<n>We also formulate the parallel benchmark and, as a central extension of the method, treat antiparallel spin-coherent states of arbitrary spin $j$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We determine the optimal information--disturbance tradeoff for estimating an unknown spatial direction encoded in two antiparallel spins. Rotational covariance reduces the optimization over all instruments to a finite-dimensional Choi problem: a positive seed operator obeys one trace constraint for each irreducible sector of the input representation, while both the directional score and the operation fidelity are linear functionals of this seed. For two antiparallel spin-$1/2$ particles, whose physical representation decomposes as $0\oplus1$, we derive the two-multiplier dual problem and characterize the optimal instrument from the kernel vectors of the dual slack operator. The optimal operation is a covariant filter with scalar--vector coherence and is generally not a convex interpolation between the identity channel and a measure-and-reprepare strategy. At maximum information we recover the Gisin--Popescu score, but the least disturbing output state is optimized independently, giving a smaller disturbance than both the parallel-spin benchmark and antiparallel measure-and-reprepare. We also formulate the parallel benchmark and, as a central extension of the method, treat antiparallel spin-coherent states of arbitrary spin $j$. In this case the signal coherently occupies all sectors $\ell=0,\ldots,2j$ of $j\otimes j$, the endpoint information is governed by nearest-neighbor sector coherences, and the endpoint disturbance is obtained from an explicit finite block-diagonal eigenvalue problem.

Related papers

• Conditional Total Correlation and the Serial Depth of Adaptive Parallel Sampling [6.705150928866435]
  We show that a pseudo-cost distinguishes deployed decoding rules and that its policy rankings agree closely with the quality of self-sampled outputs.<n> Experiments with a masked diffusion language model show that the pseudo-cost distinguishes deployed decoding rules and that its policy rankings agree closely with the quality of self-sampled outputs.
  arXiv  Detail & Related papers  (2026-08-26T08:16:24Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• Pseudospectral Bounds for Transient Amplification in Coupled Gradient Descent [0.0]
  We develop a pseudospectral theory for block-triangular Jacobians.<n>We show that the Kreiss constant satisfies $K(J) leq 2/ (1-) + |C|/(4 (1-))$ when the diagonal blocks are symmetric with spectral radii at most $ 1$.<n>Experiments on linear-quadratic problems, IQC-based comparisons, and neural-network training confirm the theory.
  arXiv  Detail & Related papers  (2026-06-01T20:42:04Z)
• Optimization over the intersection of manifolds [8.902244235284229]
  We prove that the regularities -- clean intersection and intrinsicity -- are equivalent, which yields a tractable projection onto the tangent space of the intersection.<n>We propose a geometric method that employs a retraction on only one manifold and updates the intersection along two directions.<n>Under intrinsicity, we derive the convergence rate for both the feasibility and optimality measures, and show that every accumulation point is first-order stationary.
  arXiv  Detail & Related papers  (2026-05-21T17:08:00Z)
• Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs [0.0]
  Block-coupled regular graphs can realize prescribed complex quantum-like bit states as exact synchronized eigenstates.<n>We show that exact discrete Hermitian realizations are dense in the synchronized pure-state space.
  arXiv  Detail & Related papers  (2026-04-27T03:09:53Z)
• Approximating Uniform Random Rotations by Two-Block Structured Hadamard Rotations in High Dimensions [0.8307668828380427]
  Uniform random rotations are a useful primitive in applications such as fast Johnson-Lindenstrauss embeddings, kernel approximation, communication-efficient learning, and recent AI compression pipelines.<n>A common practical replacement is repeated structured random rotations built from Walsh-Hadamard transforms and random signs.<n>Applying the structured random rotation twice has been shown empirically to be useful, but the supporting theory is still limited.
  arXiv  Detail & Related papers  (2026-04-25T19:22:42Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Transformers as Support Vector Machines [54.642793677472724]
  We establish a formal equivalence between the optimization geometry of self-attention and a hard-margin SVM problem. We characterize the implicit bias of 1-layer transformers optimized with gradient descent. We believe these findings inspire the interpretation of transformers as a hierarchy of SVMs that separates and selects optimal tokens.
  arXiv  Detail & Related papers  (2023-08-31T17:57:50Z)
• Optimal State Manipulation for a Two-Qubit System Driven by Coherent and Incoherent Controls [77.34726150561087]
  State preparation is important for optimal control of two-qubit quantum systems. We exploit two physically different coherent control and optimize the Hilbert-Schmidt target density matrices.
  arXiv  Detail & Related papers  (2023-04-03T10:22:35Z)
• Fused-Lasso Regularized Cholesky Factors of Large Nonstationary Covariance Matrices of Longitudinal Data [0.0]
  smoothness of the subdiagonals of the Cholesky factor of large covariance matrices is closely related to the degrees of nonstationarity of autoregressive models for time series and longitudinal data. We propose an algorithm for sparse estimation of the Cholesky factor which decouple row-wise.
  arXiv  Detail & Related papers  (2020-07-22T02:38:16Z)

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.