Quantum algorithm for computing distances between subspaces

DOI10.1016/J.PHYSLETA.2024.129610MaRDI QIDQ6576502zbMATH OpenFDO

Authors Nhat A. Nghiem

Publication date 22 July 2024

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PHYSLETA.2024.129610

zbMATH Keywords

quantum algorithm

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Cites work

• A lower bound for the smallest singular value of a matrix
• A polynomial quantum algorithm for approximating the Jones polynomial
• A quantum-inspired classical algorithm for recommendation systems
• Computational conformal geometry. With CD-ROM
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• New Fast and Accurate Jacobi SVD Algorithm. I
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum advantage with shallow circuits
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum algorithms for computational geometry problems
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Rapid solution of problems by quantum computation
• Schubert varieties and distances between subspaces of different dimensions
• Supervised learning with quantum computers
• Universal Quantum Simulators

Cited in

(1)

• Generalised state space geometry in Hermitian and non-Hermitian quantum systems

This page was built for publication: Quantum algorithm for computing distances between subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576502)