Fetching the paper…
Reading the bibliography…
Quantum machine learning is a fast-emerging field that aims to tackle machine learning using quantum algorithms and quantum computing.
V. N. Vapnik and A. Chervonenkis, “A note on one class of perceptrons,” Automation and Remote Control , vol. 25, jan 1964
1964
Earlier work this paper cites.
B. Weisfeiler and A. Leman, “A reduction of a Graph to a Canonical Form and an Algebra Arising during this Reduction (in Russian),” Nauchno-Technicheskaya Informatsia , vol. 9, jan 1968
1968
Earlier work this paper cites.
R. Lab, “Protein function prediction via graph kernels,” Oral Radiology , vol. 6, no. 2, pp. 29–35, 1990
1990
Earlier work this paper cites.
A. K. Debnath, R. L. L. D. Compadre, G. Debnath, A. J. Shusterman, and C. Hansch, “Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity.” Journal of Medicinal Chemistry , vol. 34, no. 2, pp. 786–797, 1991
1991
Earlier work this paper cites.
xiaoyaolanyun, “Quantum computing framework: Qpanda,” 2000. [Online]. Available: https://github.com/OriginQ/QPanda-2
2000
Earlier work this paper cites.
C. Helma, R. D. King, S. Kramer, and A. Srinivasan, “The predictive toxicology challenge 2000-2001,” Bioinformatics , vol. 17, no. 1, pp. 107–108, 2001
2001
Earlier work this paper cites.
M. J. D. Powell, “Uobyqa: unconstrained optimization by quadratic approximation,” Mathematical Programming , vol. 92, no. 3, pp. 555–582, 2002
2002
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE transactions on neural networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The Graph Neural Network Model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, p. 61, 2009
2009
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. Jan, V. Leeuwen, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels,” Journal of Machine Learning Research , vol. 1, pp. 1–48, 2010
2010
Earlier work this paper cites.
R. Raussendorf, “Key ideas in quantum error correction,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 370, no. 1975, pp. 4541–4565, 2012
2012
Earlier work this paper cites.
N. Kriege and P. Mutzel, “Subgraph matching kernels for attributed graphs,” Proceedings of the 29th International Conference on Machine Learning, ICML 2012 , vol. 2, 06 2012
2012
Earlier work this paper cites.
S. Lu and S. Braunstein, “Quantum decision tree classifier,” Quantum information processing , vol. 3, no. 13, pp. 757–777, 2014
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun, “Spectral networks and locally connected networks on graphs,” in International Conference on Learning Representations (ICLR2014), CBLS, April 2014 , 2014, pp. http–openreview
2014
Earlier work this paper cites.
P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,” Physical Review Letters , vol. 113, no. 13, p. 130503, 2014
2014
Earlier work this paper cites.
O. Rippel, J. Snoek, and R. P. Adams, “Spectral representations for convolutional neural networks,” in Proceedings of the 28th International Conference on Neural Information Processing Systems-Volume 2 , 2015, pp. 2449–2457
2015
Earlier work this paper cites.
P. Yanardag and S. Vishwanathan, “Deep graph kernels,” in Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining , 2015, pp. 1365–1374
2015
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” Computer ence , 2015
2015
Earlier work this paper cites.
P. Battaglia, R. Pascanu, M. Lai, D. J. Rezende, and K. kavukcuoglu, “Interaction networks for learning about objects, relations and physics,” in Proceedings of the 30th International Conference on Neural Information Processing Systems , 2016, pp. 4509–4517
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Proceedings of the 30th International Conference on Neural Information Processing Systems , 2016, pp. 3844–3852
2016
Earlier work this paper cites.
T. Hamaguchi, H. Oiwa, M. Shimbo, and Y. Matsumoto, “Knowledge transfer for out-of-knowledge-base entities : A graph neural network approach,” in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17 , 2017, pp. 1802–1808. [Online]. Available: https://doi.org/10.24963/ijcai.2017/250
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems 30 , I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds. Curran Associates, Inc., 2017, pp. 1024–1034. [Online]. Available: http://papers.nips.cc/paper/6703-inductive-representation-learning-on-large-graphs.pdf
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” 2017
2017
Earlier work this paper cites.
E. B. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” in NIPS , 2017
2017
Cited alongside, same era.
M. Schuld and N. Killoran, “Quantum machine learning in feature Hilbert spaces,” Physical Review Letters , 2018
2018
Cited alongside, same era.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in 15th International Conference on Extended Semantic Web Conference, ESWC 2018 . Springer/Verlag, 2018, pp. 593–607
2018
Cited alongside, same era.
A. Sanchez-Gonzalez, N. Heess, J. T. Springenberg, J. Merel, M. Riedmiller, R. Hadsell, and P. Battaglia, “Graph networks as learnable physics engines for inference and control,” in International Conference on Machine Learning . PMLR, 2018, pp. 4470–4479
2018
Cited alongside, same era.
T. Birdal, V. Golyanik, C. Theobalt, and L. Guibas, “Quantum permutation synchronization,” 2021
2019
Later among the works it cites.
G. Nikolentzos and M. Vazirgiannis, “Random walk graph neural networks,” Advances in Neural Information Processing Systems , vol. 33, pp. 16 211–16 222, 2020
2020
Later among the works it cites.
Y. Yang, Z. Feng, M. Song, and X. Wang, “Factorizable graph convolutional networks,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
C. Gallicchio and A. Micheli, “Fast and deep graph neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, 2020, pp. 3898–3905
2020
Later among the works it cites.
G. Bachmann, G. Bécigneul, and O. Ganea, “Constant curvature graph convolutional networks,” in International Conference on Machine Learning . PMLR, 2020, pp. 486–496
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in European semantic web conference . Springer, 2018, pp. 593–607
2018
Cited alongside, same era.
M. Zhang, Z. Cui, M. Neumann, and Y. Chen, “An end-to-end deep learning architecture for graph classification,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 32, 2018
2018
Cited alongside, same era.
S. Dernbach, A. Mohseni-Kabir, S. Pal, and D. Towsley, “Quantum walk neural networks for graph-structured data,” in International Conference on Complex Networks and their Applications . Springer, 2018, pp. 182–193
2018
Cited alongside, same era.
S. Lloyd and C. Weedbrook, “Quantum generative adversarial learning,” Physical Review Letters , vol. 121, no. 4, pp. 040 502.1–040 502.5, 2018
2018
Cited alongside, same era.
M. Bozzo-Rey and R. Loredo, “Introduction to the ibm q experience and quantum computing,” in Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering , 2018, pp. 410–412
2018
Cited alongside, same era.
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, pp. 209–212, 2019
2019
Cited alongside, same era.
I. Cong, S. Choi, and M. D. Lukin, “Quantum convolutional neural networks,” Nature Physics , vol. 15, no. 12, pp. 1273–1278, 2019
2019
Cited alongside, same era.
2020
Later among the works it cites.
H. Situ, Z. He, Y. Wang, L. Li, and S. Zheng, “Quantum generative adversarial network for generating discrete distribution,” Information Sciences , vol. 538, pp. 193–208, 2020
2020
Later among the works it cites.
J. Zheng, Q. Gao, and Y. Lü, “Quantum graph convolutional neural networks,” in 2021 40th Chinese Control Conference (CCC) . IEEE, 2021, pp. 6335–6340
2021
Later among the works it cites.
D. Sandfelder, P. Vijayan, and W. L. Hamilton, “Ego-gnns: Exploiting ego structures in graph neural networks,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2021, pp. 8523–8527
2021
Later among the works it cites.
J. Zhao, C. Li, Q. Wen, Y. Wang, Y. Liu, H. Sun, X. Xie, and Y. Ye, “Gophormer: Ego-graph transformer for node classification,” 2021
2021
Later among the works it cites.
Q. Zhu, C. Yang, Y. Xu, H. Wang, C. Zhang, and J. Han, “Transfer learning of graph neural networks with ego-graph information maximization,” Advances in Neural Information Processing Systems , vol. 34, pp. 1766–1779, 2021
2021
Later among the works it cites.
C. Tüysüz, C. Rieger, K. Novotny, B. Demirköz, D. Dobos, K. Potamianos, S. Vallecorsa, J.-R. Vlimant, and R. Forster, “Hybrid quantum classical graph neural networks for particle track reconstruction,” Quantum Machine Intelligence , vol. 3, no. 2, pp. 1–20, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
P. A. Papp, K. Martinkus, L. Faber, and R. Wattenhofer, “Dropgnn: random dropouts increase the expressiveness of graph neural networks,” Advances in Neural Information Processing Systems , vol. 34, pp. 21 997–22 009, 2021
2021
Later among the works it cites.
M. Broughton, G. Verdon, T. McCourt, A. J. Martinez, J. H. Yoo, S. V. Isakov, P. Massey, R. Halavati, M. Y. Niu, A. Zlokapa, E. Peters, O. Lockwood, A. Skolik, S. Jerbi, V. Dunjko, M. Leib, M. Streif, D. V. Dollen, H. Chen, S. Cao, R. Wiersema, H.-Y. Huang, J. R. McClean, R. Babbush, S. Boixo, D. Bacon, A. K. Ho, H. Neven, and M. Mohseni, “Tensorflow quantum: A software framework for quantum machine learning,” 2021
2021
Later among the works it cites.
T. Zhang, Q. Wu, and J. Yan, “Learning high-order graph convolutional networks via adaptive layerwise aggregation combination,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Later among the works it cites.
R. Wang, J. Yan, and X. Yang, “Combinatorial learning of robust deep graph matching: an embedding based approach,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2021
2021
Later among the works it cites.
P. Mernyei, K. Meichanetzidis, and I. I. Ceylan, “Equivariant quantum graph circuits,” in International Conference on Machine Learning . PMLR, 2022, pp. 15 401–15 420
2022
Closest in time.
G. Yan, Y. Tang, and J. Yan, “Towards a native quantum paradigm for graph representation learning: A sampling-based recurrent embedding approach,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2022, pp. 2160–2168
2022
Closest in time.
J. Y. Yehui Tang, “GraphQNTK: the quantum neural tangent kernel for graph data.” in Proceedings of the 36th International Conference on Neural Information Processing Systems , 2022
2022
Closest in time.
——, “Scalegcn: Efficient and effective graph convolution via channel-wise scale transformation,” IEEE Transactions on Neural Networks and Learning Systems , 2022
2022
Closest in time.
Q. Wu, H. Zhang, J. Yan, and D. Wipf, “Handling distribution shifts on graphs: An invariance perspective,” in International Conference on Learning Representation , 2022
2022
Closest in time.
——, “Neural graph matching network: Learning lawler’s quadratic assignment problem with extension to hypergraph and multiple-graph matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2022
2022
Closest in time.