Portfolio Asset Identification using Graph Algorithms on a Quantum Annealer (12 of 18 )
Author Faisal I Qureshi Toronto Canada
Title Portfolio Asset Identification using Graph Algorithms on a Quantum Annealer
Cat Research Paper
Ref Page 12 of 18
Samin Aref. Balance and frustration in signed networks under different contexts. arXiv preprint arXiv:1712.04628, 2017.
S Boixo. S. boixo, t. albash, fm spedalieri, n. chancellor, and da lidar, nat. commun. 4, 2067 (2013). Nat. Commun., 4:2067, 2013.
Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer. Evidence for quantum annealing with more than one hundred qubits. Nature Physics, 10(3):218, 2014.
Immanuel M Bomze, Marco Budinich, Panos M Pardalos, and Marcello Pelillo. The maximum clique problem. In Handbook of combinatorial optimization, pages 1–74. Springer, 1999.
Hua Calude, Dinneen. Qubo formulations for graph isomorphism problem and related problems. Theoretical Computer Science, 701:54–69, 2017.
Andrew Childs. Lecture 18: The quantum adiabatic theorem. University of Waterloo, pages 1–5, 2008. Accessed: 2018–12–07.
E.D. Dahl. Programming with D-Wave: Map COloring Problem. Technical report. Paul Erdos. Graph theory and probability. canad. J. Math, 11(11):34–38, 1959.
Frank Harary, Meng-Hiot Lim, and Donald C Wunsch. Signed graphs for portfolio analysis in risk manage- ment. IMA Journal of management mathematics, 13(3):201–210, 2002.
Frank Harary et al. On the notion of balance of a signed graph. The Michigan Mathematical Journal, 2(2): 143–146, 1953.
Maritza Hernandez, Arman Zaribafiyan, Maliheh Armamon, and Mohammad Naghibi. Quantum Approaches to Graph Similarity. Technical report.
Falk Hu¨ffner, Nadja Betzler, and Rolf Niedermeier. Separator-based data reduction for signed graph balanc- ing. Journal of combinatorial optimization, 20(4):335–360, 2010.
Thore Husfeldt. Graph colouring algorithms. In Encyclopedia of Mathematics and its Applications, chap- ter 13, pages 277–303. Cambridge University Press, 2015.
Mario Levorato, Rosa Figueiredo, Yuri Frota, and Lu´cia Drummond. Evaluating balancing on social net- works through the efficient solution of correlation clustering problems. EURO Journal on Computational Optimization, 5(4):467–498, 2017.
Florian Neukart, David Von Dollen, and Christian Seidel. Quantum-assisted cluster analysis on a quantum annealing device. Frontiers in Physics, 6:55, 2018.
John Preskill. Quantum computing in the nisq era and beyond. arXiv preprint arXiv:1801.00862, 2018. Hayato Ushijima-Mwesigwa, Christian FA Negre, and Susan M Mniszewski. Graph partitioning using quan-
tum annealing on the d-wave system. In Proceedings of the Second International Workshop on Post Moores Era Supercomputing, pages 22–29. ACM, 2017.
Qinghua Wu and Jin-Kao Hao. A review on algorithms for maximum clique problems. European Journal of Operational Research, 242(3):693–709, 2015.
