PauliForest: Connectivity-Aware Synthesis and Pauli-Oriented Qubit Mapping for Near-Term Quantum Simulation
- 2 December 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (6) , 2119-2129
Abstract
Quantum simulation is the foundation for the design of many algorithms which share subroutines known as quantum simulation kernels. Optimizing the compilation of these kernels is crucial, involving two key components: 1) circuit synthesis and 2) qubit mapping. However, existing circuit synthesis methods either overlook qubit connectivity constraints (QCCs) or prioritize minimizing gate count over optimizing circuit depth. Similarly, current qubit mapping techniques do not work well with circuit synthesis methods. To address these limitations, we propose PauliForest, which comprises a connectivity-aware circuit synthesis algorithm and a Pauli-oriented qubit mapping algorithm. The synthesis algorithm employs heuristic strategies to generate shallower circuits, while the qubit mapping algorithm seamlessly collaborates with the circuit synthesis process. Compared to the state-of-the-art Paulihedral compiler, our approach significantly reduces both CNOT gate counts (by 13%) and circuit depths (by 25%). Experiments on a noisy simulator and a real superconducting quantum computer show that our algorithm can improve the fidelity of quantum circuit execution compared to Paulihedral.Keywords
Funding Information
- Innovation Program for Quantum Science and Technology (2021ZD0302300, 2021ZD0303306)
- National Natural Science Foundation of China (22393913, 62272434)
This publication has 32 references indexed in Scilit:
- t|ket⟩: a retargetable compiler for NISQ devicesQuantum Science and Technology, 2020
- Quantum circuit optimizations for NISQ architecturesQuantum Science and Technology, 2020
- Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithmnpj Quantum Information, 2020
- Quantum supremacy using a programmable superconducting processorNature, 2019
- Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures2018
- Quantum principal component analysisNature Physics, 2014
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- Fermionic Quantum ComputationAnnals of Physics, 2002
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- A fast algorithm for Steiner treesActa Informatica, 1981