Two-particle quantum walks applied to the graph isomorphism problem Specifically, we consider the graph isomorphism problem, in which one wishes to determine whether two graphs are isomorphic (related to each other by a ... JK Gamble,M Friesen,D Zhou,... - 《Physical Review A》 被引量: 11...
2c. Since the set of order parameters Θ(v1) and Θ(v2) have both only one element, the factor graph PG(v1)≅L(v1) is isomorphic to the poset of logic parameters L(v1) in Fig. 4a and factor graph PG(v2)≅L(v2) is isomorphic to the poset of logic parameters L(v2) in...
In the Switching Tower of Hanoi interpretation of Sierpiński graphs Spn, the P2 decision problem is to find out whether the largest moving disc has to be transferred once or twice in a shortest path between two given states/vertices. We construct an essentially optimal algorithm thus extending ...