Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
arXiv:2201.06457 · doi:10.1016/j.scico.2021.102726
Abstract
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a significant part of the cost of running an entire quantum circuit, we aim at reducing their size. In this paper we present a new algorithm for the synthesis of CNOT circuits based on the solution of the syndrome decoding problem. Our method addresses the case of ideal hardware with an all-to-all qubit connectivity and the case of near-term quantum devices with restricted connectivity. For both cases, we present benchmarks showing that our algorithm outperforms existing algorithms.
References in corpus (11)
- Quantum Computing in the NISQ era and beyond
- Stabilizer Codes and Quantum Error Correction
- Roads towards fault-tolerant universal quantum computation
- Quantum computing with neutral atoms
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Reducing T-count with the ZX-calculus
- Quantum circuit optimizations for NISQ architectures
- On the CNOT-complexity of CNOT-PHASE circuits
- Circuit Transformations for Quantum Architectures
- Improved Quantum Information Set Decoding
- Quantum Information Set Decoding Algorithms