Transversal switching between generic stabilizer codes
arXiv:1709.09282
Abstract
We propose a randomized variant of the stabilizer rewiring algorithm (SRA), a method for constructing a transversal circuit mapping between any pair of stabilizer codes. As gates along this circuit are applied, the initial code is deformed through a series of intermediate codes before reaching the final code. With this randomized variant, we show that there always exists a path of deformations which preserves the code distance throughout the circuit, while using at most linear overhead in the distance. Furthermore, we show that a random path will almost always suffice, and discuss prospects for implementing general fault-tolerant code switching circuits.
arXiv comment9 pages, 4 figures, removed erroneous fault-tolerance claim
References in corpus (8)
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Surface code implementation of block code state distillation
- Rewiring Stabilizer Codes
- Universal fault-tolerant quantum computation with Bacon-Shor codes
- Limitations on Transversal Computation through Quantum Homomorphic Encryption