English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider a continuous-time quantum walk based searchalgorithm. We introduce equitable partition of the graph and perfect statetransfer on it. By these two methods, we can calculate the success probabilityand the finding time of the search algorithm. In addition, we gave someexamples of graphs that we can calculate the success probability and thefinding time.

Perfect state transfer, Equitable partition and Continuous-time quantum walk based search