Ancilla-Depth Phase Diagrams for Quantum Reference-Frame Comparison

• URL: http://arxiv.org/abs/2607.12947v1
• Date: Tue, 14 Jul 2026 16:35:26 GMT
• Title: Ancilla-Depth Phase Diagrams for Quantum Reference-Frame Comparison
• Abstract summary: For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA-1.<n>Results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Comparing two noisy quantum reference frames as statistical experiments depends on the dimension of the ancillary memory available to the decision procedure. For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA^{-1}. The hierarchy can be realized by physical channel pairs: every unital, trace-preserving map that is k-positive but not (k+1)-positive embeds as the factor between the channels D_a and Gamma composed with D_a on an exact interval determined by the smallest Choi eigenvalue. For depolarizing source and target channels D_a and D_b, including negative and singular source parameters, the phase boundary is $\mathcal{D}_a \succeq_r \mathcal{D}_b \Longleftrightarrow -1/(dr-1) \leq b/a \leq 1$ for $a\neq 0$. We derive closed formulas for the restricted level-r deficiency and for the distance to every physical post-processing, $δ_{\mathrm{phys}}(\mathcal{D}_b\mid\mathcal{D}_a)=(1-1/d^2)\operatorname{dist}(b,I_a)$, where $I_a=\operatorname{conv}\{a,-a/(d^2-1)\}$. The largest physical conversion cost hidden from all tests through level k is $(d-k)/[d(d^2-1)]$. An untouched m-level spectator changes the first detecting external level from k+1 to $\lfloor k/m\rfloor+1$. A transpose--depolarizing construction shows that the separation is not confined to depolarizing factors. The results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.

Related papers

• Same Flow, Different Paths: Variance Reduction in Flow Matching [67.12978375116599]
  We study the choice of this path from an optimization perspective.<n>Our main finding is that the choice of path $g_t$ can fundamentally change the convergence rate of SGD.
  arXiv  Detail & Related papers  (2026-09-15T15:01:04Z)
• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Research Report on Noise-Shaped One-Bit Coefficients in Discrete Polynomial Fourier Extension [0.0]
  This report studies noise-shaped one-bit coefficients in normalized discrete Fourier extension.<n>For first-order Sigma- quantization, the error is written as $e_k=u_k-q_k=v_k$ with a uniformly bounded state.<n>For the parabolic $_x,t()=x+t2$, the bound is expressed through $J(x,t)=int_01 |x+2t|d$, and the uniform $N-1$ rate is shown to be sharp.
  arXiv  Detail & Related papers  (2026-07-26T21:51:41Z)
• Exponential Reduction of Mesh Dependence in Quantum Estimation of Parabolic PDE Observables [3.3636842548621275]
  We develop a quantum PDE algorithm that estimates linear and quadratic observables and places fine-coarse cancellation inside the circuit before measurement.<n>We also give a non-Fourier realization based on energyorthogonal dyadic midpoint details in one dimension.
  arXiv  Detail & Related papers  (2026-07-20T16:09:24Z)
• Analytic properties of cross-click operators in passive multi-basis photodetection: monotonicity, exact convergence rates, and dimension reduction for quantum key distribution [0.0]
  Cross-click operators, the POVM elements for simultaneous clicks in detectors assigned to different measurement bases, are used in QKD and entanglement-verification analyses.<n>This work gives an analytic characterization for passive linear-optical analyzers with arbitrary efficiency mismatch and dark counts.
  arXiv  Detail & Related papers  (2026-07-05T09:15:41Z)
• Is Spurious Correlation Removal Always Learnable? [56.28155520961125]
  Invariant learning can fail even when the structure is statistically identifiable.<n>We show a conditional computational barrier: under a black-box samplable supervised sparse recovery primitive, there exist emphamplable multi-dimensional environments.<n>Synthetic and real datasets illustrate the predicted gaps and transitions and motivate simple diversity diagnostics.
  arXiv  Detail & Related papers  (2026-06-11T05:49:43Z)
• Non-Perturbative Closed Form for the Typical Bipartite Mutual Information of Haar-Random States [7.7281318046635015]
  This quantity admits a single non-perturbative closed form.<n>$langle I(A:B)rangle = (d_A2-1)(d_B2-1),mathcalG(d_A,d_B,d_E)$, where $mathcalG$ is given by an explicit convergent integral over a Bose--Einstein kernel.
  arXiv  Detail & Related papers  (2026-05-28T10:19:40Z)
• Learning manifold diffusion semigroups from graph transition matrices [18.784763748323513]
  We show that the manifold heat semigroup $Q_t = et$ can be approximated directly by iterating the graph transition matrix $P$.<n>We numerically demonstrate the performance of the proposed estimator on simulated data.
  arXiv  Detail & Related papers  (2026-05-25T03:20:11Z)
• Emergent Distance and Metricity of Mutual Information in 1D Quantum Chains [0.0]
  Calibrating with the Euclidean benchmark (I(r)propto r-2mapsto d_E(r)propto r) makes the triangle-inequality test parameter-free and scale-invariant.<n>We establish a criterion linking the decay of (I(r)) to metric behavior of (d_E(r)): power laws (I(r)) with (0Xle 2) yield subadditivity (metric scaling), while exponential clustering leads to superaddit
  arXiv  Detail & Related papers  (2025-07-13T19:00:06Z)
• Measurement-induced phase transition for free fermions above one dimension [46.176861415532095]
  Theory of the measurement-induced entanglement phase transition for free-fermion models in $d>1$ dimensions is developed. Critical point separates a gapless phase with $elld-1 ln ell$ scaling of the second cumulant of the particle number and of the entanglement entropy.
  arXiv  Detail & Related papers  (2023-09-21T18:11:04Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Differentially Quantized Gradient Methods [53.3186247068836]
  We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$. No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
  arXiv  Detail & Related papers  (2020-02-06T20:40:53Z)

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.