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

Qubit routing is a key problematic related to quantum circuit compilation. Itconsists in rewriting a quantum circuit by adding the least possible number ofinstructions to make the circuit compliant with some architecture'sconnectivity constraints. Usually, this problem is tackled via either SWAPinsertion techniques or re-synthesis of portions of the circuit usingarchitecture aware synthesis algorithms. In this work, we propose ameta-heuristic that couples the iterative approach of SWAP insertion techniqueswith greedy architecture aware synthesis routines. We propose two newcompilation algorithms based on this meta-heuristic and compare theirperformances to state-of-the-art quantum circuit compilation techniques forseveral standard classes of quantum circuits and show significant reduction inthe entangling gate overhead due to compilation.

Architecture aware compilation of quantum circuits via lazy synthesis