Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation
arXiv:2205.00724 · doi:10.4204/EPTCS.394.18
Abstract
Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be mapped to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that compiling strategies based on the Steiner tree provide a competitive tool to route CNOTs. However, these algorithms require the qubit map to be decided before routing. Moreover, the qubit map is fixed throughout the computation, i.e. the logical qubit will not be moved to a different physical qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically remaps logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss and RowCol. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and mapping strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX diagrams.
arXiv commentIn Proceedings QPL 2022, arXiv:2311.08375
References in corpus (11)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- tket : A Retargetable Compiler for NISQ Devices
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Quantum circuit optimizations for NISQ architectures
- There and back again: A circuit extraction tale
- Scalable quantum computer with superconducting circuits in the ultrastrong coupling regime
- On the CNOT-complexity of CNOT-PHASE circuits
- Efficient Synthesis of Linear Reversible Circuits
- Reducing the CNOT count for Clifford+T circuits on NISQ architectures
- Phase polynomials synthesis algorithms for NISQ architectures and beyond
- Optimization of CNOT circuits on limited connectivity architecture