Advertisement

A Quantum Algorithm for Minimising the Effective Graph Resistance upon Edge Addition

  • Finn de RidderEmail author
  • Niels Neumann
  • Thijs Veugen
  • Robert Kooij
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11413)

Abstract

In this work, we consider the following problem: given a graph, the addition of which single edge minimises the effective graph resistance of the resulting (or, augmented) graph. A graph’s effective graph resistance is inversely proportional to its robustness, which means the graph augmentation problem is relevant to, in particular, applications involving the robustness and augmentation of complex networks. On a classical computer, the best known algorithm for a graph with N vertices has time complexity \(\mathcal {O}(N^5)\). We show that it is possible to do better: Dürr and Høyer’s quantum algorithm solves the problem in time \(\mathcal {O}(N^4)\). We conclude with a simulation of the algorithm and solve ten small instances of the graph augmentation problem on the Quantum Inspire quantum computing platform.

Keywords

Graph augmentation Effective graph resistance Dürr and Høyer’s algorithm Quantum Inspire 

References

  1. 1.
    Abbas, W., Egerstedt, M.: Robust graph topologies for networked systems. In: IFAC Proceedings, vol. 45, no. 26, pp. 85–90, September 2012.  https://doi.org/10.3182/20120914-2-US-4030.00052, https://linkinghub.elsevier.com/retrieve/pii/S147466701534814X
  2. 2.
    Asztalos, A., Sreenivasan, S., Szymanski, B., Korniss, G.: Distributed flow optimization and cascading effects in weighted complex networks. Eur. Phys. J. B 85(8) (2012).  https://doi.org/10.1140/epjb/e2012-30122-3, http://www.springerlink.com/index/10.1140/epjb/e2012-30122-3
  3. 3.
    Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4–5), 493–505 (1998)CrossRefGoogle Scholar
  4. 4.
    Deng, H.: On the minimum Kirchhoff index of graphs with a given number of cut-edges. MATCH Commun. Math. Comput. Chem. 63, 171–180 (2010)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Dürr, C., Heiligman, M., Høyer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput. 35(6), 1310–1328 (2006)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dürr, C., Høyer, P.: A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014, July 1996. http://arxiv.org/abs/quant-ph/9607014
  7. 7.
    Ellens, W., Spieksma, F., Van Mieghem, P., Jamakovic, A., Kooij, R.: Effective graph resistance. Linear Algebra Appl. 435(10), 2491–2506 (2011).  https://doi.org/10.1016/j.laa.2011.02.024, http://linkinghub.elsevier.com/retrieve/pii/S0024379511001443
  8. 8.
    Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. SIAM Rev. 50(1), 37–66 (2008).  https://doi.org/10.1137/050645452, http://epubs.siam.org/doi/10.1137/050645452
  9. 9.
    Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. The Johns Hopkins University Press, Baltimore (2013)zbMATHGoogle Scholar
  10. 10.
    Grover, L.K.: A fast quantum mechanical algorithm for database search, pp. 212–219. ACM Press (1996).  https://doi.org/10.1145/237814.237866, http://portal.acm.org/citation.cfm?doid=237814.237866
  11. 11.
    Harary, F.: Graph Theory. Perseus Books, Cambridge (2001)zbMATHGoogle Scholar
  12. 12.
    Kim, Y.: Bisection algorithm of increasing algebraic connectivity by adding an edge. IEEE Trans. Autom. Control 55(1), 170–174 (2010).  https://doi.org/10.1109/TAC.2009.2033763, http://ieeexplore.ieee.org/document/5340588/
  13. 13.
    Koç, Y., Warnier, M., Mieghem, P.V., Kooij, R.E., Brazier, F.M.: The impact of the topology on cascading failures in a power grid model. Physica A: Stat. Mech. Appl. 402, 169–179 (2014).  https://doi.org/10.1016/j.physa.2014.01.056, https://linkinghub.elsevier.com/retrieve/pii/S0378437114000776
  14. 14.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th Anniversary edn. Cambridge University Press, Cambridge (2010)Google Scholar
  15. 15.
    QuTech: Quantum Inspire (2018). https://www.quantum-inspire.com/. Accessed 15 Nov 2018
  16. 16.
    Van Mieghem, P.: Graph Spectra for Complex Networks. Cambridge University Press, Cambridge (2011)zbMATHGoogle Scholar
  17. 17.
    Wang, H., Van Mieghem, P.: Algebraic connectivity optimization via link addition. In: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems, BIONETICS 2008, pp. 22:1–22:8, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Brussels (2008). http://dl.acm.org/citation.cfm?id=1512504.1512532
  18. 18.
    Wang, X., Feng, L., Kooij, R.E., Marzo, J.L.: Inconsistencies among spectral robustness metrics. In: Proceedings of QSHINE 2018–14th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (2018)Google Scholar
  19. 19.
    Wang, X., Koç, Y., Kooij, R.E., Van Mieghem, P.: A network approach for power grid robustness against cascading failures. In: 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM), pp. 208–214. IEEE, Munich, October 2015.  https://doi.org/10.1109/RNDM.2015.7325231, http://ieeexplore.ieee.org/document/7325231/
  20. 20.
    Wang, X., Pournaras, E., Kooij, R.E., Van Mieghem, P.: Improving robustness of complex networks via the effective graph resistance. Eur. Phys. J. B 87(9) (2014).  https://doi.org/10.1140/epjb/e2014-50276-0, http://link.springer.com/10.1140/epjb/e2014-50276-0

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Finn de Ridder
    • 1
    Email author
  • Niels Neumann
    • 2
  • Thijs Veugen
    • 2
    • 3
  • Robert Kooij
    • 4
    • 5
  1. 1.Radboud UniversityNijmegenThe Netherlands
  2. 2.TNOThe HagueThe Netherlands
  3. 3.CWIAmsterdamThe Netherlands
  4. 4.iTrust Centre for Research in Cyber SecuritySingapore University of Technology and DesignSingaporeSingapore
  5. 5.Faculty of Electrical Engineering, Mathematics and Computer ScienceDelft University of TechnologyDelftThe Netherlands

Personalised recommendations