Optimized quantum singular value thresholding algorithm based on a hybrid quantum computer

Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.The existing all-qubit QSVT algorithm demands lots of ancillary qubits,remaining a huge challenge for realization on nearterm intermediate-scale quantum computers.In this paper,we propose a hybrid QSVT(HQSVT) algorithm utilizing both discrete variables(DVs) and continuous variables(CVs).In our algorithm,raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations.Our algorithm requires O [log(MN)] qubits with0(1) qumodes and totally performs 0(1) operations,which significantly reduces the space and runtime consumption.

Short-term photovoltaic power prediction using combined K-SVD-OMP and KELM method

For photovoltaic power prediction,a kind of sparse representation modeling method using feature extraction techniques is proposed.Firstly,all these factors affecting the photovoltaic power output are regarded as the input data of the model.Next,the dictionary learning techniques using the K-mean singular value decomposition(K-SVD)algorithm and the orthogonal matching pursuit(OMP)algorithm are used to obtain the corresponding sparse encoding based on all the input data,i.e.the initial dictionary.Then,to build the global prediction model,the sparse coding vectors are used as the input of the model of the kernel extreme learning machine(KELM).Finally,to verify the effectiveness of the combined K-SVD-OMP and KELM method,the proposed method is applied to a instance of the photovoltaic power prediction.Compared with KELM,SVM and ELM under the same conditions,experimental results show that different combined sparse representation methods achieve better prediction results,among which the combined K-SVD-OMP and KELM method shows better prediction results and modeling accuracy.

Distributed Radar Target Tracking with Low Communication Cost

In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating positioning accuracy often occupies many bits,the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication chan-nels.This paper studies how to compress data for distributed tracking fusion algorithms.Based on the K-singular value decomposition(K-SVD)algorithm,a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix.Then the least square quantization(LSQ)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.