Ruiqing Xu

Ruiqing Xu

Auto-generated profile, based on publicly available information

Ruiqing Xu

Faculty of Intelligence Technology, Shanghai Institute of Technology, Shanghai, People’s Republic of China

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
27 February 2019 in IEEE Access
Verified
Journal Article
Open access
RZRi-Gui Zhou Zhou
Ri-Gui Zhou Zhou
RXRuiqing Xu
Ruiqing Xu
HLHou Lan
Hou Lan
Quantum teleportation is considered as the most basic process of quantum communication. It is undoubtedly beneficial for the realization of quantum communication while transmitting the maximum number of quantum bits with the minimum number of quantum channel resources. An improved bidirectional quantum teleportation protocol based on a quantum channel of six-qubit cluster state is proposed. In this paper, the user Alice can transmit a three-qubit entangled state to the user Bob, and at the same time the user Bob can transmit a single-qubit state to the user Alice by utilizing GHZ-state measurement, Bell-state measurement, Von Neumann measurement and CNOT operations. Compared with other schemes, the remarkable advantages in our scheme are transmitting more quantum information and having higher intrinsic efficiency.

9 June 2020 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
YLYaoChong Li
YaoChong Li
RZRi-Gui Zhou
Ri-Gui Zhou
RXRuiQing Xu
RuiQing Xu
JLJia Luo
Jia Luo
SJShexiang Jiang
Shexiang Jiang
Quantum machine learning (QML) is an emerging research field, which is devoted to devising and implementing quantum algorithms that could enable machine learning faster than that of classical computers. In this paper, a hierarchic quantum mechanics-based framework is investigated to implement both the feature extraction and classification in the electroencephalogram (EEG) signal. Firstly, the classical EEG signal dataset is prepared as a quantum state while the sign of the data point is preserved. The prepared quantum state is then evolved with the quantum wavelet packet transformation (QWPT) and the wavelet packet energy entropy (WPEE) feature is extracted as the input of the subsequent quantum classifier. We finally propose the improved quantum support vector machine with the arbitrary nonlinear kernel, which is employed to predict the label of the EEG signal. The complexity analysis indicates that the proposed framework provides exponential speedup over the same structured classical counterpart. Besides, the quantitative experimental results verify the feasibility and validity.

17 June 2019 in IEEE Access
Verified
Journal Article
Open access
SJShexiang Jiang
Shexiang Jiang
RZRi-Gui Zhou
Ri-Gui Zhou
RXRuiqing Xu
Ruiqing Xu
GLGaofeng Luo
Gaofeng Luo

30 May 2019 in IEEE Access
Verified
Journal Article
Open access
RZRi-Gui Zhou
Ri-Gui Zhou
YZYa-Nan Zhang
Ya-Nan Zhang
RXRuiqing Xu
Ruiqing Xu
CQChen Qian
Chen Qian
IHIan Hou
Ian Hou

21 July 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YLYaoChong Li
YaoChong Li
RZRi-Gui Zhou
Ri-Gui Zhou
RXRuiqing Xu
Ruiqing Xu
JLJia Luo
Jia Luo
WHWenwen Hu
Wenwen Hu
PFPing Fan
Ping Fan
Feature selection plays a significant role in computer science; nevertheless, this task is intractable since its search space scales exponentially with the number of dimensions. Motivated by the potential advantages of near-term quantum computing, three graph-theoretic feature selection (GTFS) methods, including minimum cut (MinCut)-based, densest $k$ -subgraph (DkS)-based, and maximal-independent set/minimal vertex cover (MIS/MVC)-based, are investigated in this article, where the original graph-theoretic problems are naturally formulated as the quadratic problems in binary variables and then solved using the quantum approximate optimization algorithm (QAOA). Specifically, three separate graphs are created from the raw feature set, where the vertex set consists of individual features and pairwise measure describes the edge. The corresponding feature subset is generated by deriving a subgraph from the established graph using QAOA. For the above three GTFS approaches, the solving procedure and quantum circuit for the corresponding graph-theoretic problems are formulated with the framework of QAOA. In addition, those proposals could be employed as a local solver and integrated with the Tabu search algorithm for solving large-scale GTFS problems utilizing limited quantum bit resource. Finally, extensive numerical experiments are conducted with 20 publicly available datasets and the results demonstrate that each model is superior to its classical scheme. In addition, the complexity of each model is only $\mathcal{O}(p n^{2})$ even in the worst cases, where $p$ is the number of layers in QAOA and $n$ is the number of features.

27 August 2025 in Entropy
Verified
Journal Article
Open access
PDF file
YLYaoChong Li
YaoChong Li
ZFZhang Yi Fan
Zhang Yi Fan
RXRui-Qing Xu
Rui-Qing Xu
RZRi-Gui Zhou
Ri-Gui Zhou
YDYilin Dong
Yilin Dong
Detecting financial fraud is a critical aspect of modern intelligent financial systems. Despite the advances brought by deep learning in predictive accuracy, challenges persist—particularly in capturing complex, high-dimensional nonlinear features. This study introduces a novel hybrid quantum recurrent neural network for fraud detection (HQRNN-FD). The model utilizes variational quantum circuits (VQCs) incorporating angle encoding, data reuploading, and hierarchical entanglement to project transaction features into quantum state spaces, thereby facilitating quantum-enhanced feature extraction. For sequential analysis, the model integrates a recurrent neural network (RNN) with a self-attention mechanism to effectively capture temporal dependencies and uncover latent fraudulent patterns. To mitigate class imbalance, the synthetic minority over-sampling technique (SMOTE) is employed during preprocessing, enhancing both class representation and model generalizability. Experimental evaluations reveal that HQRNN-FD attains an accuracy of 0.972 on publicly available fraud detection datasets, outperforming conventional models by 2.4%. In addition, the framework exhibits robustness against quantum noise and improved predictive performance with increasing qubit numbers, validating its efficacy and scalability for imbalanced financial classification tasks.