Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes
Alexandre Guernut, Christophe Vuillot
TL;DR
This paper introduces a method for implementing fault-tolerant, constant-depth Clifford gates on 2D toric codes, combining multiple techniques to achieve universal quantum computation with enhanced error resilience.
Contribution
It presents a novel combination of fold-transversal gates, Dehn twists, and single-shot measurements to realize the full Clifford group fault-tolerantly on 2D toric codes.
Findings
Simulated the performance of the proposed gates.
Demonstrated fault-tolerance and constant-depth properties.
Achieved universal Clifford gate set on 2D toric codes.
Abstract
We propose and simulate the performance of a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
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 · Coding theory and cryptography