Physics
Scientific paper
Jan 2011
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2011njph...13a3022j&link_type=abstract
New Journal of Physics, Volume 13, Issue 1, pp. 013022 (2011).
Physics
Scientific paper
This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O(μ(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.
Jiang Xin
Ma Lili
Tang Shaoting
Wang Hailong
Zhang Zhanli
No associations
LandOfFree
A new approach to shortest paths on networks based on the quantum bosonic mechanism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new approach to shortest paths on networks based on the quantum bosonic mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new approach to shortest paths on networks based on the quantum bosonic mechanism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1609072