A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is...A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.展开更多
For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best coo...For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.展开更多
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack prob...The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.展开更多
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal...The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.展开更多
This paper proposes an efficient framework to utilize quantum search practically.To the best of our knowledge,this is the first paper to show a concrete usage of quantum search in general programming.In our framework,...This paper proposes an efficient framework to utilize quantum search practically.To the best of our knowledge,this is the first paper to show a concrete usage of quantum search in general programming.In our framework,we can utilize a quantum computer as a coprocessor to speed-up some parts of a program that runs on a classical computer.To do so,we propose several new ideas and techniques,such as a practical method to design a large quantum circuits for search problems and an efficient quantum comparator.展开更多
基金the National Natural Science Foundation of China (50138010)
文摘A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.
基金supported by the National Natural Science Foundation of China(61571149)the Special China Postdoctoral Science Foundation(2015T80325)+2 种基金the Heilongjiang Postdoctoral Fund(LBH-Z13054)the China Scholarship Council and the Fundamental Research Funds for the Central Universities(HEUCFP201772HEUCF160808)
文摘For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.
基金supported by the National Natural Science Foundation of China(70871081)the Shanghai Leading Academic Discipline Project(S30504).
文摘The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.
基金the National Natural Science Foundation of China (60773065).
文摘The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
文摘This paper proposes an efficient framework to utilize quantum search practically.To the best of our knowledge,this is the first paper to show a concrete usage of quantum search in general programming.In our framework,we can utilize a quantum computer as a coprocessor to speed-up some parts of a program that runs on a classical computer.To do so,we propose several new ideas and techniques,such as a practical method to design a large quantum circuits for search problems and an efficient quantum comparator.
