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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Recent developments in engineering and algorithms have made real-worldapplications in quantum computing possible in the near future. Existing quantumprogramming languages and compilers use a quantum assembly language composed of1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate thisquantum assembly to electric signals (called control pulses) that implement thespecified computation on specific physical devices. However, there is amismatch between the operations defined by the 1- and 2-qubit logical ISA andtheir underlying physical implementation, so the current practice of directlytranslating logical instructions into control pulses results in inefficient,high-latency programs. To address this inefficiency, we propose a universalquantum compilation methodology that aggregates multiple logical operationsinto larger units that manipulate up to 10 qubits at a time. Our methodologythen optimizes these aggregates by (1) finding commutative intermediateoperations that result in more efficient schedules and (2) creating customcontrol pulses optimized for the aggregate (instead of individual 1- and2-qubit operations). Compared to the standard gate-based compilation, theproposed approach realizes a deeper vertical integration of high-level quantumsoftware and low-level, physical quantum hardware. We evaluate our approach onimportant near-term quantum applications on simulations of superconductingquantum architectures. Our proposed approach provides a mean speedup of$5\times$, with a maximum of $10\times$. Because latency directly affects thefeasibility of quantum computation, our results not only improve performancebut also have the potential to enable quantum computation sooner than otherwisepossible.

Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers