Haoning Deng

Haoning Deng

Auto-generated profile, based on publicly available information

Haoning Deng

University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 December 2024 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YLYongshang Li
Yongshang Li
YZYu Zhang
Yu Zhang
HDHaoning Deng
Haoning Deng
MCMingyu Chen
Mingyu Chen
ZLZhenyu Li
Zhenyu Li
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.

1 November 2026 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YLYongshang Li
Yongshang Li
YZYu Zhang
Yu Zhang
HDHaoning Deng
Haoning Deng
MCMingyu Chen
Mingyu Chen
GGGuo-Ping Guo
Guo-Ping Guo
The Unitary Coupled Cluster with Singles and Doubles (UCCSD) ansatz is a widely used kernel in quantum chemistry and variational quantum eigensolver (VQE) algorithms, but its execution on near-term superconducting quantum processors is hindered by high gate costs and limited qubit connectivity. Existing compilation approaches either adopt simultaneous synthesis, which efficiently diagonalizes excitations but ignores connectivity, or individual synthesis, which enforces connectivity-awareness but sacrifices optimization opportunities. In this work, we propose a connectivity-aware compiler framework for UCCSD kernels that combines the efficiency of simultaneous synthesis with the practicality of connectivity constraints. First, we introduce blockwise qubit mapping, which groups program qubits into excitation-specific blocks and maps them to internally connected regions of the hardware graph. Second, we design connectivity-aware synthesis rules that diagonalize excitations directly on the mapped hardware graph, reducing the number of SWAP gates. We implement our framework and evaluate it on molecular and random UCCSD kernels using Google Sycamore’s and IBMQ Manhattan’s connectivity. Compared with state-of-the-art compilers, our approach reduces CNOT count by up to 34% and circuit depth by 49%, while improving VQE accuracy under noise.