Fetching the paper…
Reading the bibliography…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond.
“On finding local Nash equilibria (and only local Nash equilibria) in zero-sum games” (2019)
Eric V. Mazumdar, Michael I. Jordan, and S. Shankar Sastry · 1901
Earlier work this paper cites.
“On general minimax theorems”
Maurice Sion · 1958
Earlier work this paper cites.
“A simplex method for function minimization”
John A. Nelder and Roger Mead · 1965
Earlier work this paper cites.
“Multiplier and gradient methods”
Magnus R. Hestenes · 1969
Earlier work this paper cites.
“A method for nonlinear constraints in minimization problems”
Michael J. D. Powell · 1969
Earlier work this paper cites.
“Optimum testing of multiple hypotheses in quantum detection theory”
Horace Yuen, Robert Kennedy, and Melvin Lax · 1975
Earlier work this paper cites.
“Multiplier methods: A survey”
Dimitri P. Bertsekas · 1976
Earlier work this paper cites.
“Eigenvalues and the max-cut problem”
Bojan Mohar and Svatopluk Poljak · 1990
Earlier work this paper cites.
“Optimization, approximation, and complexity classes”
Christos H. Papadimitriou and Mihalis Yannakakis · 1991
Earlier work this paper cites.
“Multivariate stochastic approximation using a simultaneous perturbation gradient approximation”
James C. Spall · 1992
Earlier work this paper cites.
“Algorithms for quantum computation: Discrete logarithms and factoring”
Peter W. Shor · 1994
Earlier work this paper cites.
“Particle swarm optimization”
James Kennedy and Russell Eberhart · 1995
Earlier work this paper cites.
“Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming”
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
“A quantum algorithm for finding the minimum” (1996)
Christoph Dürr and Peter Høyer · 1996
Earlier work this paper cites.
“Quantum mechanics helps in searching for a needle in a haystack”
Lov K. Grover · 1997
Earlier work this paper cites.
“Interior-point methods”
Florian A. Potra and Stephen J. Wright · 2000
Earlier work this paper cites.
“Semidefinite programming relaxations for semialgebraic problems”
Pablo A. Parrilo · 2003
Earlier work this paper cites.
“A semidefinite programming approach to optimal unambiguous discrimination of quantum states”
Yonina C. Eldar · 2003
Earlier work this paper cites.
“String matching in O ( n + m ) O(n+m) quantum time”
Ramesh Hariharan and Vishwanathan Vinay · 2003
Earlier work this paper cites.
“Convex optimization”
Stephen P. Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
“Cones of matrices and set-functions and 0-1 optimization”
László Lovász and Alexander Schrijver · 2006
Cited alongside, same era.
“Quantum algorithm for linear systems of equations”
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
“Principles of quantum communication theory: A modern approach” (2020)
Sumeet Khatri and Mark M. Wilde · 2011
Cited alongside, same era.
“Recent theoretical advances in non-convex optimization”
Marina Danilova, Pavel Dvurechensky, Alexander Gasnikov, Eduard Gorbunov, Sergey Guminov, Dmitry Kamzolov, and Innokentiy Shibaev · 2012
Cited alongside, same era.
“A variational eigenvalue solver on a photonic quantum processor”
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien · 2014
Cited alongside, same era.
“Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning”
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu · 2019
Later among the works it cites.
“Quantum supremacy using a programmable superconducting processor”
Frank Arute, Kunal Arya, Ryan Babbush, et al · 2019
Later among the works it cites.
“Evaluating analytic gradients on quantum hardware”
Maria Schuld, Ville Bergholm, Christian Gogolin, Josh Izaac, and Nathan Killoran · 2019
Later among the works it cites.
“Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile”
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
“An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints”
Mehmet Fatih Sahin, Armin Eftekhari, Ahmet Alacaoglu, Fabian Latorre Gómez, and Volkan Cevher · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“A quantum approximate optimization algorithm” (2014)
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
“Accelerated proximal gradient methods for nonconvex programming”
Huan Li and Zhouchen Lin · 2015
Cited alongside, same era.
“A combinatorial, primal-dual approach to semidefinite programs”
Sanjeev Arora and Satyen Kale · 2016
Cited alongside, same era.
“Linear convergence of gradient and proximal-gradient methods under the Polyak–Lojasiewicz condition”
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Cited alongside, same era.
“CVXPY: A Python-embedded modeling language for convex optimization”
Steven Diamond and Stephen Boyd · 2016
Cited alongside, same era.
“Quantum speed-ups for solving semidefinite programs”
Fernando G. S. L. Brandão and Krysta M. Svore · 2017
Cited alongside, same era.
“Hybrid quantum-classical approach to quantum optimal control”
Jun Li, Xiaodong Yang, Xinhua Peng, and Chang-Pu Sun · 2017
Cited alongside, same era.
“Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics”
Anirudha Majumdar, Georgina Hall, and Amir Ali Ahmadi · 2020
Later among the works it cites.
“Self-testing of quantum systems: a review”
Ivan Supic and Joseph Bowles · 2020
Later among the works it cites.
“Quantum SDP-solvers: Better upper and lower bounds”
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Later among the works it cites.
“Variational quantum algorithms”
Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Simon Benjamin, Suguro Endo, Keisuke Fujii, Jarrod Ryan McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, and Patrick Coles · 2021
Closest in time.
“Characterizing the loss landscape of variational quantum circuits”
Patrick Huembeli and Alexandre Dauphin · 2021
Closest in time.
Jakub Marecek and Albert Akhriev · 2021
Closest in time.
“Efficient quantum measurement of Pauli operators in the presence of finite sampling error”
Ophelia Crawford, Barnaby van Straaten, Daochen Wang, Thomas Parks, Earl Campbell, and Stephen Brierley · 2021
Closest in time.
“Noisy intermediate-scale quantum algorithms”
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, and Alán Aspuru-Guzik · 2022
Closest in time.
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2022
Closest in time.
“Noisy intermediate-scale quantum algorithm for semidefinite programming”
Kishor Bharti, Tobias Haug, Vlatko Vedral, and Leong-Chuan Kwek · 2022
Closest in time.
“Pennylane: Automatic differentiation of hybrid quantum-classical computations” (2022)
Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin, et al · 2022
Closest in time.
“The complexity of NISQ”
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li · 2023
Closest in time.
“The disparate impact of noise on quantum learning algorithms”
Armando Angrisani · 2023
Closest in time.
“Qiskit: An open-source framework for quantum computing” (2023)
Matthew Treinish et al · 2023
Closest in time.
“Credit – contributor roles taxonomy”
NISO · 2024
Closest in time.