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

Near-term quantum computers are noisy and have limited connectivity betweenqubits. Compilers are required to introduce SWAP operations in order to performtwo-qubit gates between non-adjacent qubits. SWAPs increase the number of gatesand depth of programs, making them even more vulnerable to errors. Moreover,they relocate qubits which affect SWAP selections for future gates in aprogram. Thus, compilers must select SWAP routes that not only minimize theoverheads for the current operation, but also for future gates. Existingcompilers tend to select paths with the fewest SWAPs for the currentoperations, but do not evaluate the impact of the relocations from the selectedSWAP candidate on future SWAPs. Also, they converge on SWAP candidates for thecurrent operation and only then decide SWAP routes for future gates, thusseverely restricting the SWAP candidate search space for future operations.  We propose ForeSight, a compiler that simultaneously evaluates multiple SWAPcandidates for several operations into the future, delays SWAP selections toanalyze their impact on future SWAP decisions and avoids early convergence onsub-optimal candidates. Moreover, ForeSight evaluates slightly longer SWAProutes for current operations if they have the potential to reduce SWAPs forfuture gates, thus reducing SWAPs for the program globally. As compilationproceeds, ForeSight dynamically adds new SWAP candidates to the solution spaceand eliminates the weaker ones. This allows ForeSight to reduce SWAP overheadsat program-level while keeping the compilation complexity tractable. Ourevaluations with a hundred benchmarks across three devices show that ForeSightreduces SWAP overheads by 17% on average and 81% in the best-case, compared tothe baseline. ForeSight takes minutes, making it scalable to large programs.

ForeSight: Reducing SWAPs in NISQ Programs via Adaptive Multi-Candidate Evaluations