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

Studies on Quantum Computing have been developed since the 1980s, motivatingresearches on quantum algorithms better than any classical algorithm possible.An example of such algorithms is Grover's algorithm, capable of finding $k$(marked) elements in an unordered database with $N$ elements using$O(\sqrt{N/k})$ steps. Grover's algorithm can be interpreted as a quantum walkin a complete graph (with loops) containing $N$ vertices from which $k$ aremarked. This interpretation motivated search algorithms in other graphs --complete bipartite graph, grid, and hypercube. Using Grover's algorithm'slinear operator, the quantum counting algorithm estimates the value of $k$ withan error of $O(\sqrt{k})$ using $O(\sqrt{N})$ steps. This work tackles theproblem of using the quantum counting algorithm for estimating the value $k$ ofmarked elements in other graphs; more specifically, the complete bipartitegraph. It is concluded that for a particular case, running the proposedalgorithm at most $t$ times wields an estimation of $k$ with an error of$O(\sqrt{k})$ using $O(t\sqrt{N})$ steps and success probability of at least$(1 - 2^{-t})8/\pi^2$.

Algoritmo de Contagem Qu\^antico Aplicado ao Grafo Bipartido Completo