Fetching the paper…
Reading the bibliography…
We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization.
Convex Optimization: Algorithms and Complexity
S. Bubeck · 1935
Earlier work this paper cites.
On general minimax theorems
M. Sion · 1958
Earlier work this paper cites.
Entropy inequalities
H. Araki and E. H. Lieb · 1970
Earlier work this paper cites.
Digital image compression by outer product expansion
D. O’Leary and S. Peleg · 1983
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Matrix analysis , volume 169 of Graduate Texts in Mathematics
R. Bhatia · 1997
Earlier work this paper cites.
Limited-memory matrix methods with applications
T. G. Kolda · 1998
Earlier work this paper cites.
Quick approximation to matrices and applications
A. Frieze and R. Kannan · 1999
Earlier work this paper cites.
Quantum computation and quantum information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Random sampling and approximation of MAX-CSPs
N. Alon, W. Fernandez de la Vega, R. Kannan, and M. Karpinski · 2003
Earlier work this paper cites.
Inequalities for trace norms of 2 × 2 2\times 2 block matrices
C. King · 2003
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Maximizing Quadratic Programs: Extending Grothendieck’s Inequality
M. Charikar and A. Wirth · 2004
Earlier work this paper cites.
Topics in Randomized Numerical Linear Algebra
A. Gittens · 2004
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
S. Arora, E. Hazan, and S. Kale · 2005
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. D. C. Monteiro · 2005
Earlier work this paper cites.
Some estimates of norms of random matrices
R. Latala · 2005
Earlier work this paper cites.
Matrix exponentiated gradient updates for on-line learning and bregman projection
K. Tsuda, G. Rätsch, and M. K. Warmuth · 2005
Earlier work this paper cites.
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2006
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse Hamiltonians
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders · 2007
Earlier work this paper cites.
Quantum random access memory
V. Giovannetti, S. Lloyd, and L. Maccone · 2008
Earlier work this paper cites.
Cut-norms and spectra of matrices
V. Nikiforov · 2009
Earlier work this paper cites.
Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
D. Poulin and P. Wocjan · 2009
Cited alongside, same era.
Spectral sparsification of graphs
D. A. Spielman and S.-H. Teng · 2011
Cited alongside, same era.
The Diluted SK Model and the K-Sat Problem
M. Talagrand · 2011
Cited alongside, same era.
Quantum metropolis sampling
K. Temme, T. J. Osborne, K. G. Vollbrecht, D. Poulin, and F. Verstraete · 2011
Cited alongside, same era.
Hamiltonian simulation using linear combinations of unitary operations
A. M. Childs and N. Wiebe · 2012
Cited alongside, same era.
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
S. T. Flammia, D. Gross, Y.-K. Liu, and J. Eisert · 2012
Cited alongside, same era.
Quantum speed-ups for solving semidefinite programs
F. G. Brandao and K. M. Svore · 2017
Later among the works it cites.
Quantum algorithms for Gibbs sampling and hitting-time estimation
A. N. Chowdhury and R. D. Somma · 2017
Later among the works it cites.
Extremal Cuts of Sparse Random Graphs
A. Dembo, A. Montanari, and S. Sen · 2017
Later among the works it cites.
Sample-optimal tomography of quantum states
J. Haah, A. W. Harrow, Z. Ji, X. Wu, and N. Yu · 2017
Later among the works it cites.
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality
S. Mei, T. Misiakiewicz, A. Montanari, and R. I. Oliveira · 2017
Later among the works it cites.
Norms of random matrices: local and global problems
E. Rebrova and R. Vershynin · 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…
A quantum–quantum metropolis algorithm
M.-H. Yung and A. Aspuru-Guzik · 2012
Cited alongside, same era.
Focus on quantum tomography
K. Banaszek, M. Cramer, and D. Gross · 2013
Cited alongside, same era.
The isotropic semicircle law and deformation of Wigner matrices
A. Knowles and J. Yin · 2013
Cited alongside, same era.
The Sherrington-Kirkpatrick model
D. Panchenko · 2013
Cited alongside, same era.
Quantum algorithms for linear algebra and machine learning
A. Prakash · 2014
Cited alongside, same era.
Low rank matrix recovery from rank one measurements
R. Kueng, H. Rauhut, and U. Terstiege · 2015
Cited alongside, same era.
Practical sketching algorithms for low-rank matrix approximation
J. A. Tropp, A. Yurtsever, M. Udell, and V. Cevher · 2017
Later among the works it cites.
Quantum SDP-solvers: better upper and lower bounds
J. van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf · 2017
Later among the works it cites.
Perfect sampling for quantum Gibbs states
D. S. França · 2018
Later among the works it cites.
Online learning of quantum states
S. Aaronson, X. Chen, E. Hazan, S. Kale, and A. Nayak · 2019
Closest in time.
Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning
F. G. S. L. Brandão, A. Kalev, T. Li, C. Y.-Y. Lin, K. M. Svore, and X. Wu · 2019
Closest in time.
Binary component decomposition Part II: the asymmetric case
R. Kueng and J. A. Tropp · 2019
Closest in time.
Hamiltonian simulation with nearly optimal dependence on spectral norm
G. H. Low · 2019
Closest in time.
Optimization of the Sherrington-Kirkpatrick hamiltonian
A. Montanari · 2019
Closest in time.
Improvements in Quantum SDP-Solving with Applications
J. van Apeldoorn and A. Gilyén · 2019
Closest in time.
Quantum speedup for graph sparsification, cut approximation and laplacian solving
S. Apers and R. de Wolf · 2020
Closest in time.
Fast state tomography with optimal error bounds
M. Guţă, J. Kahn, R. Kueng, and J. A. Tropp · 2020
Closest in time.
A Quantum Interior Point Method for LPs and SDPs
I. Kerenidis and A. Prakash · 2020
Closest in time.
A tight degree 4 sum-of-squares lower bound for the Sherrington–Kirkpatrick Hamiltonian
D. Kunisky and A. S. Bandeira · 2020
Closest in time.
Fast and robust quantum state tomography from few basis measurements
D. S. França, F. G. S. L. Brandão, and R. Kueng · 2021
Closest in time.
Binary component decomposition part I: the positive-semidefinite case
R. Kueng and J. A. Tropp · 2021
Closest in time.