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 study the Clifford+Toffoli universal fault-tolerant gateset. We introduce a generating set in order to represent any unitaryimplementable by this gate set and with this we derive a bound on theToffoli-count of arbitrary multi-qubit unitaries. We analyse the channelrepresentation of the generating set elements, with the help of which we infer$|\mathcal{J}_n^{Tof}|<|\mathcal{J}_n^T|$, where $\mathcal{J}_n^{Tof}$ and$\mathcal{J}_n^T$ are the set of unitaries exactly implementable by theClifford+Toffoli and Clifford+T gate set, respectively. We developToffoli-count optimal synthesis algorithms for both approximately and exactlyimplementable multi-qubit unitaries. With the help of these we prove$|\mathcal{J}_n^{Tof}|=|\mathcal{J}_n^{CS}|$, where $\mathcal{J}_n^{CS}$ is theset of unitaries exactly implementable by the Clifford+CS gate set.

Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries