Preparation of quantum state lies at the heart information processing. The greedy algorithm provides a potential method to effectively prepare states. However, standard algorithm, in general, cannot take global maxima and instead becomes stuck on local maxima. Based this paper we propose revised version design dynamic pulses realize universal preparation, i.e., preparing any arbitrary from anot...

In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achiev...

In data warehouses, views or summaries can be materialized to obtain better performance. In this paper, the near greedy algorithm for views selection is proposed. It is a generalization of the greedy algorithm for views selection and defines a class of solutions existing in the range between the optimal and the greedy solutions. At each of its iterations, the algorithm selects multiple views in...

The greedy algorithm is extensively studied in the field of combinatorial optimization for decades. In this paper, we address the online learning problem when the input to the greedy algorithm is stochastic with unknown parameters that have to be learned over time. We first propose the greedy regret and -quasi greedy regret as learning metrics comparing with the performance of offline greedy al...