New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
citing papers explorer
-
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.
- Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria