2024/11/20 by Yingkai Ouyang, Ouyang, Yingkai, Yumang Jing +3 · 4 citations
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2411.13142
openalex publication_date 2024/11/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions like gate teleportation and magic state distillation are resource-intensive. We present a measurement-free code-switching protocol for universal quantum computation, switching between a stabiliser code for transversal Cliffords and a permutation-invariant (PI) code for transversal non-Cliffords that are logical Z rotations for any rational multiple of π. The novel non-Clifford gates enabled by this code-switching protocol provide for a lower gate count implementation of a universal gate set relative to the Clifford+T gate set. To achieve this, we present a protocol for performing controlled-NOTs between the codes using near-term quantum control operations that employ a catalytic bosonic mode. We also present a new class of PI codes with tunable code distance, supporting transversal non-Clifford gates, and demonstrate their reduced gate count overhead relative to a comparable stabilizer code to stabilizer code switching scheme.