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

Multi-qubit interactions are omnipresent in quantum computing hardware, andthey can generate multi-qubit entangling gates. Such gates promise advantagesover traditional two-qubit gates. In this work, we focus on the quantum gatesynthesis with multi-qubit Ising-type interactions and single-qubit gates.These interactions can generate global ZZ-gates (GZZ gates). We show that thesynthesis of time-optimal multi-qubit gates is NP-hard. However, under certainassumptions we provide explicit constructions of time-optimal multi-qubit gatesallowing for efficient synthesis. These constructed multi-qubit gates have aconstant gate time and can be implemented with linear single-qubit gate layers.Moreover, a heuristic algorithm with polynomial runtime for synthesizing fastmulti-qubit gates is provided. Finally, we prove lower and upper bounds on theoptimal GZZ gate-time. Furthermore, we conjecture that any GZZ gate can beexecuted in a time O(n) for n qubits. We support this claim with theoreticaland numerical results.

Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds