YLYongshang Li

Yongshang Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yongshang Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Optimizing Unitary Coupled Cluster With Single and Double Kernels for Modern NISQ Architectures

    by Yongshang Li, Yu Zhang, Haoning Deng, Mingyu Chen, Guoping 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.

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

    by Yongshang Li, Yu Zhang, Haoning Deng, Mingyu Chen, 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.


  • Timing-Aware Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing

    by Yongshang Li, Yu Zhang, Mingyu Chen, Xiangyang Li, Peng Xu

    As a less developed but potential quantum technology, neutral atoms (NA) can provide advantages including higher qubit connectivity, longer-range interactions, and much more native multi-control gates than superconductivity. Long-range interactions, however, prevent parallelism of interacting qubit pairs with their surrounding restriction zones. Therefore, the quantum program cannot be run directly on a neutral atom quantum computer (NAQC) unless compiled. The recent compiling study of NAQC applies simple layer-by-layer scheduling and does not consider the difference in gate duration. To address the above issues, we focus on the qubit mapping and quantum gate scheduling () problem of quantum circuits to meet hardware constraints of superconductivity and even neutral atoms. Our goal is to shorten the execution time to mitigate decoherence noise. We propose a block-game-like abstraction mechanism which is an abstract model of the problem and aware of the duration difference of gates and several other NA characteristics. Based on the abstraction, we propose a heuristic greedy algorithm (HGA) to solve the problem efficiently. To further speed up the execution of the circuit, we embed HGA into a Monte Carlo tree search (MCTS) framework to solve the problem, which consumes more compiling time but achieves a better result. Comparing our MCTS algorithm with the only recent algorithm for NAQC, the average speedup ratio is 1.75× for several quantum circuits collected from RevLib, and 1.18× for circuits from Qiskit Lib.