Color codes with twists: construction and universal gate set implementation
Manoj G. Gowda, Pradeep Kiran Sarvepalli

TL;DR
This paper explores the construction of twists in color codes for quantum computing, demonstrating how braiding and state injection enable a universal set of quantum gates.
Contribution
It provides a systematic method for constructing charge and color permuting twists in color codes and shows how to implement a universal gate set using braiding and state injection.
Findings
Clifford gates realized by braiding in color codes with twists
Single qubit Clifford gates implemented via Pauli frame update
Universal gate set achieved through braiding and state injection
Abstract
Twists are defects in the lattice that can be used to perform encoded computations. Three basic types of twists can be introduced in color codes, namely, twists that permute color, charge of anyons and domino twists that permute the charge label of an anyon with a color label. In this paper, we study a subset these twists from coding theoretic viewpoint. Specifically, we discuss systematic construction of charge permuting and color permuting twists in color codes. We show that by braiding alone, Clifford gates can be realized in color codes with charge permuting twists. We also discuss implementing single qubit Clifford gates by Pauli frame update and CNOT gate by braiding holes around twists in color codes with color permuting twists. Finally, we also discuss implementing a non-Clifford gate by state injection, thus completing the realization of a universal gate set.
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.
