2 citations · 4 across the 4 of their papers we have counts for
5 papers
Fast and Sure-ious Quantum Process Tomography
A. Afham, Sayantan Sen, Marco Tomamichel
Quantum process tomography (QPT) protocols are often designed by lifting quantum state tomography (QST) protocols through the Choi-Jamiolkowski isomorphism, at the cost of an extra…
Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size
A. Afham
The computation of the Bures-Wasserstein (BW) barycenter of an ensemble of positive definite matrices arises throughout machine learning, optimal transport, and quantum information…
Riemannian-geometric generalizations of quantum fidelities and Bures-Wasserstein distance
A. Afham, Chris Ferrie
We introduce a family of fidelities, termed generalized fidelity, which are based on the Riemannian geometry of the Bures-Wasserstein manifold. We show that this family of fideliti…
Quantum mean states are nicer than you think: fast algorithms to compute states maximizing average fidelity
A. Afham, Richard Kueng, Chris Ferrie
Fidelity is arguably the most popular figure of merit in quantum sciences. However, many of its properties are still unknown. In this work, we resolve the open problem of maximizin…
Quantum -nearest neighbors algorithm
Afrad Basheer, A. Afham, Sandeep K. Goyal
One of the simplest and most effective classical machine learning algorithms is the -nearest neighbors algorithm (NN) which classifies an unknown test state by finding the $k…