Quantum approximate k-minimum finding

DOI10.4230/LIPICS.ESA.2025.51MaRDI QIDQ7322447zbMATH OpenFDO

Authors Minbo Gao, Zhengfeng Ji, Qisheng Wang

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.51

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A polynomial quantum algorithm for approximating the Jones polynomial
• Fast amplification of QMA
• Grover's algorithm with errors
• Grover's search with faults on some marked elements
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2038718 (Why is no real title available?)
• Improved Quantum data analysis
• Improvements in quantum SDP-solving with applications
• Near-optimal quantum algorithms for string problems
• Optimal trace distance and fidelity estimations for pure quantum states
• Quantum algorithm for lexicographically minimal string rotation
• Quantum algorithms and lower bounds for linear regression with norm constraints
• Quantum computation and quantum information. 10th anniversary edition
• Quantum Query Complexity of Some Graph Problems
• Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum speed-up for unsupervised learning
• Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
• Shadow tomography of quantum states
• String matching in O( n+ m) quantum time
• The NISQ complexity of collision finding

This page was built for publication: Quantum approximate \(k\)-minimum finding

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