Access the full text.
Sign up today, get DeepDyve free for 14 days.
W. Jorgensen (2005)
Journal of Chemical Information and ModelingJ. Chem. Inf. Model., 45
J. Butler (1946)
Advances in Protein ChemistryNature, 158
(2008)
Pac Symp Biocomput
J. Kleinberg (1999)
Authoritative sources in a hyperlinked environment
(2010)
Rev. Mod. Phys
(2009)
Appl. Math. Inf. Sci
A. Perdomo-Ortiz, N. Dickson, Marshall Drew-Brook, G. Rose, Alán Aspuru-Guzik (2012)
Finding low-energy conformations of lattice protein models by quantum annealingScientific Reports, 2
Kevin Young, Kevin Young, M. Sarovar, M. Sarovar, Jon Aytac, C. Herdman, K. Whaley (2012)
Finite temperature quantum simulation of stabilizer HamiltoniansJournal of Physics B: Atomic, Molecular and Optical Physics, 45
D. Abrams, S. Lloyd (1998)
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and EigenvectorsPhysical Review Letters, 83
Mehmet Koyutürk, Yohan Kim, Umut Topkara, S. Subramaniam, W. Szpankowski, A. Grama (2006)
Pairwise Alignment of Protein Interaction NetworksJournal of computational biology : a journal of computational molecular cell biology, 13 2
Severo Ochoa (1996)
Proceedings of the National Academy of Sciences, USACurrent Biology, 6
Lawrence Page, S. Brin, R. Motwani, T. Winograd (1999)
The PageRank Citation Ranking : Bringing Order to the Web, 98
(1999)
Phys. Rev. Lett
L. Veis, J. Pittner (2010)
Quantum computing applied to calculations of molecular energies: CH2 benchmark.The Journal of chemical physics, 133 19
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
G. Miller (1996)
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Rohit Singh, Jinbo Xu, B. Berger (2008)
Global alignment of multiple protein interaction networks with application to functional orthology detectionProceedings of the National Academy of Sciences, 105
J. Wishart (1928)
THE GENERALISED PRODUCT MOMENT DISTRIBUTION IN SAMPLES FROM A NORMAL MULTIVARIATE POPULATIONBiometrika
Scientific reports 2 ( 2012 ) 4 . B . C . Sanders
Dawei Lu, Boruo Xu, Nanyang Xu, Zhaokai Li, Hongwei Chen, X. Peng, Ruixue Xu, Jiangfeng Du (2012)
Quantum chemistry simulation on quantum computers: theories and experiments.Physical chemistry chemical physics : PCCP, 14 26
L. Larmore, M. Goemans (2003)
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
V. Bafna, S. Sahinalp (2011)
Research in Computational Molecular Biology, 6577
(1999)
SIAM Review 41
B. Sanders (2009)
Algorithm for Quantum Simulation
(2006)
SIAM Journal on Matrix Analysis and Applications
D. Berry, Graeme Ahokas, R. Cleve, B. Sanders (2005)
Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 270
N. Bouman, S. Fehr, C. González-Guillén, Christian Schaffner (2012)
Theory of Quantum Computation, Communication, and Cryptography, 7582
A. Papageorgiou, Chi Zhang (2010)
On the efficiency of quantum algorithms for Hamiltonian simulationQuantum Information Processing, 11
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
L. Mur, P. Harmans, W. Wiel (2012)
New Journal of Physics
G. Golub, C. Loan (1996)
Matrix computations (3rd ed.)
E. Andrade (1945)
Contemporary PhysicsNature, 156
MD KINAMI, I. Miyazaki, Mdi
AND T
Anmer Daskin, S. Kais (2010)
Decomposition of Unitary Matrices for Finding Quantum CircuitsThe Journal of chemical physics, 134 14
Chung-Shou Liao, K. Lu, M. Baym, Rohit Singh, B. Berger (2009)
IsoRankN: spectral methods for global alignment of multiple protein networksBioinformatics, 25
M. Stephanov, J. Verbaarschot, T. Wettig (2005)
Random Matrices
R. Lempel, S. Moran (2000)
The stochastic approach for link-structure analysis (SALSA) and the TKC effectComput. Networks, 33
Groningen, Bures sur-Yvette, K. Hepp, M. Polivanov, Moskau, T. Regge (2004)
Communications in Mathematical Physics
A. Kitaev (1995)
Quantum measurements and the Abelian Stabilizer ProblemElectron. Colloquium Comput. Complex., TR96
M. Rupp, E. Proschak, G. Schneider (2007)
Kernel Approach to Molecular Similarity Based on Iterative Graph SimilarityJournal of chemical information and modeling, 47 6
A. Bender, R. Glen (2004)
Molecular similarity: a key technique in molecular informatics.Organic & biomolecular chemistry, 2 22
S. Raeisi, N. Wiebe, B. Sanders (2011)
Quantum-circuit design for efficient simulations of many-body quantum dynamicsNew Journal of Physics, 14
C. Kerfeld (1977)
FEMS microbiology letters
E. Knill, M. Nielsen (2000)
Theory of quantum computationarXiv: Quantum Physics
and as an in
K. Pearson (1902)
BiometrikaThe American Naturalist, 36
J. Kempe (2003)
Quantum random walks: An introductory overviewContemporary Physics, 44
G. Golub (1983)
Matrix computations
(2004)
Org. Biomol. Chem
Hefeng Wang, S. Kais, Alán Aspuru-Guzik, M. Hoffmann (2008)
Quantum algorithm for obtaining the energy spectrum of molecular systems.Physical chemistry chemical physics : PCCP, 10 35
Colin Williams (1999)
Quantum Computing and Quantum Communications, 1509
Vincent Blondel, P. Dooren (2002)
A MEASURE OF SIMILARITY BETWEEN GRAPH VERTICES . WITH APPLICATIONS TO SYNONYM EXTRACTION AND WEB SEARCHING
Anmer Daskin, A. Grama, S. Kais (2013)
A universal quantum circuit scheme for finding complex eigenvaluesQuantum Information Processing, 13
(2006)
SIAM Journal on Scientific Computing 27
(1996)
Electronic Colloquium on Computational Complexity (ECCC)
D. Aharonov, A. Ta-Shma (2003)
Adiabatic quantum state generation and statistical zero knowledge
G. Battista, M. Rimondini (2013)
Computer Networks
A Daskin, S Kais (2011)
Decomposition of unitary matrices for finding quantum circuits: application to molecular HamiltoniansJ. Chem. Phys., 134
Fred Whipple (1914)
Proceedings of the National Academy of SciencesScience
Andrew Childs, W. Dam (2008)
Quantum algorithms for algebraic problemsReviews of Modern Physics, 82
(2009)
Bioinformatics 25
James Parker, R. Rastogi (1990)
on Knowledge and Data Engineering,
(2005)
Science Phys.Chem.Chem.Phys
I. Kassal, J. Whitfield, A. Perdomo-Ortiz, M. Yung, Alán Aspuru-Guzik (2010)
Simulating chemistry using quantum computers.Annual review of physical chemistry, 62
(2011)
Annual Review of Physical Chemistry 62
Ayman Farahat, T. Lofaro, Joel Miller, G. Rae, Lesley Ward (2005)
Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of InitializationSIAM J. Sci. Comput., 27
(2006)
Journal of Computational Biology 13
Mehmet Koyutürk, S. Subramaniam, A. Grama (2012)
Functional Coherence of Molecular Networks in Bioinformatics
(2012)
Journal of Physics B: Atomic, Molecular and Optical Physics
T. Tatusova, Thomas Madden (1999)
BLAST 2 Sequences, a new tool for comparing protein and nucleotide sequences.FEMS microbiology letters, 174 2
R. Stephenson (1962)
A and VBritish Journal of Ophthalmology, 46
I. Kassal, S. Jordan, P. Love, M. Mohseni, A. Aspuru‐Guzik (2008)
Polynomial-time quantum algorithm for the simulation of chemical dynamicsProceedings of the National Academy of Sciences, 105
Daniel Lidar, Haobin Wang (1998)
Calculating the thermal rate constant with exponential speedup on a quantum computerPhysical Review E, 59
(2012)
Quantum Information Processing 11
(2011)
J. Chem. Phys
Rohit Singh, Jinbo Xu, B. Berger (2007)
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
C. Brezinski, M. Redivo-Zaglia (2006)
The PageRank Vector: Properties, Computation, Approximation, and AccelerationSIAM J. Matrix Anal. Appl., 28
A. Aspuru‐Guzik, A. Dutoi, P. Love, M. Head‐Gordon (2005)
Simulated Quantum Computation of Molecular EnergiesScience, 309
(1999)
Journal of the ACM (JACM) 46
Andrew Childs, Robin Kothari (2010)
Simulating Sparse Hamiltonians with Star Decompositions
G. Kollias, S. Mohammadi, A. Grama (2012)
Network Similarity Decomposition (NSD): A Fast and Scalable Approach to Network AlignmentIEEE Transactions on Knowledge and Data Engineering, 24
S. Mohammadi, A. Grama (2012)
Biological Network Alignment
L Veis, J Pittner (2010)
Quantum computing applied to calculations of molecular energies: $$\text{ CH }_2$$ CH 2 benchmarkJ. Chem. Phys., 133
C. Meyer (2000)
Matrix Analysis and Applied Linear Algebra
K. Brown, W. Munro, V. Kendon (2010)
Using Quantum Computers for Quantum SimulationEntropy, 12
(2005)
Science 309
Comparative analyses of graph-structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes across networks. The resulting correspondence of nodes across networks, also called node alignment, can be used to identify invariant subgraphs across the input graphs. Given $$k$$ k graphs as input, alignment algorithms use topological information to assign a similarity score to each $$k$$ k -tuple of nodes, with elements (nodes) drawn from each of the input graphs. Nodes are considered similar if their neighbors are also similar. An alternate, equivalent view of these network alignment algorithms is to consider the Kronecker product of the input graphs and to identify high-ranked nodes in the Kronecker product graph. Conventional methods such as PageRank and HITS (Hypertext-Induced Topic Selection) can be used for this purpose. These methods typically require computation of the principal eigenvector of a suitably modified Kronecker product matrix of the input graphs. We adopt this alternate view of the problem to address the problem of multiple network alignment. Using the phase estimation algorithm, we show that the multiple network alignment problem can be efficiently solved on quantum computers. We characterize the accuracy and performance of our method and show that it can deliver exponential speedups over conventional (non-quantum) methods.
Quantum Information Processing – Springer Journals
Published: Sep 7, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.