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

We design an algorithm that efficiently generates each of $2^n+1$ quantumcircuits capable of producing $2^n+1$ mutually unbiased bases (MUBs) on$n$-qubit systems with $O(n^3)$ time complexity. These circuits consist of amaximum of $(n^2+7n)/2$ $H$, $S$, and $CZ$ gates, structured as $-H-S-CZ-$.Alternatively, each circuit can be implemented using $H^{\otimes n}$ and adiagonal operation. On average, the count of $S$ gates, $CZ$ gates, and $CZ$gates with distance $u$ in each nontrivial circuit amounts to $3n/2$,$(n^2-n)/4$, and $(n-u)/2$, respectively. Moreover, we've observed that theentanglement segment comprises $2n-3$ fixed modules, and the $2^n$ nontrivialcircuits satisfy some intriguing ``linear" relations.

An Efficient Quantum Circuit Construction Method for Mutually Unbiased Bases in $n$-Qubit Systems