Qiaoyan Wen

CR
h-index63
7papers
1,788citations
Novelty39%
AI Score29

7 Papers

1.2QUANT-PHDec 20, 2019Code
Bayesian machine learning for Boltzmann machine in quantum-enhanced feature spaces

Yusen Wu, Chao-hua Yu, Sujuan Qin et al.

Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we develop a quantum bayesian learning framework of the restricted Boltzmann machine in the quantum-enhanced feature spaces. Our framework provides the encoding phase to map the real data and Boltzmann weight onto the quantum feature spaces and the training phase to learn an optimal inference function. Specifically, the training phase provides a physical quantity to measure the posterior distribution in quantum feature spaces, and this measure is utilized to design the quantum maximum a posterior (QMAP) algorithm and the quantum predictive distribution estimator (QPDE). It is shown that both quantum algorithms achieve exponential speed-up over their classical counterparts. Furthermore, it is interesting to note that our framework can figure out the classical bayesian learning tasks, i.e. processing the classical data and outputting corresponding classical labels. And a simulation, which is performed on an open-source software framework for quantum computing, illustrates that our algorithms show almost the same classification performance compared to their classical counterparts. Noting that the proposed quantum algorithms utilize the shallow circuit, our work is expected to be implemented on the noisy intermediate-scale quantum (NISQ) devices, and is one of the promising candidates to achieve quantum supremacy.

2.3QUANT-PHMar 14, 2024
A Hierarchical Fused Quantum Fuzzy Neural Network for Image Classification

Sheng-Yao Wu, Run-Ze Li, Yan-Qi Song et al.

Neural network is a powerful learning paradigm for data feature learning in the era of big data. However, most neural network models are deterministic models that ignore the uncertainty of data. Fuzzy neural networks are proposed to address this problem. FDNN is a hierarchical deep neural network that derives information from both fuzzy and neural representations, the representations are then fused to form representation to be classified. FDNN perform well on uncertain data classification tasks. In this paper, we proposed a novel hierarchical fused quantum fuzzy neural network (HQFNN). Different from classical FDNN, HQFNN uses quantum neural networks to learn fuzzy membership functions in fuzzy neural network. We conducted simulated experiment on two types of datasets (Dirty-MNIST and 15-Scene), the results show that the proposed model can outperform several existing methods. In addition, we demonstrate the robustness of the proposed quantum circuit.

2.3CRDec 20, 2018
Secure and Efficiently Searchable IoT Communication Data Management Model: Using Blockchain as a new tool

Ziqing Guo, Hua Zhang, Xin Zhang et al.

With the rapid development of the Internet of things (IoT), more and more IoT devices are connected and communicate frequently. In this background, the traditional centralized security architecture of IoT will be limited in terms of data storage space, data reliability, scalability, operating costs and liability judgment. In this paper, we propose an new key information storage framework based on a small distributed database generated by blockchain technology and cloud storage. Specifically, all encrypted key communication data will be upload to public could server for enough storage, but the abstracts of these data (called "communication logs") will be recorded in "IoT ledger" (i.e., an distributed database) that maintained by all IoT devices according to the blockchain generation approach, which could solve the problem of data reliability, scalability and liability judgment. Besides, in order to efficiently search communication logs and not reveal any sensitive information of communication data, we design the secure search scheme for our "IoT ledger", which exploits the Asymmetric Scalar-product Preserving Encryption (ASPE) approach to guarantee the data security, and exploits the 2-layers index which is tailor-made for blockchain database to improve the search efficiency. Security analysis and experiments on synthetic dataset show that our schemes are secure and efficient.

37.1CRFeb 20, 2018
A Survey on the Security of Blockchain Systems

Xiaoqi Li, Peng Jiang, Ting Chen et al.

Since its inception, the blockchain technology has shown promising application prospects. From the initial cryptocurrency to the current smart contract, blockchain has been applied to many fields. Although there are some studies on the security and privacy issues of blockchain, there lacks a systematic examination on the security of blockchain systems. In this paper, we conduct a systematic study on the security threats to blockchain and survey the corresponding real attacks by examining popular blockchain systems. We also review the security enhancement solutions for blockchain, which could be used in the development of various blockchain systems, and suggest some future directions to stir research efforts into this area.

1.2QUANT-PHJun 3, 2014
Post-processing of the oblivious key in quantum private queries

Fei Gao, Bin Liu, Wei Huang et al.

Quantum private query (QPQ) is a kind of quantum protocols to protect both users' privacy in their communication. There is an interesting example, that is, Alice wants to buy one item from Bob's database, which is composed of a quantity of valuable messages. QPQ protocol is the communication procedure ensuring that Alice can get only one item from Bob, and at the same time, Bob cannot know which one was taken by Alice. Owing to its practicability, quantum-key-distribution-based QPQ has draw much attention in recent years. However, the post-processing of the key in such protocols, called oblivious key, remains far from being satisfactorily known. Especially, the error correction method for such special key is still missing. Here we focus on the post-processing of the oblivious key, including both dilution and error correction. On the one hand, we demonstrate that the previous dilution method, which greatly reduces the communication complexity, will bring Alice the chance to illegally obtain much additional information about Bob's database. Simulations show that by very limited queries Alice can obtain the whole database. On the other hand, we present an effective error-correction method for the oblivious key, which completes its post-processing and makes such QPQ more practical.

3.7CRJan 22, 2013
Cryptanalysis and improvement of two certificateless three-party authenticated key agreement protocols

Haiyan Sun, Qiaoyan Wen, Hua Zhang et al.

Recently, two certificateless three-party authenticated key agreement protocols were proposed, and both protocols were claimed they can meet the desirable security properties including forward security, key compromise impersonation resistance and so on. Through cryptanalysis, we show that one neither meets forward security and key compromise impersonation resistance nor resists an attack by an adversary who knows all users' secret values, and the other cannot resist key compromise impersonation attack. Finally, we propose improved protocols to make up two original protocols' security weaknesses, respectively. Further security analysis shows that our improved protocols can remove such security weaknesses.

2.4AIMay 13, 2012
Operations on soft sets revisited

Ping Zhu, Qiaoyan Wen

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft sets from given soft sets, some operations on soft sets have been proposed. Unfortunately, such operations cannot keep all classical set-theoretic laws true for soft sets. In this paper, we redefine the intersection, complement, and difference of soft sets and investigate the algebraic properties of these operations along with a known union operation. We find that the new operation system on soft sets inherits all basic properties of operations on classical sets, which justifies our definitions.