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

Current quantum devices impose strict connectivity constraints on quantumcircuits, making circuit transformation necessary before running logicalcircuits on real quantum devices. Many quantum circuit transformation (QCT)algorithms have been proposed in the past several years. This paper proposes anovel method for constructing benchmark circuits and uses these benchmarkcircuits to evaluate state-of-the-art QCT algorithms, including TKET fromCambridge Quantum Computing, Qiskit from IBM, and three academic algorithmsSABRE, SAHS, and MCTS. These benchmarks have known near-optimal transformationcosts and thus are called QUEKNO (for quantum examples with knownnear-optimality). Compared with QUEKO benchmarks designed by Tan and Cong(2021), which all have zero optimal transformation costs, QUEKNO benchmarks aremore general and can provide a more faithful evaluation for QCT algorithms(like TKET) which use subgraph isomorphism to find the initial mapping. Ourevaluation results show that SABRE can generate transformations withconspicuously low average costs on the 53-qubit IBM Q Rochester and Google'sSycamore in both gate size and depth objectives.

On constructing benchmark quantum circuits with known near-optimal transformation cost