Hanru Jiang

Hanru Jiang

Auto-generated profile, based on publicly available information

Hanru Jiang

Beijing Institute of Mathematical Sciences and Applications

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
29 April 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PYPeng Yan
Peng Yan
HJHanru Jiang
Hanru Jiang
NYNengkun Yu
Nengkun Yu
Bug-catching is important for developing quantum programs. Motivated by the incorrectness logic for classical programs, we propose an incorrectness logic towards a logical foundation for static bug-catching in quantum programming. The validity of formulas in this logic is dual to that of quantum Hoare logics. We justify the formulation of validity by an intuitive explanation from a reachability point of view and a comparison against several alternative formulations. Compared with existing works focusing on dynamic analysis, our logic provides sound and complete arguments. We further demonstrate the usefulness of the logic by reasoning several examples, including Grover's search, quantum teleportation, and a repeat-until-success program. We also automate the reasoning procedure by a prototyped static analyzer built on top of the logic rules.

8 June 2019
Verified
Conference Paper
Open access
PDF file
HJHanru Jiang
Hanru Jiang
HLHongjin Liang
Hongjin Liang
SXSiyang Xiao
Siyang Xiao
JZJunpeng Zha
Junpeng Zha
XFXinyu Feng
Xinyu Feng

20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
HJHanru Jiang
Hanru Jiang
Reducing the width of quantum circuits is crucial due to limited number of qubits in quantum devices. This paper revisit an optimization strategy known as qubit recycling (alternatively wire-recycling or measurement- and-reset ), which leverages gate commutativity to reuse discarded qubits, thereby reducing circuit width. We introduce qubit dependency graphs (QDGs) as a key abstraction for this optimization. With QDG, we isolate the computationally demanding components, and observe that qubit recycling is essentially a matrix triangularization problem. Based on QDG and this observation, we study qubit recycling with a focus on complexity, algorithmic, and verification aspects. Firstly, we establish qubit recycling’s NP-hardness through reduction from Wilf’s question, another matrix triangularization problem. Secondly, we propose a QDG-guided solver featuring multiple heuristic options for effective qubit recycling. Benchmark tests conducted on RevLib illustrate our solver’s superior or comparable performance to existing alternatives. Notably, it achieves optimal solutions for the majority of circuits. Finally, we develop a certified qubit recycler that integrates verification and validation techniques, with its correctness proof mechanized in Coq.

30 November 2021 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
WSWen-Jun Shi
Wen-Jun Shi
QCQin-Xiang Cao
Qin-Xiang Cao
YDYu-Xin Deng
Yu-Xin Deng
HJHan-Ru Jiang
Han-Ru Jiang
YFYuan Feng
Yuan Feng

26 July 2024
Verified
Book Chapter
Open access
PDF file
PYPeng Yan
Peng Yan
HJHanru Jiang
Hanru Jiang
NYNengkun Yu
Nengkun Yu
Quantum computation is inevitably subject to imperfections in its implementation. These imperfections arise from various sources, including environmental noise at the hardware level and the introduction of approximate implementations by quantum algorithm designers, such as lower-depth computations. Given the significant advantage of relational logic in program reasoning and the importance of assessing the robustness of quantum programs between their ideal specifications and imperfect implementations, we design a proof system to verify the approximate relational properties of quantum programs. We demonstrate the effectiveness of our approach by providing the first formal verification of the renowned low-depth approximation of the quantum Fourier transform. Furthermore, we validate the approximate correctness of the repeat-until-success algorithm. From the technical point of view, we develop approximate quantum coupling as a fundamental tool to study approximate relational reasoning for quantum programs, a novel generalization of the widely used approximate probabilistic coupling in probabilistic programs, answering a previously posed open question for projective predicates.

1 May 2025
Verified
Book Chapter
Open access
PDF file
WFWeijie Fan
Weijie Fan
HLHongjin Liang
Hongjin Liang
XFXinyu Feng
Xinyu Feng
HJHanru Jiang
Hanru Jiang
Concurrent randomized programs in the oblivious adversary model are extremely difficult for modular verification because the interaction between threads is very sensitive to the program structure and the execution steps. We propose a new program logic supporting thread-local verification. With a novel “split” mechanism, one can split the state distribution into smaller partitions, and the reasoning can be done based on each partition independently, which allows us to avoid considering different execution paths of branch statements simultaneously. The logic rules are compositional and are natural extensions of their sequential counterparts. Using our program logic, we verify four typical algorithms in the oblivious adversary model.