Quantum algorithm for computing distances between subspaces
From MaRDI portal
Publication:6576502
DOI10.1016/j.physleta.2024.129610MaRDI QIDQ6576502
Publication date: 22 July 2024
Published in: Physics Letters. A (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for the smallest singular value of a matrix
- Supervised learning with quantum computers
- Schubert Varieties and Distances between Subspaces of Different Dimensions
- Universal Quantum Simulators
- New Fast and Accurate Jacobi SVD Algorithm. I
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- A quantum-inspired classical algorithm for recommendation systems
- Quantum advantage with shallow circuits
- Quantum algorithms for computational geometry problems
- A polynomial quantum algorithm for approximating the Jones polynomial
This page was built for publication: Quantum algorithm for computing distances between subspaces