Afham @afhamash.bsky.social · 01/10/2026FPLS has fast classical postprocessing, is rank-preserving, and converges at 1/N. The rank-preservation allows one to return channel estimates with low rank, where that is desirable. This, and other properties, make FPLS particularly good at QPT of low Choi rank channels. 000
Afham @afhamash.bsky.social · 01/10/2026Just compose it with partial normalization, which is the Choi-fidelity projection onto CPTP maps! We then propose Fidelity Projected Least Squares QPT--lift the PLS-QST algorithm using the partial normalization. 100
Afham @afhamash.bsky.social · 01/10/2026New preprint with @sayantansen.bsky.social and @marcotomamichel.bsky.social!! In Fast and Sure-ious QPT, we describe a simple and rigorous way to lift any QST algorithm (in fidelity) to a QPT algorithm, while allowing for all guarantees to transfer! scirate.com/arxiv/2609.3... 122
Afham @afhamash.bsky.social · 04/09/2026This and more available at scirate.com/arxiv/2609.0... arxiv.org/abs/2609.03762scirate.com 000
Afham @afhamash.bsky.social · 04/09/2026For the invariant matrix projection, which generalizes the BW RGD and other optimization problems in quantum information, we should that the FP algorithm corresponds to RGD on the submanifold of invariant (symmetric) PSD matrices. 110
Afham @afhamash.bsky.social · 04/09/2026Our fix is simple, just project! We derive a closed-form BW projection onto the set of well-conditioned PSD matrices. We show the projection is non-expansive and given by eigenvalue clipping. Consequently, the projected RGD algorithm achieves dim. independent linear convergence at η = 1! 100
Afham @afhamash.bsky.social · 04/09/2026The std. approach works well in practice but theoretical analyses present a dichotomy: unit step-size (η = 1) analyses carry a dimension-dependent factor; for dim.-independence, one must choose small step sizes of η = O(1/κ). Empirically the algorithm does not exhibit dim.-depend., even at η = 1. 100
Afham @afhamash.bsky.social · 04/09/2026We present a Projected RGD algorithm for two problems, the BW barycenter and the invariant projection problem. The standard approach for these problems is a fixed-point algorithm that can be identified as an RGD on the BW manifold at unit step size. This approach works extremely well in practice. 100
Afham @afhamash.bsky.social · 04/09/2026New preprint out! Paradoxical: both my first 'solo-authored' and first LLM-assisted paper. Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size scirate.com/arxiv/2609.0... Also an ML paper with applications to QI? 110
Reposted by AfhamarXiv bot (quant-ph) @krxiv-quant-ph.bsky.social · 18/02/2026Entanglement in the Dicke subspace arxiv.org/pdf/2602.15800 Aabhas Gulati, Ion Nechita, Clément Pellegrini.arxiv.orghttps://arxiv.org/abs/2602.15800arXiv abstract link 032
Reposted by AfhamarXiv bot (quant-ph) @krxiv-quant-ph.bsky.social · 17/02/2026Projections with Respect to Bures Distance and Fidelity: Closed-Forms and Applications arxiv.org/pdf/2602.14732 A. Afham, Marco Tomamichel.arxiv.orghttps://arxiv.org/abs/2602.14732arXiv abstract link 022
Afham @afhamash.bsky.social · 17/02/2026Took a while, but such a fun project! The main takeaway (for me) was that many of the 'natural' operations that is done in quantum information are actually projections w.r.t. fidelity/Bures distance. This showcases the importance of the Bures geometry. Fin. 020
Afham @afhamash.bsky.social · 17/02/2026We study 'prior-channel' decomposition of CP maps, a unique decomposition of a CP map into a states and a channel. This generalizes decomposing a PSD matrix into a density matrix and a scalar (via trace-normalization). Geometry of this decomp. is discussed, & its relation to Choi isomorphism. 110
Afham @afhamash.bsky.social · 17/02/20263. We provide an information-geometric underpinning to the Leifer-Spekkens state over time formalism, by showing their operations can be derived using Bures projections onto different sets. More applications discussed in the paper! 110
Afham @afhamash.bsky.social · 17/02/2026As applications, we show that 1. Pretty good measurement is the fidelity/Bures projection of the ensemble to POVMs, providing new interpretation for PGM. 2. Petz map is the projection of a CP map constructed (rather naturally) from the channel-state pair to the set of reverse channels. 110
Afham @afhamash.bsky.social · 17/02/2026In the 'fixed-marginal' setting, is projection is given by a simple closed-form. If the marginal is Identity, then this recovers a standard 'partial-normalization' operation used widely in the literature. We show that this partial normalization is not just easy to write down, but optimal! 110
Afham @afhamash.bsky.social · 17/02/2026We use the condition for the saturation of DPI for fidelity, along with properties of the matrix geometric mean, to derive a closed-form for certain projection problems. For 'nice' problems, the projection is given by the 'Gamma map'. 100
Afham @afhamash.bsky.social · 17/02/2026The feasible sets are the PSD preimage of a channel and an output matrix. Examples include sets of 1. Bi- (& multi-)partite states with a given marginal on 1 of the spaces. Eg: Choi matrices of CPTP maps. 2. PSD decomposition of a given matrix. Eg: Set of all POVMs. 110
Afham @afhamash.bsky.social · 17/02/2026New preprint out with @marcotomamichel.bsky.social ! Projections with Respect to Bures Distance and Fidelity: Closed-Forms and Applications scirate.com/arxiv/2602.1... We derive simple closed-form solutions for fidelity / Bures/purified distance projections to various sets of interest. 192
Afham @afhamash.bsky.social · 23/03/2025I realized I did not make clear that the e.vals have to be real and positive. Sorry! But I did some further numerics and you are right in general. I generated X = AB with A, B >= 0 and used partial trace. X can have complex evals in general. And yes, it's good to see these kinds of posts here! 010
Afham @afhamash.bsky.social · 23/03/2025Thanks for the reply! But the example you posted has complex e.vals which are conjugates of each other with +ve real part, hence the trace and det condition will be satisfied without the e.vals being (real) positive. 110
Afham @afhamash.bsky.social · 21/03/2025Q: Let X be a (non-Hermitian) matrix with positive eigenvalues (such X = AB, where A,B >= 0) and let Λ be a Completely positive map. Is Λ(X) guaranteed to be a matrix with positive eigenvalues? That is, do CP maps take EVERY (including non-Herm) matrix with pos evals to matrices with pos evals? 110
Afham @afhamash.bsky.social · 18/03/2025Train your biceps with some dagger curls! Although \ddagger curls would be easier for balance. 010
Afham @afhamash.bsky.social · 14/03/2025Haha, took it almost verbatim from the Preliminaries of my thesis! 020
Afham @afhamash.bsky.social · 14/03/2025Here is a 'simple' 3-line proof for this statement! (Although the simplicity hides behind the form and properties of the matrix geometric mean.) 1152