arXiv subjects

Zhaoyang Dong

Publications and source records attributed to Zhaoyang Dong.

23 records · Page 2Linked to original sources

arXiv2020

Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data

At present, in the face of the huge and complex data in cloud computing, the parallel computing ability of quantum computing is particularly important. Quantum principal component analysis algorithm is used as a method of quantum state tomography. We perform feature extraction on the eigenvalue matrix of the density matrix after feature decomposition to achieve dimensionality reduction, proposed quantum principal component extraction algorithm (QPCE). Compared with the classic algorithm, this algorithm achieves an exponential speedup under certain conditions. The specific realization of the quantum circuit is given. And considering the limited computing power of the client, we propose a quantum homomorphic ciphertext dimension reduction scheme (QHEDR), the client can encrypt the quantum data and upload it to the cloud for computing. And through the quantum homomorphic encryption scheme to ensure security. After the calculation is completed, the client updates the key locally and decrypts the ciphertext result. We have implemented a quantum ciphertext dimensionality reduction scheme implemented in the quantum cloud, which does not require interaction and ensures safety. In addition, we have carried out experimental verification on the QPCE algorithm on IBM's real computing platform, and given a simple example of executing hybrid quantum circuits in the cloud to verify the correctness of our scheme. Experimental results show that the algorithm can perform ciphertext dimension reduction safely and effectively.

quant-ph↗

arXiv2020

Quantum k-means algorithm based on Trusted server in Quantum Cloud Computing

We propose a quantum k-means algorithm based on quantum cloud computing that effectively solves the problem that the client can not afford to execute the same quantum subroutine repeatedly in the face of large training samples. In the quantum k-means algorithm, the core subroutine is the Quantum minimization algorithm (GroverOptim), the client needs to repeat several Grover searches to find the minimum value in each iteration to find a new clustering center, so we use quantum homomorphic encryption scheme (QHE) to encrypt the data and upload it to the cloud for computing. After calculation, the server returns the calculation result to the client. The client uses the key to decrypt to get the plaintext result. It reduces the computing pressure for the client to repeat the same operation. In addition, when executing in the cloud, the key update of T-gate in the server is inevitable and complex. Therefore, this paper also proposes a T-gate update scheme based on trusted server in quantum ciphertext environment. In this scheme, the server is divided into trusted server and semi-trusted server. The semi-trusted server completes the calculation operation, and when the T-gate is executed in the circuit, the trusted server assists the semi-trusted server to calculate the T-gate, and then randomly generates a key and uploads it to the semi-trusted server. The trusted server assists the client to complete the key update operation, which once again reduces the pressure on the client and improves the efficiency of the quantum homomorphic encryption scheme. And on the basis of this scheme, the experiment is given by using IBM Qiskit to give the subroutine of quantum k-means. The experimental results show that the scheme can realize the corresponding computing function on the premise of ensuring security.

quant-ph↗

arXiv2019

A Center-Point Algorithm for Unit Commitment with Carbon Emission Trading

This paper proposes a global optimization method for it ensures finding good solutions while solving the unit commitment (UC) problem with carbon emission trading (CET). This method con-sists of two parts. In the first part, a sequence of linear inte-ger-relaxed subproblems are first solved to rapidly generate a tight linear relaxation of the original mixed integer nonlinear pro-gramming problem (MINLP) model. In the second part, the algo-rithm introduces the idea of center-cut so that it can quickly find good solutions. The approach tested on 10 test instances with units ranging from 35 to 1560 over a scheduling period of 24h, and compared with state-of-the-art solver CPLEX. The results show that the proposed algorithm can find better solutions than CPLEX in a short time. And it is more suitable to solve large scale UC problem than CPLEX.

math.OC↗

arXiv2018

Response and phase transition of a Kitaev spin liquid in a local magnetic field

We study the response of the Kitaev spin liquid (KSL) to a local magnetic field perpendicular to the Kitaev honeycomb lattice. The local magnetic field induces a dynamical excitation of a flux pair in the spin liquid and the system can be described by a generally particle-hole asymmetric interacting resonant level model. The dynamical excitation of the flux pair closes the flux gap in the spectrum of the spin correlation function locally for the gapless KSL even from the perturbative response to a weak magnetic field. Beyond the perturbative regime, the p-h asymmetry competes with the magnetic field and results in a rich phase diagram. Moreover, the magnetic field breaks the gauge equivalence of the ferromagnetic and anti-ferromagnetic Kitaev couplings of the ground state and leads to very different behaviors for the two cases. The anti-ferromagnetic case experiences a first order phase transition to the polarized state during magnetization whereas the ferromagnetic case does not. This study can be generalized to the Kitaev model in a uniform magnetic field and may help understand issues in recent experiments on KSL candidates.

cond-mat.str-el↗

arXiv2017

A Novel Projected Two Binary Variables Formulation for Unit Commitment Problem

The thermal unit commitment (UC) problem often can be formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. In this paper, with projecting unit generation level onto [0,1] and reformulation techniques, a novel two binary (2-bin) variables MIQP formulation for UC problem is presented. We show that 2-bin formulation is more compact than the state-of-the-art one binary (1-bin) variable formulation and three binary (3-bin) variables formulation. Moreover, 2-bin formulation is tighter than 1-bin and 3-bin formulations in quadratic cost function, and it is tighter than 1-bin formulation in linear constraints. Three mixed integer linear programming (MILP) formulations can be obtained from three UC MIQPs by replacing the quadratic terms in the objective functions by a sequence of piece-wise perspective-cuts. 2-bin MILP is also the best one due to the similar reasons of MIQP. The simulation results for realistic instances that range in size from 10 to 200 units over a scheduling period of 24 hours show that the proposed 2-bin formulations are competitive with currently state-of-the-art formulations and promising for large-scale UC problems.

math.OC↗