Creating entangled logical qubits in the heavy-hex lattice with topological codes
Bence Het\'enyi, James R. Wootton

TL;DR
This paper demonstrates how to implement entangled logical qubits using topological codes on a heavy-hex lattice in IBM Quantum devices, enabling fault-tolerant entanglement and measurement of logical observables.
Contribution
It introduces a method to utilize unused qubits in sparse connectivity architectures to implement multiple quantum error correcting codes simultaneously.
Findings
Realized surface and Bacon-Shor codes on 133 qubits.
Achieved entanglement with code distance up to 4.
Verified Bell inequality violation with high fidelity.
Abstract
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hex architecture of current IBM Quantum devices. In such cases it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error correcting codes, many qubits remain effectively unused. In this work we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
