Fetching the paper…
Reading the bibliography…
The eligibility of various advanced quantum algorithms will be questioned if they can not guarantee privacy.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval research logistics quarterly , vol. 3, no. 1-2, pp. 95–110, 1956
1956
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Physical review A , vol. 52, no. 5, p. 3457, 1995
1995
Earlier work this paper cites.
C. Durr and P. Hoyer, “A quantum algorithm for finding the minimum,” arXiv preprint quant-ph/9607014 , 1996
1996
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert, “Quantum networks for elementary arithmetic operations,” Physical Review A , vol. 54, no. 1, p. 147, 1996
1996
Earlier work this paper cites.
R. Agrawal and R. Srikant, “Privacy-preserving data mining,” in ACM Sigmod Record , vol. 29. ACM, 2000, pp. 439–450
2000
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics , vol. 305, pp. 53–74, 2002
2002
Earlier work this paper cites.
B. Efron, T. Hastie, I. Johnstone, R. Tibshirani et al. , “Least angle regression,” The Annals of statistics , vol. 32, no. 2, pp. 407–499, 2004
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Theory of cryptography conference . Springer, 2006, pp. 265–284
2006
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, “Architectures for a quantum random access memory,” Physical Review A , vol. 78, no. 5, p. 052310, 2008
2008
Earlier work this paper cites.
——, “Quantum random access memory,” Physical review letters , vol. 100, no. 16, p. 160501, 2008
2008
Earlier work this paper cites.
K. Chaudhuri and C. Monteleoni, “Privacy-preserving logistic regression,” in Advances in neural information processing systems , 2009, pp. 289–296
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters , vol. 103, no. 15, p. 150502, 2009
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, 2010
2010
Earlier work this paper cites.
C. Dwork, G. N. Rothblum, and S. Vadhan, “Boosting and differential privacy,” in 2010 IEEE 51st Annual Symposium on Foundations of Computer Science . IEEE, 2010, pp. 51–60
2010
Earlier work this paper cites.
K. Chaudhuri, C. Monteleoni, and A. D. Sarwate, “Differentially private empirical risk minimization.” Journal of Machine Learning Research , vol. 12, no. 3, 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
P. Jain, P. Kothari, and A. Thakurta, “Differentially private online learning,” in Conference on Learning Theory , 2012, pp. 24–1
2012
Earlier work this paper cites.
D. Kifer, A. Smith, and A. Thakurta, “Private convex empirical risk minimization and high-dimensional regression,” in Conference on Learning Theory , 2012, pp. 25–1
2012
Earlier work this paper cites.
K. L. Clarkson, E. Hazan, and D. P. Woodruff, “Sublinear optimization for machine learning,” Journal of the ACM (JACM) , vol. 59, no. 5, p. 23, 2012
2012
Earlier work this paper cites.
N. Wiebe, D. Braun, and S. Lloyd, “Quantum algorithm for data fitting,” Physical review letters , vol. 109, no. 5, p. 050505, 2012
2012
Earlier work this paper cites.
A. G. Thakurta and A. Smith, “Differentially private feature selection via stability arguments, and the robustness of the lasso,” in Conference on Learning Theory , 2013, pp. 819–850
2013
Cited alongside, same era.
M. Jaggi, “Revisiting Frank-Wolfe: Projection-free sparse convex optimization,” in Proceedings of the 30th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, S. Dasgupta and D. McAllester, Eds., vol. 28. Atlanta, Georgia, USA: PMLR, 17–19 Jun 2013, pp. 427–435. [Online]. Available: http://proceedings.mlr.press/v28/jaggi13.html
2013
Cited alongside, same era.
R. Bassily, A. Smith, and A. Thakurta, “Private empirical risk minimization: Efficient algorithms and tight error bounds,” in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science . IEEE, 2014, pp. 464–473
2014
Cited alongside, same era.
C. Dwork, A. Roth et al. , “The algorithmic foundations of differential privacy,” Foundations and Trends® in Theoretical Computer Science , vol. 9, no. 3–4, pp. 211–407, 2014
V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambetta, “Supervised learning with quantum-enhanced feature spaces,” Nature , vol. 567, no. 7747, p. 209, 2019
2019
Later among the works it cites.
M. Schuld and N. Killoran, “Quantum machine learning in feature hilbert spaces,” Physical review letters , vol. 122, no. 4, p. 040504, 2019
2019
Later among the works it cites.
D. Zhu, N. M. Linke, M. Benedetti, K. A. Landsman, N. H. Nguyen, C. H. Alderete, A. Perdomo-Ortiz, N. Korda, A. Garfoot, C. Brecque et al. , “Training of quantum circuits on a hybrid quantum computer,” Science advances , vol. 5, no. 10, p. eaaw9918, 2019
2019
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al. , “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, 2019
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…
2014
Cited alongside, same era.
M. Jaggi, “An equivalence between the lasso and support vector machines,” Regularization, Optimization, Kernels, and Support Vector Machines , p. 1, 2014
2014
Cited alongside, same era.
K. Talwar, A. G. Thakurta, and L. Zhang, “Nearly optimal private lasso,” in Advances in Neural Information Processing Systems , 2015, pp. 3025–3033
2015
Cited alongside, same era.
S. Lacoste-Julien and M. Jaggi, “On the global linear convergence of frank-wolfe optimization variants,” in Advances in Neural Information Processing Systems , 2015, pp. 496–504
2015
Cited alongside, same era.
A. Kapoor, N. Wiebe, and K. Svore, “Quantum perceptron models,” in Advances in Neural Information Processing Systems , 2016, pp. 3999–4007. [Online]. Available: http://papers.nips.cc/paper/6401-quantum-perceptron-models
2016
Cited alongside, same era.
S. P. Kasiviswanathan and H. Jin, “Efficient private empirical risk minimization for high-dimensional learning,” in International Conference on Machine Learning , 2016, pp. 488–497
2016
Cited alongside, same era.
M. Schuld, I. Sinayskiy, and F. Petruccione, “Prediction by linear regression on a quantum computer,” Physical Review A , vol. 94, no. 2, p. 022342, 2016
2016
Cited alongside, same era.
Y.-X. Wang, V. Sadhanala, W. Dai, W. Neiswanger, S. Sra, and E. Xing, “Parallel and distributed block-coordinate frank-wolfe algorithms,” in International Conference on Machine Learning , 2016, pp. 1548–1557
2016
Cited alongside, same era.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,” Nature , vol. 549, no. 7671, p. 195, 2017. [Online]. Available: https://www.nature.com/articles/nature23474
2017
Cited alongside, same era.
D. Wang, C. Chen, and J. Xu, “Differentially private empirical risk minimization with non-convex loss functions,” in International Conference on Machine Learning , 2019, pp. 6526–6535
2019
Later among the works it cites.
L. Wang and Q. Gu, “Differentially private iterative gradient hard thresholding for sparse learning,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence . AAAI Press, 2019, pp. 3740–3747
2019
Later among the works it cites.
T. Li, S. Chakrabarti, and X. Wu, “Sublinear quantum algorithms for training linear and kernel-based classifiers,” in International Conference on Machine Learning , 2019, pp. 3815–3824
2019
Later among the works it cites.
E. Tang, “A quantum-inspired classical algorithm for recommendation systems,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 217–228
2019
Later among the works it cites.
S. Chakraborty, A. Gilyén, and S. Jeffery, “The power of block-encoded matrix powers: Improved regression techniques via faster hamiltonian simulation,” in 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019
2019
Later among the works it cites.
S. Aaronson and G. N. Rothblum, “Gentle measurement of quantum states and differential privacy,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 322–333
2019
Later among the works it cites.
I. Kerenidis, J. Landman, A. Luongo, and A. Prakash, “q-means: A quantum algorithm for unsupervised machine learning,” in Advances in Neural Information Processing Systems , 2019, pp. 4136–4146
2019
Later among the works it cites.
I. Kerenidis and A. Prakash, “Quantum gradient descent for linear systems and least squares,” Physical Review A , vol. 101, no. 2, p. 022316, 2020
2020
Closest in time.
Y. Du, M.-H. Hsieh, T. Liu, and D. Tao, “Quantum-inspired algorithm for general minimum conical hull problems,” Physical Review Research , vol. 2, no. 3, p. 033199, 2020
2020
Closest in time.
D.-B. Zhang, S.-L. Zhu, and Z. D. Wang, “Protocol for implementing quantum nonparametric learning with trapped ions,” Phys. Rev. Lett. , vol. 124, p. 010506, Jan 2020. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.124.010506
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
S. Aaronson and P. Rall, “Quantum approximate counting, simplified,” in Symposium on Simplicity in Algorithms . SIAM, 2020, pp. 24–32
2020
Closest in time.
Y. Du, M.-H. Hsieh, T. Liu, D. Tao, and N. Liu, “Quantum noise protects quantum classifiers against adversaries,” Physical Review Research , vol. 3, no. 2, p. 023153, 2021
2021
Closest in time.
Y. Quek, S. Arunachalam, and J. Smolin, “Private learning implies quantum stability,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Closest in time.
R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven, “Focus beyond quadratic speedups for error-corrected quantum advantage,” PRX Quantum , vol. 2, no. 1, p. 010103, 2021
2021
Closest in time.