Quantum algorithms for matrix geometric means
arXiv:2405.00673 · doi:10.1038/s41534-025-00973-7
Abstract
Matrix geometric means between two positive definite matrices can be defined from distinct perspectives - as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certain optimisation problems. We devise quantum subroutines for the matrix geometric means, and construct solutions to the algebraic Riccati equation - an important class of nonlinear systems of equations appearing in machine learning, optimal control, estimation, and filtering. Using these subroutines, we present a new class of quantum learning algorithms, for both classical and quantum data, called quantum geometric mean metric learning, for weakly supervised learning and anomaly detection. The subroutines are also useful for estimating geometric Rényi relative entropies and the Uhlmann fidelity, in particular achieving optimal dependence on precision for the Uhlmann and Matsumoto fidelities. Finally, we provide a BQP-complete problem based on matrix geometric means that can be solved by our subroutines.
Final version. 53 pages
References in corpus (29)
- Quantum algorithm for solving linear systems of equations
- Quantum principal component analysis
- Quantum fingerprinting
- Hamiltonian Simulation by Qubitization
- Quantum Computation as Geometry
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- From Classical to Quantum Shannon Theory
- Efficient quantum algorithm for dissipative nonlinear differential equations
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- Fundamental properties of Tsallis relative entropy
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- High-precision quantum algorithms for partial differential equations
- Quantum machine learning for quantum anomaly detection
- Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
- Quantum SDP-Solvers: Better upper and lower bounds
- Hamiltonian Simulation with Optimal Sample Complexity
- Quantum algorithm for Petz recovery channels and pretty good measurements
- Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Quantum Algorithm for Fidelity Estimation
- New Quantum Algorithms for Computing Quantum Entropies and Distances
- Distributed quantum inner product estimation
- Bounding the forward classical capacity of bipartite quantum channels
- Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
- RLD Fisher Information Bound for Multiparameter Estimation of Quantum Channels
- An invitation to the sample complexity of quantum hypothesis testing
- Succinct quantum testers for closeness and -wise uniformity of probability distributions
- Time-Efficient Quantum Entropy Estimator via Samplizer