Benchmarking the Planar Honeycomb Code

Abstract

We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. We then benchmark the code using Monte Carlo sampling to estimate logical error rates and derive metrics including thresholds, lambdas, and teraquop qubit counts. We determine that the planar honeycomb code can create a logical qubit with one-in-a-trillion logical error rates using 7000 physical qubits at a 0.1% gate-level error rate (or 900 physical qubits given native two-qubit parity measurements). Our results cement the honeycomb code as a promising candidate for two-dimensional qubit architectures with sparse connectivity.

References in corpus (2)

• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Dynamically Generated Logical Qubits

Cited by in corpus (32)

• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Anyon condensation and the color code
• High-threshold quantum computing by fusing one-dimensional cluster states
• Pauli topological subsystem codes from Abelian anyon theories
• Unifying flavors of fault tolerance with the ZX calculus
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Engineering 3D Floquet codes by rewinding
• Quantum computation from dynamic automorphism codes
• Error-corrected Hadamard gate simulated at the circuit level
• Fault-tolerant quantum architectures based on erasure qubits
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Designing fault-tolerant circuits using detector error models
• Improved Pairwise Measurement-Based Surface Code
• Dynamical Logical Qubits in the Bacon-Shor Code
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• LUCI in the Surface Code with Dropouts
• Fault-tolerant structures for measurement-based quantum computation on a network
• Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
• Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements
• Low-overhead quantum error correction codes with a cyclic topology
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Minimising surface-code failures using a color-code decoder
• Contextuality of Quantum Error-Correcting Codes
• Multiqubit Rydberg Gates for Quantum Error Correction
• Phases of Floquet code under local decoherence
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• Logical operations with a dynamical qubit in Floquet-Bacon-Shor code
• A dynamic circuit for the honeycomb Floquet code
• Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements
• Routing-based technique for defect mitigation in quantum error correction
• Increasing the distance of topological codes with time vortex defects