Quantum polar decomposition algorithm

Abstract

The polar decomposition for a matrix $A$ is $A=UB$, where $B$ is a positive Hermitian matrix and $U$ is unitary (or, if $A$ is not square, an isometry). This paper shows that the ability to apply a Hamiltonian $\pmatrix{ 0 & A^\dagger \cr A & 0 \cr} $ translates into the ability to perform the transformations $e^{-iBt}$ and $U$ in a deterministic fashion. We show how to use the quantum polar decomposition algorithm to solve the quantum Procrustes problem, to perform pretty good measurements, to find the positive Hamiltonian closest to any Hamiltonian, and to perform a Hamiltonian version of the quantum singular value transformation.

10 pages

Cited by in corpus (6)

• Quantum algorithm for Petz recovery channels and pretty good measurements
• Variational Quantum Singular Value Decomposition
• Learning quantum data with the quantum Earth Mover's distance
• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Fast algorithm for quantum polar decomposition, pretty-good measurements, and the Procrustes problem
• Should Semantic Vector Composition be Explicit? Can it be Linear?