A linear-time benchmarking tool for generalized surface codes

Abstract

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

Software available online: http://quantum-squab.com

References in corpus (7)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Generalized surface codes and packing of logical qubits