Fixed-PVM Born Rule Uniqueness from Fisher Non-Expansion and Operational Calibration

• URL: http://arxiv.org/abs/2604.27339v1
• Date: Thu, 30 Apr 2026 02:31:19 GMT
• Title: Fixed-PVM Born Rule Uniqueness from Fisher Non-Expansion and Operational Calibration
• Abstract summary: We prove that three primitives force the Born rule for this fixed measurement.<n>The main readout theorem is dimensionwise, fixed-PVM, and pure-state only.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fix a finite dimension $d \geq 2$ and a fixed rank-1 PVM $M=\{|e_1\rangle\langle e_1|,\ldots,|e_d\rangle\langle e_d|\}$ on ${\bf C}^d$. Let $P_M:\mathbb{CP}^{d-1}\toΔ^{d-1}$ be a readout map on pure states. We prove that three primitives force the Born rule for this fixed measurement: (i) square-root regularity of $R_M=\sqrt{P_M}$ along Fubini-Study geodesics, (ii) the universal readout Cramer-Rao bound $F_{\rm cl}\leq F_Q$ on smooth pure-state curves, and (iii) operational calibration on basis preparations $P_M([e_i])=δ_i$. The geometric core is a rigidity theorem for Fisher-non-expanding self-maps of the probability simplex: after conjugation by the square-root chart, such maps become round-metric 1-Lipschitz self-maps of the positive spherical orthant, and vertex fixing forces the identity. The main readout theorem is dimensionwise, fixed-PVM, and pure-state only. Escort-class Born uniqueness and the Markov/coarse-graining routes appear as corollaries or alternative routes.

Related papers

• Readout Orientation Controls Measurement-Accessible Quantum Tangent Geometry [0.0]
  A fixed quantum measurement can expose substantially more tangent information than a restricted observable readout retains.<n>We quantify retained tangent mass by $R=mathrmTr(PC)$.<n>The results isolate readout orientation as a degree of freedom invisible to rank alone.
  arXiv  Detail & Related papers  (2026-08-17T19:45:48Z)
• A Direct Route to Markov Chain Convergence via Asymptotic Equivalence with the Target [16.08983109077834]
  We give a self-contained proof of the Markov chain convergence theorem via a criterion called equivalence with the target.<n>A density version of this criterion is verified on general measurable spaces in three cases.<n>In all mentioned settings Birkhoff's ergodic theorem applies, so as to obtain the strong law of large numbers.
  arXiv  Detail & Related papers  (2026-08-04T09:03:20Z)
• The Condition-Number Barrier in Sparse Least Squares [77.64108812086542]
  In [AS21], Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in convex optimization cannot be improved by a sparse-time algorithm.<n>We establish their conjectured lower bound for least-squares objectives, conditional on the randomized exact-volume Small-Set Expansion Hypothesis.
  arXiv  Detail & Related papers  (2026-08-03T17:57:01Z)
• Which Coherence Decoheres? Basis-Dependent Decoherence Rates in Symmetry-Broken Collective Spin Systems [0.0]
  Lindblad dephasing rates differ by a factor approaching $2$ as $Ntoinfty$ and reaching $2.42$ near the quantum-critical crossover.<n>The discrepancy has a single algebraic origin: parity forces $langle E_i|hatJ_z|E_irangle=0$ exactly, eliminating the cross-term that doubles the localised-state rate.
  arXiv  Detail & Related papers  (2026-05-01T11:39:51Z)
• Third-Order Local Randomized Measurements for Finite-size Entanglement Certification [0.0]
  Entanglement is certified when its minimum eigenvalue $mathcalE_4()$ becomes negative.<n>We prove that all separable states satisfy $barmathfrakM()succeq0$, and that the sign of $mathcalE_4()$ can be inferred from single-copy randomized measurements.
  arXiv  Detail & Related papers  (2026-04-14T18:00:02Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• How well behaved is finite dimensional Diffusion Maps? [0.0]
  We derive a series of properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM)<n>We quantify the error between the estimated tangent spaces and the true tangent spaces over the submanifolds after the DM embedding.<n>These results offer a solid theoretical foundation for understanding the performance and reliability of DM in practical applications.
  arXiv  Detail & Related papers  (2024-12-05T09:12:25Z)
• Conformal geometry from entanglement [14.735587711294299]
  We identify a quantum information-theoretic mechanism by which the conformal geometry emerges at the gapless edge of a 2+1D quantum many-body system.<n>We show that stationarity of $mathfrakc_mathrmtot$ is equivalent to a vector fixed-point equation involving $eta$, making our assumption locally checkable.
  arXiv  Detail & Related papers  (2024-04-04T18:00:03Z)
• Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion [21.846732043706318]
  We show that the vanilla gradient descent provably converges to the ground truth $rmXstar$ without requiring any explicit regularization. Surprisingly, neither the convergence rate nor the final accuracy depends on the over- parameterized search rank $r'$, and they are only governed by the true rank $r$.
  arXiv  Detail & Related papers  (2024-02-09T19:39:23Z)
• 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)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• A first-order primal-dual method with adaptivity to local smoothness [64.62056765216386]
  We consider the problem of finding a saddle point for the convex-concave objective $min_x max_y f(x) + langle Ax, yrangle - g*(y)$, where $f$ is a convex function with locally Lipschitz gradient and $g$ is convex and possibly non-smooth. We propose an adaptive version of the Condat-Vu algorithm, which alternates between primal gradient steps and dual steps.
  arXiv  Detail & Related papers  (2021-10-28T14:19:30Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)
• Variance-Aware Confidence Set: Variance-Dependent Bound for Linear Bandits and Horizon-Free Bound for Linear Mixture MDP [76.94328400919836]
  We show how to construct variance-aware confidence sets for linear bandits and linear mixture Decision Process (MDP) For linear bandits, we obtain an $widetildeO(mathrmpoly(d)sqrt1 + sum_i=1Ksigma_i2) regret bound, where $d is the feature dimension. For linear mixture MDP, we obtain an $widetildeO(mathrmpoly(d)sqrtK)$ regret bound, where
  arXiv  Detail & Related papers  (2021-01-29T18:57:52Z)

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.