Fetching the paper…
Reading the bibliography…
We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups.
Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, and Chunhao Wang · 1901
Earlier work this paper cites.
Information theory and statistical mechanics
Edwin T. Jaynes · 1957
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Quantum fingerprinting
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf · 2001
Earlier work this paper cites.
Efficient algorithms for online convex optimization and their applications
Elad Hazan · 2006
Earlier work this paper cites.
The learnability of quantum states
Scott Aaronson · 2007
Earlier work this paper cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Earlier work this paper cites.
Efficient algorithms using the multiplicative weights update method
Satyen Kale · 2007
Earlier work this paper cites.
Fast amplification of QMA, 2009
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2009
Earlier work this paper cites.
David Poulin and Pawel Wocjan · 2009
Earlier work this paper cites.
Parallelized solution to semidefinite programmings in quantum complexity theory, 2010
Xiaodi Wu · 2010
Cited alongside, same era.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2011
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Parallel approximation of min-max problems with applications to classical and quantum zero-sum games
Gus Gutoski and Xiaodi Wu · 2012
Cited alongside, same era.
Inverting well conditioned matrices in quantum logspace
Amnon Ta-Shma · 2013
Cited alongside, same era.
Quantum SDP-solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2017
Closest in time.
Quantum speed-ups for semidefinite programming
Fernando G. S. L. Brandão and Krysta Svore · 2017
Closest in time.
Quantum algorithms for Gibbs sampling and hitting-time estimation
Anirban Narayan Chowdhury and Rolando D. Somma · 2017
Closest in time.
Sequential measurements, disturbance and property testing
Aram W. Harrow, Cedric Yen-Yu Lin, and Ashley Montanaro · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost · 2014
Cited alongside, same era.
Lower bounds on the size of semidefinite programming relaxations
James R. Lee, Prasad Raghavendra, and David Steurer · 2015
Cited alongside, same era.
A faster cutting plane method and its implications for combinatorial and convex optimization
Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong · 2015
Cited alongside, same era.
Sample-optimal tomography of quantum states
Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, and Nengkun Yu · 2016
Cited alongside, same era.
Ryan O’Donnell and John Wright · 2016
Cited alongside, same era.
Shelby Kimmel, Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, and Theodore J. Yoder · 2017
Closest in time.
Personal communication, 2017
Ronald de Wolf · 2017
Closest in time.
Shadow tomography of quantum states
Scott Aaronson · 2018
Closest in time.
Online learning of quantum states, 2018
Scott Aaronson, Xinyi Chen, Elad Hazan, and Ashwin Nayak · 2018
Closest in time.
Improvements in quantum SDP-solving with applications, 2018
Joran van Apeldoorn and András Gilyén · 2018
Closest in time.
A quantum-inspired classical algorithm for recommendation systems
Ewin Tang · 2019
Closest in time.