Gushu Li

Gushu Li

Auto-generated profile, based on publicly available information

Gushu Li

University of Pennsylvania, Philadelphia, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
13 November 2020 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
GLGushu Li
Gushu Li
LZLi Zhou
Li Zhou
NYNengkun Yu
Nengkun Yu
YDYufei Ding
Yufei Ding
MYMingsheng Ying
Mingsheng Ying
YXYuan Xie
Yuan Xie
In this paper, we propose Proq, a runtime assertion scheme for testing and debugging quantum programs on a quantum computer. The predicates in Proq are represented by projections (or equivalently, closed subspaces of the state space), following Birkhoff-von Neumann quantum logic. The satisfaction of a projection by a quantum state can be directly checked upon a small number of projective measurements rather than a large number of repeated executions. On the theory side, we rigorously prove that checking projection-based assertions can help locate bugs or statistically assure that the semantic function of the tested program is close to what we expect, for both exact and approximate quantum programs. On the practice side, we consider hardware constraints and introduce several techniques to transform the assertions, making them directly executable on the measurement-restricted quantum computers. We also propose to achieve simplified assertion implementation using local projection technique with soundness guaranteed. We compare Proq with existing quantum program assertions and demonstrate the effectiveness and efficiency of Proq by its applications to assert two sophisticated quantum algorithms, the Harrow-Hassidim-Lloyd algorithm and Shor’s algorithm.

22 February 2022
Verified
Conference Paper
Open access
GLGushu Li
Gushu Li
AWAnbang Wu
Anbang Wu
YSYunong Shi
Yunong Shi
AJAli Javadi-Abhari
Ali Javadi-Abhari
YDYufei Ding
Yufei Ding
YXYuan Xie
Yuan Xie
The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by exploiting high-level program structure and optimization opportunities. Paulihedral first employs a new Pauli intermediate representation that can maintain the high-level semantics and constraints in quantum simulation kernels. This naturally enables new large-scale optimizations that are hard to implement at the low gate-level. In particular, we propose two technology-independent instruction scheduling passes, and two technology-dependent code optimization passes which reconcile the circuit synthesis, gate cancellation, and qubit mapping stages of the compiler. Experimental results show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.

12 November 2023
Verified
Conference Paper
Open access
FHFei Hua
Fei Hua
MWMeng Wang
Meng Wang
GLGushu Li
Gushu Li
BPBo Peng
Bo Peng
CLChenxu Liu
Chenxu Liu
ALAng Li
Ang Li
The success of a quantum algorithm hinges on the ability to orchestrate a successful application induction. Detrimental overheads in mapping general quantum circuits to physically implementable routines can be the deciding factor between a successful and erroneous circuit induction. In QASMTrans, we focus on the problem of rapid circuit transpilation. Transpilation plays a crucial role in converting high-level, machine-agnostic circuits into machine-specific circuits constrained by physical topology and supported gate sets. The efficiency of transpilation continues to be a substantial bottleneck, especially when dealing with larger circuits requiring high degrees of inter-qubit interaction. QASMTrans is a high-performance C++ quantum transpiler framework that demonstrates 3-1111 × speedups compared to the commonly used Qiskit transpiler. We observe speedups on large dense circuits such as ‘uccsd_n24’ which require gates. QASMTrans successfully transpiles the aforementioned circuits in 7.9s, whilst Qiskit needs 502 seconds with optimization 1 and exceeds an hour of transpilation time with optimization 3. With QASMTrans providing transpiled circuits in a fraction of the time of prior transpilers, potential design space exploration, and heuristic-based transpiler design becomes substantially more tractable. QASMTrans is released at http://github.com/pnnl/qasmtrans.

17 June 2023
Verified
Conference Paper
Open access
HZHezi Zhang
Hezi Zhang
AWAnbang Wu
Anbang Wu
YWYuke Wang
Yuke Wang
GLGushu Li
Gushu Li
HSHassan Shapourian
Hassan Shapourian
YDYufei Ding
Yufei Ding
In this paper, we propose OneQ, the first optimizing compilation framework for one-way quantum computation towards realistic photonic quantum architectures. Unlike previous compilation efforts for solid-state qubit technologies, our innovative framework addresses a unique set of challenges in photonic quantum computing. Specifically, this includes the dynamic generation of qubits over time, the need to perform all computation through measurements instead of relying on 1-qubit and 2-qubit gates, and the fact that photons are instantaneously destroyed after measurements. As pioneers in this field, we demonstrate the vast optimization potential of photonic one-way quantum computing, showcasing the remarkable ability of OneQ to reduce computing resource requirements by orders of magnitude.

28 August 2025 in Science
Verified
Journal Article
Closed access
YZYichi Zhang
Yichi Zhang
RBRobert Broberg
Robert Broberg
AZAlan Zhu
Alan Zhu
GLGushu Li
Gushu Li
LGLi Ge
Li Ge
LFLiang Feng
Liang Feng
Classical and quantum technologies have traditionally been viewed as orthogonal, with classical systems being deterministic and quantum systems inherently probabilistic. This distinction hinders the development of a scalable quantum internet even as the global internet continues expanding. We report a classical-decisive quantum internet architecture in which the integration of quantum information into advanced photonic technologies enables efficient entanglement distribution over a commercially deployed fiber network. On-chip precise synchronization between classical headers and quantum payloads enables dynamic routing and networking of high-fidelity entanglement guided by classical light. The quantum states are preserved through real-time error mitigation, relying solely on classical signal readout without disturbing quantum information. These classical-decisive features demonstrate a practical path to a scalable quantum internet using existing network infrastructure and operating systems.

23 July 2025
Verified
Book Chapter
Open access
PDF file
Kean ChenKean Chen
Kean Chen
YLYuhao Liu
Yuhao Liu
WFWang Fang
Wang Fang
JPJennifer Paykin
Jennifer Paykin
XWXin-Chuan Wu
Xin-Chuan Wu
GLGushu Li
Gushu Li
Quantum computers have advanced rapidly in qubit count and gate fidelity. However, large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC) to suppress noise. Manually or experimentally verifying the fault-tolerance property of complex QECC implementation is impractical due to the vast error combinations. This paper formalizes the fault-tolerance of QECC implementations within the language of quantum programs. By incorporating the techniques of quantum symbolic execution, we provide an automatic verification tool for quantum fault-tolerance. We evaluate and demonstrate the effectiveness of our tool on a universal set of logical operations across different QECCs.