A quantum circuit optimizer, PhasePoly, co-optimizes phase and output parity matrices and merges phase-polynomial blocks across gate barriers, reducing total gates by 34.9% and CNOT gates by 28.5% on average.
A Depth-Aware Swap Insertion Scheme for the Qubit Mapping Problem
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The rapid progress of physical implementation of quantum computers paved the way of realising the design of tools to help users write quantum programs for any given quantum devices. The physical constraints inherent to the current NISQ architectures prevent most quantum algorithms from being directly executed on quantum devices. To enable two-qubit gates in the algorithm, existing works focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, their schemes lack the consideration of the depth of generated quantum circuits. In this work, we propose a depth-aware SWAP insertion scheme for qubit mapping problem in the NISQ era.
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Leveraging Phase Polynomials for Quantum Circuit Optimization
A quantum circuit optimizer, PhasePoly, co-optimizes phase and output parity matrices and merges phase-polynomial blocks across gate barriers, reducing total gates by 34.9% and CNOT gates by 28.5% on average.