A geometric Fano--Procrustes framework for purification-based distances and quantum channels analysis

• URL: http://arxiv.org/abs/2605.18485v1
• Date: Mon, 18 May 2026 14:36:56 GMT
• Title: A geometric Fano--Procrustes framework for purification-based distances and quantum channels analysis
• Abstract summary: We develop a purification-based geometric framework for the analysis of mixed qubit states and qubit channels.<n>For a fixed one-qubit mixed state, the freedom in the choice of purification can be parametrized by proper rotations acting on the ancillary degrees of freedom.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work we reformulate the Uhlmann purification-overlap optimization and develop a purification-based geometric framework for the analysis of mixed qubit states and qubit channels. Using the Fano representation of two-qubit pure states, a purification is described in terms of the Bloch vector of the system, the ancilla Bloch vector, and a real correlation matrix. For a fixed one-qubit mixed state, the freedom in the choice of purification can be parametrized by proper rotations acting on the ancillary degrees of freedom. As a result, the optimization over purifications entering the definition of the metric \(D_N\) introduced in Ref.~\cite{Lamberti2009} is reduced to an orthogonal Procrustes problem on the Lie group \(SO(3)\). This reduction yields not only the maximal purification overlap, but also the optimal rotation relating the purification frames. From this rotation we define a purification misalignment angle \(Θ\), which provides geometric information not contained in scalar fidelity-based distinguishability measures. The formalism is applied to representative qubit channels, including depolarizing, bit-flip, phase-flip, amplitude-damping channels, and an imperfect quantum NOT gate. For symmetry-adapted evolutions preserving the Bloch-vector direction, the optimal rotation is trivial and \(Θ=0\), whereas noncollinear channel actions generate a nonzero misalignment. The pair \((D_N,Θ)\) therefore separates the magnitude of the maximal purification overlap from the geometric reorientation of the optimal purification frames. Since the optimal Procrustes rotation can be lifted to a local unitary acting on the ancilla, the construction also provides an operational interpretation of the optimal purification in terms of an ancilla-side transformation.

Related papers

• Pauli-Sparse regularised Counterdiabatic Shortcuts for Linear-Ramp QAOA [0.0]
  Combinatorial optimization is a leading target for quantum algorithms.<n> finite-depth QAOA can suffer from strong diabatic errors when the Hamiltonian has small, or exponentially small, spectral gaps.<n>We propose a Pauli-sparse counterdiabatic extension of linear-ramp QAOA based on the regularised adiabatic gauge potential.
  arXiv  Detail & Related papers  (2026-06-26T18:41:15Z)
• Representation-Induced Symmetry Trapping in Adaptive Variational Quantum Simulations of Multi-Reference Topologies [0.0]
  We evaluate a spin-conserved SUSD operator pool across highly stretched configurations.<n>We show that the preservation of point-group symmetry structurally protects the optimization landscape.<n> exploiting structural overlap within our pool, we introduce a co-variance-driven, adaptive shot-allocation filter.
  arXiv  Detail & Related papers  (2026-06-11T14:16:11Z)
• 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)
• Gradient-Free Noise Optimization for Reward Alignment in Generative Models [52.42087778653147]
  ZeNO is a gradient-free framework that formulates noise optimization as a path-integral control problem.<n>It enables effective inference-time scaling and demonstrates strong performance across diverse generators and reward functions.
  arXiv  Detail & Related papers  (2026-05-12T00:05:36Z)
• Why Self-Supervised Encoders Want to Be Normal [0.0]
  We show that the preference for normal distributions in self-supervised encoders is a direct consequence of the Information Bottleneck (IB) principle.<n>Under this framework, we show that latent representations correspond to soft clustering of inputs sharing similar predictive distributions.<n>This perspective unifies a wide range of existing supervised and less-supervised objectives and provides a principled explanation for commonly used regularization schemes.
  arXiv  Detail & Related papers  (2026-04-30T11:33:05Z)
• Exact Law of Quantum Reversibility under Gaussian Pure Loss [2.0305676256390934]
  We show that the quantum version of this principle obeys an exact law with a sharp phase boundary.<n>For Gaussian pure-loss dynamics, the exact cost is additive in a canonical set of mode-resolved data.<n>These results establish an exact law of quantum reversibility in the canonical pure-loss setting.
  arXiv  Detail & Related papers  (2026-03-19T15:24:06Z)
• 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)
• Unit-Consistent (UC) Adjoint for GSD and Backprop in Deep Learning Applications [0.0]
  We formulate the invariance requirement at the level of the backward adjoint/optimization geometry.<n>By replacing the Euclidean-level recipe, we derive a Unit-consistent gauge descent and backprogation.
  arXiv  Detail & Related papers  (2026-01-15T21:58:04Z)
• Restarted contractive operators to learn at equilibrium [0.0]
  We introduce an algorithm that combines a restart strategy with JFB computed by AD and we show that the learned steps can be made arbitrarily close to the optimal DEQ framework.<n>We show that this method is effective for training weights in weighted norms; stepsizes and regularization levels of Plug-and-Play schemes; and a DRUNet denoiser embedded in Forward-Backward iterates.
  arXiv  Detail & Related papers  (2025-06-16T08:38:56Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Characterization of variational quantum algorithms using free fermions [0.0]
  We numerically study the interplay between these symmetries and the locality of the target state. We find that the number of iterations to converge to the solution scales linearly with system size.
  arXiv  Detail & Related papers  (2022-06-13T18:11:16Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)

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.