Fang Qi

Fang Qi

Auto-generated profile, based on publicly available information

Fang Qi

Computer Science, Tulane University, New Orleans, LA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
15 December 2023 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
FQFang Qi
Fang Qi
KSKaitlin N. Smith
Kaitlin N. Smith
TLTravis LeCompte
Travis LeCompte
NTNian-Feng Tzeng
Nian-Feng Tzeng
XYXu Yuan
Xu Yuan
LPLu Peng
Lu Peng
While quantum computers provide exciting new opportunities for information processing, today's quantum computers suffer from noise during computation that is not fully understood. Incomplete noise models have caused quantum program success rate (SR) estimators to generate performance predictions that substantially differ from actual machine outcomes. For example, the estimated probability of success (ESP) is the state-of-the-art metric used to gauge quantum program performance. The ESP suffers poor prediction since it fails to account for the unique combination of circuit structure, quantum state, and quantum computer properties specific to each program execution. Thus, there is an urgent need to develop a systematic approach that could explain different noise impacts and accurately and robustly predict the actual quantum computer success rates, especially those that keep application and device scaling in mind. In this paper, we propose the quantum vulnerability analysis (QVA) to systematically quantify the error impact on quantum applications and address the gap between current SR estimators and real quantum computer results. The QVA determines the Cumulative Quantum Vulnerability (CQV) of the target quantum computation, which quantifies the quantum error impact based on the entire algorithm applied to the target quantum machine. By evaluating the CQV with well-known benchmarks on three 27-qubit quantum computers, the CQV success estimation outperforms the state-of-the-art prediction technique ESP by achieving on average 6 times less relative prediction error, with best cases at 30 times, for benchmarks with a real SR rate above 0.1%. Direct application of QVA has been provided that helps researchers choose a promising compiling strategy at compile time.

5 June 2023
Verified
Conference Paper
Open access
TLTravis LeCompte
Travis LeCompte
FQFang Qi
Fang Qi
XYXu Yuan
Xu Yuan
NTNian-Feng Tzeng
Nian-Feng Tzeng
MNM. Hassan Najafi
M. Hassan Najafi
LPLu Peng
Lu Peng
Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - size and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable at the current size of computers, requiring thousands of qubits, while NISQ systems have nearly one hundred at most. One common approach to improve reliability is to adjust the compilation process to create a more reliable final circuit, where the two most critical compilation decisions are the qubit allocation and qubit routing problems. We focus on solving the qubit allocation problem and identifying initial layouts that result in a reduction of error. To identify these layouts, we combine reinforcement learning with a graph neural network (GNN)-based Q-network to process the mesh topology of the quantum computer, known as the backend, and make mapping decisions, creating a Graph Neural Network Assisted Quantum Compilation (GNAQC) strategy. We train the architecture using a set of four backends and six circuits and find that GNAQC improves output fidelity by roughly 12.7% over pre-existing allocation methods.

12 June 2024
Verified
Conference Paper
Open access
FQFang Qi
Fang Qi
XFXin Fu
Xin Fu
XYXu Yuan
Xu Yuan
NTNian-Feng Tzeng
Nian-Feng Tzeng
LPLu Peng
Lu Peng

29 June 2025
Verified
Conference Paper
Open access
FQFang Qi
Fang Qi
YDYongshan Ding
Yongshan Ding
VBVictor Bankston
Victor Bankston
JLJi Liu
Ji Liu
LPLu Peng
Lu Peng