PauliForest: Connectivity-Aware Synthesis and Pauli-Oriented Qubit Mapping for Near Term Quantum Simulation

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: circuit synthesis and qubit mapping. However, existing circuit synthesis methods e...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 2024-11, p.1-1
Main Authors: Li, Yongshang, Zhang, Yu, Deng, Haoning, Chen, Mingyu, Li, Zhenyu
Format: Article
Language:English
Subjects:
Approximation algorithms
Circuit synthesis
Computers
Design automation
Kernel
Logic gates
Quantum algorithm
Quantum simulation
Qubit
Qubit Mapping
Transforms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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: circuit synthesis and qubit mapping. However, existing circuit synthesis methods either overlook qubit connectivity constraints (QCC) 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.
ISSN:0278-0070
DOI:10.1109/TCAD.2024.3509794