TL;DR
This paper introduces a practical method to implement all Clifford gates in topological subsystem color codes using code deformation and twist braiding, enhancing their computational feasibility.
Contribution
It presents a novel approach to perform Clifford gates via code deformation in planar topological codes, utilizing twist braiding and colored Majorana operators.
Findings
All Clifford gates can be implemented by code deformation.
The method simplifies error tracking to 2-local measurements.
It demonstrates a practical scheme for topological quantum computation.
Abstract
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were highly unpractical. We give a mechanism to implement all Clifford gates by code deformation in a planar setting. In particular, we use twist braiding and express its effects in terms of certain colored Majorana operators.
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.