{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:13:42Z","timestamp":1761844422591,"version":"3.40.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2014,9,7]],"date-time":"2014-09-07T00:00:00Z","timestamp":1410048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s11128-014-0818-7","type":"journal-article","created":{"date-parts":[[2014,9,6]],"date-time":"2014-09-06T10:37:25Z","timestamp":1409999845000},"page":"2653-2666","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Multiple network alignment on quantum computers"],"prefix":"10.1007","volume":"13","author":[{"given":"Anmer","family":"Daskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananth","family":"Grama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabre","family":"Kais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,7]]},"reference":[{"key":"818_CR1","doi-asserted-by":"crossref","unstructured":"Abrams, D.S., Lloyd, S.: Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys. Rev. Lett. 83(24), 5162\u20135165 (1999). doi: 10.1103\/PhysRevLett.83.5162","DOI":"10.1103\/PhysRevLett.83.5162"},{"issue":"2","key":"818_CR2","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s11128-011-0263-9","volume":"11","author":"A Papageorgiou","year":"2012","unstructured":"Papageorgiou, A., Zhang, C.: On the efficiency of quantum algorithms for Hamiltonian simulation. Quantum Inf. Process. 11(2), 541\u2013561 (2012)","journal-title":"Quantum Inf. Process."},{"key":"818_CR3","doi-asserted-by":"crossref","unstructured":"Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., Aspuru-Guzik, A.: Finding low-energy conformations of lattice protein models by quantum annealing. Sci. Rep. 2 (2012)","DOI":"10.1038\/srep00571"},{"issue":"2","key":"818_CR4","first-page":"117","volume":"3","author":"BC Sanders","year":"2009","unstructured":"Sanders, B.C.: Algorithm for quantum simulation. Appl. Math. Inf. Sci. 3(2), 117\u2013122 (2009)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"10","key":"818_CR5","doi-asserted-by":"crossref","first-page":"103,017","DOI":"10.1088\/1367-2630\/14\/10\/103017","volume":"14","author":"S Raeisi","year":"2012","unstructured":"Raeisi, S., Wiebe, N., Sanders, B.C.: Quantum-circuit design for efficient simulations of many-body quantum dynamics. New J. Phys. 14(10), 103,017 (2012)","journal-title":"New J. Phys."},{"issue":"48","key":"818_CR6","doi-asserted-by":"crossref","first-page":"18,681","DOI":"10.1073\/pnas.0808245105","volume":"105","author":"I Kassal","year":"2008","unstructured":"Kassal, I., Jordan, S.P., Love, P.J., Mohseni, M., Aspuru-Guzik, A.: Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. 105(48), 18,681\u201318,686 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"818_CR7","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1103\/PhysRevE.59.2429","volume":"59","author":"D Lidar","year":"1999","unstructured":"Lidar, D., Wang, H.: Calculating the thermal rate constant with exponential speedup on a quantum computer. Phys. Rev. E 59, 2429 (1999)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"818_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999). doi: 10.1137\/S0036144598347011","journal-title":"SIAM Rev."},{"key":"818_CR9","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search.In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, pp. 212\u2013219. ACM, New York (1996)","DOI":"10.1145\/237814.237866"},{"key":"818_CR10","doi-asserted-by":"crossref","unstructured":"Brown, K.L., Munro, W.J., Kendon, V.M.: Using quantum computers for quantum simulation. Entropy 12(11), 2268\u20132307 (2010)","DOI":"10.3390\/e12112268"},{"key":"818_CR11","doi-asserted-by":"crossref","first-page":"9411","DOI":"10.1039\/c2cp23700h","volume":"14","author":"D Lu","year":"2012","unstructured":"Lu, D., Xu, B., Xu, N., Li, Z., Chen, H., Peng, X., Xu, R., Du, J.: Quantum chemistry simulation on quantum computers: theories and experiments. Phys. Chem. Chem. Phys. 14, 9411\u20139420 (2012). doi: 10.1039\/C2CP23700H","journal-title":"Phys. Chem. Chem. Phys."},{"issue":"1","key":"818_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1146\/annurev-physchem-032210-103512","volume":"62","author":"I Kassal","year":"2011","unstructured":"Kassal, I., Whitfield, J.D., Perdomo-Ortiz, A., Yung, M.H., Aspuru-Guzik, A.: Simulating chemistry using quantum computers. Annu. Rev. Phys. Chem. 62(1), 185\u2013207 (2011). doi: 10.1146\/annurev-physchem-032210-103512 . PMID: 21166541","journal-title":"Annu. Rev. Phys. Chem."},{"issue":"15","key":"818_CR13","doi-asserted-by":"crossref","first-page":"154,012","DOI":"10.1088\/0953-4075\/45\/15\/154012","volume":"45","author":"KC Young","year":"2012","unstructured":"Young, K.C., Sarovar, M., Aytac, J., Herdman, C., Whaley, K.B.: Finite temperature quantum simulation of stabilizer hamiltonians. J. Phys. B: At. Mol. Opt. Phys. 45(15), 154,012 (2012)","journal-title":"J. Phys. B: At. Mol. Opt. Phys."},{"key":"818_CR14","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1126\/science.1113479","volume":"309","author":"A Aspuru-Guzik","year":"2005","unstructured":"Aspuru-Guzik, A., Dutoi, A., Love, P., Head-Gordon, M.: Simulated quantum computation of molecular energies. Science 309, 1704 (2005)","journal-title":"Science"},{"key":"818_CR15","doi-asserted-by":"crossref","first-page":"5388","DOI":"10.1039\/b804804e","volume":"10","author":"H Wang","year":"2008","unstructured":"Wang, H., Kais, S., Aspuru-Guzik, A., Hoffmann, M.: Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10, 5388 (2008)","journal-title":"Phys. Chem. Chem. Phys."},{"key":"818_CR16","doi-asserted-by":"crossref","first-page":"194,106","DOI":"10.1063\/1.3503767","volume":"133","author":"L Veis","year":"2010","unstructured":"Veis, L., Pittner, J.: Quantum computing applied to calculations of molecular energies: $$\\text{ CH }_2$$ CH 2 benchmark. J. Chem. Phys. 133, 194,106 (2010)","journal-title":"J. Chem. Phys."},{"issue":"14","key":"818_CR17","doi-asserted-by":"crossref","first-page":"144,112","DOI":"10.1063\/1.3575402","volume":"134","author":"A Daskin","year":"2011","unstructured":"Daskin, A., Kais, S.: Decomposition of unitary matrices for finding quantum circuits: application to molecular Hamiltonians. J. Chem. Phys. 134(14), 144,112 (2011). doi: 10.1063\/1.3575402","journal-title":"J. Chem. Phys."},{"issue":"2","key":"818_CR18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s11128-013-0654-1","volume":"13","author":"A Daskin","year":"2014","unstructured":"Daskin, A., Grama, A., Kais, S.: A universal quantum circuit scheme for finding complex eigenvalues. Quantum Inf. Process. 13(2), 333\u2013353 (2014). doi: 10.1007\/s11128-013-0654-1","journal-title":"Quantum Inf. Process."},{"key":"818_CR19","doi-asserted-by":"crossref","unstructured":"Childs, A.M., van Dam, W.: Quantum algorithms for algebraic problems. Rev. Mod. Phys. 82, 1\u201352 (2010). doi: 10.1103\/RevModPhys.82.1","DOI":"10.1103\/RevModPhys.82.1"},{"key":"818_CR20","unstructured":"Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. Electron. Colloq. Comput. Complex. 3(3) (1996)"},{"key":"818_CR21","doi-asserted-by":"crossref","unstructured":"Mohammadi, S., Grama, A.: Biological network alignment. In: Functional Coherence of Molecular Networks in Bioinformatics, pp. 97\u2013136. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-0320-3_5"},{"issue":"12","key":"818_CR22","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1109\/TKDE.2011.174","volume":"24","author":"G Kollias","year":"2012","unstructured":"Kollias, G., Mohammadi, S., Grama, A.: Network similarity decomposition (nsd): a fast and scalable approach to network alignment. IEEE Trans. Knowl. Data Eng. 24(12), 2232\u20132243 (2012). doi: 10.1109\/TKDE.2011.174","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"818_CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1089\/cmb.2006.13.182","volume":"13","author":"M Koyut\u00fcrk","year":"2006","unstructured":"Koyut\u00fcrk, M., Kim, Y., Topkara, U., Subramaniam, S., Szpankowski, W., Grama, A.: Pairwise alignment of protein interaction networks. J. Comput. Biol. 13(2), 182\u2013199 (2006)","journal-title":"J. Comput. Biol."},{"key":"818_CR24","doi-asserted-by":"crossref","unstructured":"Singh, R., Xu, J., Berger, B.: Pairwise global alignment of protein interaction networks by matching neighborhood topology. In: Research in Computational Molecular Biology, Lecture Notes in Computer Science, vol. 4453, pp. 16\u201331. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-71681-5_2"},{"key":"818_CR25","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201903, pp. 20\u201329. ACM, New York (2003). doi: 10.1145\/780542.780546","DOI":"10.1145\/780542.780546"},{"key":"818_CR26","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citationranking: bringing order to the web. Technical Report 1999-66,Stanford InfoLab (1999). Previous number = SIDL-WP-1999-0120"},{"issue":"2","key":"818_CR27","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/050626612","volume":"28","author":"C Brezinski","year":"2006","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The pagerank vector: properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl. 28(2), 551\u2013575 (2006). doi: 10.1137\/050626612","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"818_CR28","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"2","key":"818_CR29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.1574-6968.1999.tb13575.x","volume":"174","author":"TA Tatusova","year":"1999","unstructured":"Tatusova, T.A., Madden, T.L.: Blast 2 sequences, a new tool for comparing protein and nucleotide sequences. FEMS Microbiol. Lett. 174(2), 247\u2013250 (1999)","journal-title":"FEMS Microbiol. Lett."},{"key":"818_CR30","doi-asserted-by":"crossref","unstructured":"Singh, R., Xu, J., Berger, B., et al.: Global alignment of multipleprotein interaction networks. In: Pacific Symposium on Biocomputing, vol.\u00a013, pp.303\u2013314 (2008)","DOI":"10.1142\/9789812776136_0030"},{"issue":"12","key":"818_CR31","doi-asserted-by":"crossref","first-page":"i253","DOI":"10.1093\/bioinformatics\/btp203","volume":"25","author":"CS Liao","year":"2009","unstructured":"Liao, C.S., Lu, K., Baym, M., Singh, R., Berger, B.: Isorankn: spectral methods for global alignment of multiple protein networks. Bioinformatics 25(12), i253\u2013i258 (2009)","journal-title":"Bioinformatics"},{"key":"818_CR32","doi-asserted-by":"crossref","first-page":"3204","DOI":"10.1039\/b409813g","volume":"2","author":"A Bender","year":"2004","unstructured":"Bender, A., Glen, R.C.: Molecular similarity: a key technique in molecular informatics. Org. Biomol. Chem. 2, 3204\u20133218 (2004). doi: 10.1039\/B409813G","journal-title":"Org. Biomol. Chem."},{"issue":"6","key":"818_CR33","doi-asserted-by":"crossref","first-page":"2280","DOI":"10.1021\/ci700274r","volume":"47","author":"M Rupp","year":"2007","unstructured":"Rupp, M., Proschak, E., Schneider, G.: Kernel approach to molecular similarity based on iterative graph similarity. J. Chem. Inf. Model. 47(6), 2280\u20132286 (2007)","journal-title":"J. Chem. Inf. Model."},{"issue":"5","key":"818_CR34","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"818_CR35","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S1389-1286(00)00034-7","volume":"33","author":"R Lempel","year":"2000","unstructured":"Lempel, R., Moran, S.: The stochastic approach for link-structure analysis (salsa) and the tkc effect. Comput. Netw. 33(1), 387\u2013401 (2000)","journal-title":"Comput. Netw."},{"issue":"4","key":"818_CR36","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1137\/S1064827502412875","volume":"27","author":"A Farahat","year":"2006","unstructured":"Farahat, A., LoFaro, T., Miller, J.C., Rae, G., Ward, L.A.: Authority rankings from hits, pagerank, and salsa: existence, uniqueness, and effect of initialization. SIAM J. Sci. Comput. 27(4), 1181\u20131201 (2006)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"818_CR37","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van Dooren, P.: A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev. 46(4), 647\u2013666 (2004)","journal-title":"SIAM Rev."},{"key":"818_CR38","doi-asserted-by":"crossref","unstructured":"Meyer, C.: Matrix Analysis and Applied Linear Algebra Book and Solutions Manual, vol.\u00a02. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719512"},{"issue":"1\/2","key":"818_CR39","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1093\/biomet\/20A.1-2.32","volume":"20","author":"J Wishart","year":"1928","unstructured":"Wishart, J.: The generalised product moment distribution in samples from a normal multivariate population. Biometrika 20(1\/2), 32\u201352 (1928)","journal-title":"Biometrika"},{"key":"818_CR40","volume-title":"Random Matrices","author":"ML Mehta","year":"2004","unstructured":"Mehta, M.L.: Random Matrices, vol. 142. Academic Press, London (2004)"},{"issue":"2","key":"818_CR41","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s00220-006-0150-x","volume":"270","author":"D Berry","year":"2007","unstructured":"Berry, D., Ahokas, G., Cleve, R., Sanders, B.: Efficient quantum algorithms for simulating sparse hamiltonians. Commun. Math. Phys. 270(2), 359\u2013371 (2007). doi: 10.1007\/s00220-006-0150-x","journal-title":"Commun. Math. Phys."},{"key":"818_CR42","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Kothari, R.: Simulating sparse hamiltonians with stardecompositions. In: Theory of Quantum Computation, Communication,and Cryptography, pp. 94\u2013103. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-18073-6_8"},{"issue":"4","key":"818_CR43","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J Kempe","year":"2003","unstructured":"Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307\u2013327 (2003)","journal-title":"Contemp. Phys."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0818-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-014-0818-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0818-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T14:17:28Z","timestamp":1746368248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-014-0818-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,7]]},"references-count":43,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s11128-014-0818-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2014,9,7]]}}}