27 February 2019 in IEEE Access
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
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
30 May 2019 in IEEE Access
21 July 2022 in IEEE Transactions on Neural Networks and Learning Systems
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.