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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Quantum information processors need to be protected against errors andfaults. One of the most widely considered fault-tolerant architecture is basedon surface codes. While the general principles of these codes are wellunderstood and basic code properties such as minimum distance and rate are easyto characterize, a code's average performance depends on the detailed geometriclayout of the qubits. To date, optimizing a surface code architecture andcomparing different geometric layouts relies on costly numerical simulations.Here, we propose a benchmarking algorithm for simulating the performance ofsurface codes, and generalizations thereof, that runs in linear time. Weimplemented this algorithm in a software that generates performance reports andallows to quickly compare different architectures.

A linear-time benchmarking tool for generalized surface codes