Multiple network alignment on quantum computers
From MaRDI portal
Publication:485371
DOI10.1007/s11128-014-0818-7zbMath1305.81050arXiv1307.7220OpenAlexW3098336268MaRDI QIDQ485371
Anmer Daskin, Ananth Grama, Sabre Kais
Publication date: 9 January 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.7220
Social networks; opinion dynamics (91D30) Quantum computation (81P68) Biochemistry, molecular biology (92C40) Applications of graph theory to circuits and networks (94C15) Systems biology, networks (92C42)
Related Items (2)
Obtaining a linear combination of the principal components of a matrix on quantum computers ⋮ Efficient quantum algorithm for similarity measures for molecules
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Using quantum computers for quantum simulation
- Efficient quantum algorithms for simulating sparse Hamiltonians
- A regularized integral equation method for the inverse geometry heat conduction problem
- A universal quantum circuit scheme for finding complex eigenvalues
- Simulating Sparse Hamiltonians with Star Decompositions
- Quantum algorithms for algebraic problems
- Authoritative sources in a hyperlinked environment
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Adiabatic quantum state generation and statistical zero knowledge
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
This page was built for publication: Multiple network alignment on quantum computers
