FKFanqi Kong

Fanqi Kong

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fanqi Kong has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Towards Quantum Program Bug Datasets and Benchmarking

    by Tingting Li, Jiongchi Yu, Zhikang Fan, Junqing Wang, Yao Zhai, Shenglong Zhang, Yu Peng, Yuhan Chen, Junyu Chen, Fanqi Kong, et al.

    The growing maturity of quantum computing has led to increasingly complex software ecosystems spanning frameworks, compilers, simulators, and application-level programs. Despite this rapid growth, the community still lacks a realistic benchmark for evaluating automated quantum bug fixing under quantum-specific correctness requirements, such as stochastic outputs, tolerance-based equivalence, and environment-sensitive execution. To bridge this gap, we present QBench, an end-to-end benchmark for evaluating automated repair of real-world quantum software bugs. QBench consists of two complementary tracks: RepoTrack, which targets defects in quantum software infrastructure and repositories, and ScriptTrack, which targets bugs in user-facing quantum programs and experimental workflows. Each benchmark instance provides a reproducible bug-fixing task together with the execution environment, correctness oracle, and evaluation protocol required to validate candidate repairs, enabling standardized assessment of repair systems under realistic development settings. QBench supports deterministic, tolerance-aware, and probabilistic correctness oracles, enabling reliable evaluation under realistic quantum execution semantics. Using QBench, we conduct a large-scale empirical study of automated quantum software repair and analyze the challenges faced by representative repair approaches. Our results show that stochastic correctness criteria, environment fragility, and cross-layer defects remain major obstacles to successful repair, highlighting the unique difficulties of maintaining and repairing quantum software.


  • An Acceleration Framework for Privacy-Preserving Neural Network Inference Using Fully Homomorphic Encryption

    by Fanqi Kong, Ziming Zhao, Yongheng Li, Jing Wen, Shaoling Liang, Baohua Huang

  • Open Access

    Multi-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU

    by Yongheng Li, Jing Wen, Shaoling Liang, Fanqi Kong, Baohua Huang

    Multi-group homomorphic encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of multi-party homomorphic encryption (MPHE) and multi-key homomorphic encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing was adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. A new multi-group ciphertext bootstrapping algorithm for MGHE was developed via the integration of LWE and NTRU cryptographic primitives. Bootstrapping tasks were decomposed for parallel processing, and a hybrid product algorithm was designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation was analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments showed that 30- and 50-party multi-group bootstrapping takes only 1.87 s and 2.58 s respectively.


  • Open Access

    Multi-Group Fully Homomorphic Encryption Scheme Based on LWE and NTRU

    by Yongheng Li, Jing Wen, Shaoling Liang, Fanqi Kong, Baohua Huang

    Multi-Group Homomorphic Encryption (MGHE) is a pivotal advance in secure multi-party computation, integrating merits of Multi-Party Homomorphic Encryption (MPHE) and Multi-Key Homomorphic Encryption (MKHE) to eliminate MPHE’s fixed-party limitation and mitigate MKHE’s ciphertext expansion from dynamic enrollment. However, the efficient single-key FINAL scheme cannot extend to multi-party scenarios, due to the challenge of defining valid multiplication for vector NTRU ciphertexts, which hinders its use in multi-group bootstrapping and curbs efficiency. To address this, additive secret sharing is adopted to convert vector NTRU ciphertext multiplication into secret share multiplication, enabling shared bootstrapping key generation within groups. For the first time, a multi-group ciphertext bootstrapping algorithm based on LWE and NTRU is proposed. Bootstrapping tasks are decomposed for parallel processing, and a hybrid product algorithm is designed to aggregate subtask outputs, boosting multi-group bootstrapping speed to match that of single-key ciphertexts. Noise accumulation is analyzed, with 100-bit and 128-bit security parameter sets selected for validation. Experiments show that 30/50-party multi-group bootstrapping takes only 1.87/2.58 seconds respectively.