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

A key task in quantum computation is the application of a sequence of gatesimplementing a specific unitary operation. However, the decomposition of anarbitrary unitary operation into simpler quantum gates is a nontrivial problem.Here we propose a general and robust protocol to decompose any target unitaryinto a sequence of Pauli rotations. The procedure involves identifying acommuting subset of Pauli operators having a high trace overlap with the targetunitary, followed by a numerical optimization of their corresponding rotationangles. The protocol is demonstrated by decomposing several standard quantumoperations. The applications of the protocol for quantum state preparation andquantum simulations are also described. Finally, we describe an NMR experimentimplementing a three-body quantum simulation, wherein the above decompositiontechnique is used for the efficient realization of propagators.

Pauli Decomposition over Commuting Subsets: Applications in Gate Synthesis, State Preparation, and Quantum Simulations