Fold-Transversal Clifford Gates for Quantum Codes
Nikolas P. Breuckmann, Simon Burton
Abstract
We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal gates and qubit permutations only.To demonstrate our approach, we specifically consider a [[30, 8, 3]] hyperbolic quantum code called Bring's code. Further, we show that by restricting the logical subspace of Bring's code to four qubits, we can obtain the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:math> Clifford group on that subspace.
Topics & Concepts
Subspace topologyTransversal (combinatorics)Code (set theory)QubitAlgorithmComputer scienceQuantumQuantum computerQuantum mechanicsMathematicsPhysicsArtificial intelligenceProgramming languageMathematical analysisSet (abstract data type)Quantum Computing Algorithms and ArchitectureQuantum-Dot Cellular AutomataQuantum Information and Cryptography