A quantum interior-point predictor–corrector algorithm for linear programming

DOI10.1088/1751-8121/ABB439MaRDI QIDQ5871119zbMATH OpenOpenAlexFDO

Authors Pablo A. M. Casares, Miguel A. Martín-Delgado

Publication date 25 January 2023

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.06749

zbMATH Keywords

hybrid quantum-classical algorithminterior point algorithmlinear programmingquantum advantagequantum algorithm

Mathematics Subject Classification ID

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

Recommendations

• Fast quantum subroutines for the simplex method
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum optimization
• Solving large-scale optimization problems related to Bell's theorem
• QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH

Cites work

• A new polynomial-time algorithm for linear programming
• A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Average performance of a self-dual interior point algorithm for linear programming
• Fast amplification of QMA
• Fast and efficient parallel solution of dense linear systems
• Fast quantum subroutines for the simplex method
• Foundations of machine learning
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 5485455 (Why is no real title available?)
• scientific article; zbMATH DE number 194921 (Why is no real title available?)
• Information and computation: Classical and quantum aspects
• Interior-point methods
• Matrix multiplication via arithmetic progressions
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the finite convergence of interior-point algorithms for linear programming
• 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 computations on a topologically encoded qubit
• Quantum recommendation systems
• Semidefinite optimization
• Semidefinite Programming
• The computational complexity of linear optics
• Variable time amplitude amplification and quantum algorithms for linear algebra problems

Cited in

(11)

• Fast quantum subroutines for the simplex method
• Solving large-scale optimization problems related to Bell's theorem
• Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
• Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
• Improvements in quantum SDP-solving with applications
• A quantum online portfolio optimization algorithm
• Fast quantum subroutines for the simplex method
• Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
• An inexact feasible interior point method for linear optimization with high adaptability to quantum computers
• Quantum Langevin dynamics for optimization
• Quantum computing inspired iterative refinement for semidefinite optimization

This page was built for publication: A quantum interior-point predictor–corrector algorithm for linear programming

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