Fetching the paper…
Reading the bibliography…
We introduce a new quantum optimization algorithm for dense Linear Programming problems, which can be seen as the quantization of the Interior Point Predictor-Corrector algorithm \cite{Predictor-Corrector} using a Quantum Linear System Algorithm \cite{DenseHHL}.
L. G. Khachiyan, “A polynomial algorithm in linear programming,” in Doklady Academii Nauk SSSR
1979
Earlier work this paper cites.
Wiley New York, 1983
K. G. Murty, Linear programming · 1983
Earlier work this paper cites.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,” in Proceedings of the sixteenth annual ACM symposium on Theory of computing
1984
Earlier work this paper cites.
Cambridge university press Cambridge, 1989
W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, et al · 1989
Earlier work this paper cites.
V. Pan and J. Reif, “Fast and efficient parallel solution of dense linear systems,” Computers & Mathematics with Applications
1989
Earlier work this paper cites.
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of symbolic computation
1990
Earlier work this paper cites.
Elsevier, 1992
E. D. Nering and A. W. Tucker, Linear Programs & Related Problems: A Volume in the Computer Science and Scientific Computing Series · 1992
Earlier work this paper cites.
Y. Ye, “On the finite convergence of interior-point algorithms for linear programming,” Mathematical Programming
1992
Earlier work this paper cites.
S. Mizuno, M. J. Todd, and Y. Ye, “On adaptive-step primal-dual interior-point algorithms for linear programming,” Mathematics of Operations research
1993
Earlier work this paper cites.
K. M. Anstreicher, J. Ji, F. A. Potra, and Y. Ye, “Average performance of a self–dual interior point algorithm for linear programming,” in Complexity in numerical optimization
1993
Earlier work this paper cites.
Y. Ye, M. J. Todd, and S. Mizuno, “An o ( n l ) o(\sqrt{n}l) -iteration homogeneous and self-dual linear programming algorithm,” Mathematics of Operations Research
1994
Earlier work this paper cites.
J. R. Shewchuk et al
1994
Earlier work this paper cites.
L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM review
1996
Earlier work this paper cites.
L. K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Physical review letters
1997
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review
1999
Earlier work this paper cites.
Cambridge, Cambridge University Press, 2000
M. A. Nielsen and I. Chuang, Quantum computation and quantum information · 2000
Earlier work this paper cites.
F. A. Potra and S. J. Wright, “Interior-point methods,” Journal of Computational and Applied Mathematics
2000
Earlier work this paper cites.
M. J. Todd, “Semidefinite optimization,” Acta Numerica
2001
Earlier work this paper cites.
Centrum voor Wiskunde en Informatica, 2002
M. Laurent and F. Rendl, Semidefinite programming and integer programming · 2002
Earlier work this paper cites.
A. Galindo and M. A. Martin-Delgado, “Information and computation: Classical and quantum aspects,” Reviews of Modern Physics
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” arXiv preprint quant-ph/0208112
2002
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, “Simulated quantum computation of molecular energies,” Science
2005
Cited alongside, same era.
Springer Science & Business Media, 2006
E. De Klerk, Aspects of semidefinite programming: interior point algorithms and selected applications · 2006
Cited alongside, same era.
V. V. Shende, S. S. Bullock, and I. L. Markov, “Synthesis of quantum-logic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2006
Cited alongside, same era.
S. Arora and S. Kale, “A combinatorial, primal-dual approach to semidefinite programs,” in Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
2007
Cited alongside, same era.
L. A. B. Kowada, C. Lavor, R. Portugal, and C. M. De Figueiredo, “A new quantum algorithm for solving the minimum searching problem,” International Journal of Quantum Information
2008
J. Van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf, “Quantum sdp-solvers: Better upper and lower bounds,” in Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on
2017
Later among the works it cites.
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature
2017
Later among the works it cites.
I. Kerenidis and A. Prakash, “Quantum recommendation systems,” in Proceedings of the 8th Innovations in Theoretical Computer Science Conference
2017
Later among the works it cites.
A. M. Childs, R. Kothari, and R. D. Somma, “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision,” SIAM Journal on Computing
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters
2009
Cited alongside, same era.
D. Nagaj, P. Wocjan, and Y. Zhang, “Fast amplification of qma,” arXiv preprint arXiv:0904.1549
2009
Cited alongside, same era.
S. Aaronson and A. Arkhipov, “The computational complexity of linear optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing
2011
Cited alongside, same era.
MIT press, 2012
M. Mohri, A. Rostamizadeh, and A. Talwalkar, Foundations of machine learning · 2012
Cited alongside, same era.
J. Preskill, “Quantum computing and the entanglement frontier,” arXiv preprint arXiv:1203.5813
2012
Cited alongside, same era.
A. Ambainis, “Variable time amplitude amplification and quantum algorithms for linear algebra problems,” in STACS’12 (29th Symposium on Theoretical Aspects of Computer Science)
2012
Cited alongside, same era.
Springer Science & Business Media, 2013
M. Padberg, Linear optimization and extensions · 2013
Cited alongside, same era.
2018
Later among the works it cites.
J. Preskill, “Quantum computing in the nisq era and beyond,” arXiv preprint arXiv:1801.00862
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
L. Wossnig, Z. Zhao, and A. Prakash, “Quantum linear system algorithm for dense matrices,” Physical review letters
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
G. Nannicini, “Fast quantum subroutines for the simplex method,” arXiv preprint arXiv:1910.10649
2019
Closest in time.
G. H. Low and I. L. Chuang, “Hamiltonian simulation by qubitization,” Quantum
2019
Closest in time.
Y. R. Sanders, G. H. Low, A. Scherer, and D. W. Berry, “Black-box quantum state preparation without arithmetic,” Physical review letters
2019
Closest in time.