Hexagonal matching codes with 2-body measurements
arXiv:2109.13308 · doi:10.1088/1751-8121/ac7a75
Abstract
Matching codes are stabilizer codes based on Kitaev's honeycomb lattice model. The hexagonal form of these codes are particularly well-suited to the heavy-hexagon device layouts currently pursued in the hardware of IBM Quantum. Here we show how the stabilizers of the code can be measured solely through the 2-body measurements that are native to the architecture. The process is then run on 27 and 65 qubit devices, to compare results with simulations for a standard error model. It is found that the results correspond well to simulations where the noise strength is similar to that found in the benchmarking of the devices. The best devices show results consistent with a noise model with an error probability of around .
References in corpus (18)
- Fault-tolerant quantum computation by anyons
- Anyons in an exactly solved model and beyond
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Validating quantum computers using randomized model circuits
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Repeated Quantum Error Detection in a Surface Code
- Topological and subsystem codes on low-degree graphs with flag qubits
- Dynamically Generated Logical Qubits
- Entangling logical qubits with lattice surgery
- Fault-tolerant thresholds for quantum error correction with the surface code
- Quantum Measurements and Gates by Code Deformation
- A Fault-Tolerant Honeycomb Memory
- Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
- Constructions and Noise Threshold of Topological Subsystem Codes
- Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment
- Benchmarking near-term devices with quantum error correction
- A family of stabilizer codes for anyons and Majorana modes