Fetching the paper…
Reading the bibliography…
Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage.
A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Problems of Information Transmission , vol. 9, no. 3, pp. 177–183, 1973
1973
Earlier work this paper cites.
S. Wiesner, “Conjugate coding,” SIGACT News , vol. 15, no. 1, pp. 78–88, 1983. [Online]. Available: http://doi.acm.org/10.1145/1008908.1008920
1983
Earlier work this paper cites.
L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen, Classification and Regression Trees . CRC press, 1984
1984
Earlier work this paper cites.
G. E. Hinton et al. , “Learning distributed representations of concepts,” in Proceedings of the eighth annual conference of the cognitive science society , vol. 1. Amherst, MA, 1986, p. 12
1986
Earlier work this paper cites.
J. C. Spall, “Multivariate stochastic approximation using a simultaneous perturbation gradient approximation,” IEEE Transactions on Automatic Control , vol. 37, no. 3, pp. 332–341, 1992
1992
Earlier work this paper cites.
C. Cortes and V. Vapnik, “Support-vector networks,” in Machine Learning , 1995, pp. 273–297
1995
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge, UK: Cambridge University Press, 2000
2000
Earlier work this paper cites.
L. Breiman, “Random forests,” Mach. Learn. , vol. 45, no. 1, p. 5–32, Oct. 2001. [Online]. Available: https://doi.org/10.1023/A:1010933404324
2001
Earlier work this paper cites.
A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, “Dense quantum coding and quantum finite automata,” J. ACM , vol. 49, no. 4, pp. 496–511, 2002. [Online]. Available: http://doi.acm.org/10.1145/581771.581773
2002
Earlier work this paper cites.
S. Chopra, R. Hadsell, and Y. LeCun, “Learning a similarity metric discriminatively, with application to face verification,” in Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05) - Volume 1 - Volume 01 , ser. CVPR ’05. USA: IEEE Computer Society, 2005, p. 539–546. [Online]. Available: https://doi.org/10.1109/CVPR.2005.202
2005
Earlier work this paper cites.
M. Hayashi, K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita, “(4,1)-quantum random access coding does not exist – one qubit is not enough to recover one of four bits,” New Journal of Physics , vol. 8, no. 8, p. 129, 2006. [Online]. Available: http://stacks.iop.org/1367-2630/8/i=8/a=129
2006
Earlier work this paper cites.
M. Hayashi, K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita, “Quantum network coding,” in STACS 2007 , W. Thomas and P. Weil, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 610–621
2007
Earlier work this paper cites.
K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita, “Unbounded-error one-way classical and quantum communication complexity,” in Automata, Languages and Programming . Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–121
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. , vol. 103, p. 150502, Oct 2009. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.103.150502
2009
Earlier work this paper cites.
Y. LeCun, C. Cortes, and C. Burges, “Mnist handwritten digit database,” ATT Labs [Online]. Available: http://yann.lecun.com/exdb/mnist , vol. 2, 2010
2010
Cited alongside, same era.
T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2 , ser. NIPS’13. Red Hook, NY, USA: Curran Associates Inc., 2013, p. 3111–3119
2013
Cited alongside, same era.
S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum principal component analysis,” Nature Physics , vol. 10, no. 9, p. 631–633, Jul 2014. [Online]. Available: http://dx.doi.org/10.1038/nphys3029
2014
Cited alongside, same era.
M. Schuld, I. Sinayskiy, and F. Petruccione, “The quest for a quantum neural network,” Quantum Information Processing , vol. 13, pp. 2567–2586, 2014
2014
Cited alongside, same era.
M. Schuld, A. Bocharov, K. Svore, and N. Wiebe, “Circuit-centric quantum classifiers,” 2018
2018
Later among the works it cites.
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, “Quantum circuit learning,” Physical Review A , vol. 98, no. 3, Sep 2018. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.98.032309
2018
Later among the works it cites.
T. Imamichi and R. Raymond, “Constructions of quantum random access codes,” Asian Quantum Information Symposium (AQIS) , 2018
2018
Later among the works it cites.
E. Farhi and H. Neven, “Classification with quantum neural networks on near term processors,” 2018
2018
Later among the works it cites.
V. Havlícek, 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, pp. 209–212, 2019
2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics , vol. 18, no. 2, p. 023023, 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
A. Chailloux, I. Kerenidis, S. Kundu, and J. Sikora, “Optimal bounds for parity-oblivious random access codes,” New Journal of Physics , vol. 18, no. 4, p. 045003, 2016. [Online]. Available: http://stacks.iop.org/1367-2630/18/i=4/a=045003
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–202, Sep 2017. [Online]. Available: http://dx.doi.org/10.1038/nature23474
2017
Cited alongside, same era.
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 , vol. 549, no. 7671, p. 242, 2017
2017
Cited alongside, same era.
M. Quadeer, M. Banik, A. Ambainis, and A. Rai, “Strong supremacy of quantum systems as communication resource,” 2017
2017
Cited alongside, same era.
D. Dua and C. Graff, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
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, Feb 2019. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.122.040504
2019
Later among the works it cites.
H. Abraham and et al., “Qiskit: An open-source framework for quantum computing,” 2019
2019
Later among the works it cites.
T. Osogami and R. Raymond, “Determinantal reinforcement learning,” in AAAI , 2019, pp. 4659–4666. [Online]. Available: https://doi.org/10.1609/aaai.v33i01.33014659
2019
Later among the works it cites.
P. Jurcevic, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. Günlük, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta, “Demonstration of quantum volume 64 on a superconducting quantum computing system,” 2020
2020
Later among the works it cites.
H. Yano, Y. Suzuki, R. Raymond, and N. Yamamoto, “Efficient discrete feature encoding for variational quantum classifier,” in IEEE International Conference on Quantum Computing and Engineering (QCE) , 2020, p. to appear
2020
Later among the works it cites.
S. Lloyd, M. Schuld, A. Ijaz, J. Izaac, and N. Killoran, “Quantum embeddings for machine learning,” 2020
2020
Later among the works it cites.
J. T. Hancock and T. M. Khoshgoftaar, “Survey on categorical data for neural networks,” Journal of Big Data , vol. 7, no. 1, p. 28, Apr 2020. [Online]. Available: https://doi.org/10.1186/s40537-020-00305-w
2020
Later among the works it cites.
2020
Later among the works it cites.
Y. Goldberg and M. Elhadad, “splitSVM: Fast, space-efficient, non-heuristic, polynomial kernel computation for NLP applications,” in Proceedings of ACL-08: HLT, Short Papers . Columbus, Ohio: Association for Computational Linguistics, Jun. 2008, pp. 237–240. [Online]. Available: https://www.aclweb.org/anthology/P08-2060
2060
Closest in time.
S. Aaronson, “The learnability of quantum states,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 463, no. 2088, pp. 3089–3114, 2007. [Online]. Available: http://rspa.royalsocietypublishing.org/content/463/2088/3089
2088
Closest in time.