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.展开更多
针对量子索引图像在量子计算机信息安全领域中的应用问题,本文提出一种基于分量和(sum of components,SoC)的量子索引图像信息隐藏算法。量子索引图像包括数据矩阵和调色板2种数据结构。基于SoC的量子索引图像信息隐藏算法首先根据颜色...针对量子索引图像在量子计算机信息安全领域中的应用问题,本文提出一种基于分量和(sum of components,SoC)的量子索引图像信息隐藏算法。量子索引图像包括数据矩阵和调色板2种数据结构。基于SoC的量子索引图像信息隐藏算法首先根据颜色值分量和的奇偶性(1或0)和颜色值距离,为量子调色板中每一个颜色匹配一个符合条件的颜色组成颜色对;嵌入消息时,根据颜色对和消息比特对量子数据矩阵的像素索引值进行更新;提取消息时,量子索引图像每个像素颜色值分量和的奇偶性即为嵌入的消息,属于盲提取算法。此方法可在未来量子计算机上执行。根据经典计算机上的仿真结果从视觉质量、嵌入容量、鲁棒性和安全性4个方面验证了该方法的有效性。展开更多
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.展开更多
When the Grover＇ s original algorithm is applied to search an unordered database, the success probability decreases rapidly with the increase of marked items. Aiming at this problem, a general quantum search algorith...When the Grover＇ s original algorithm is applied to search an unordered database, the success probability decreases rapidly with the increase of marked items. Aiming at this problem, a general quantum search algorithm with small phase rotations is proposed. Several quantum search algorithms can be derived from this algorithm according to different phase rotations. When the size of phase rotations are fixed at 0. 01π, the success probability of at least 99. 99% can be obtained in 0（√N/M） iterations.展开更多
基金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.
文摘针对量子索引图像在量子计算机信息安全领域中的应用问题,本文提出一种基于分量和(sum of components,SoC)的量子索引图像信息隐藏算法。量子索引图像包括数据矩阵和调色板2种数据结构。基于SoC的量子索引图像信息隐藏算法首先根据颜色值分量和的奇偶性(1或0)和颜色值距离,为量子调色板中每一个颜色匹配一个符合条件的颜色组成颜色对;嵌入消息时,根据颜色对和消息比特对量子数据矩阵的像素索引值进行更新;提取消息时,量子索引图像每个像素颜色值分量和的奇偶性即为嵌入的消息,属于盲提取算法。此方法可在未来量子计算机上执行。根据经典计算机上的仿真结果从视觉质量、嵌入容量、鲁棒性和安全性4个方面验证了该方法的有效性。
基金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.
基金Supported by National Natural Science Foundation of China （ No. 60773065 ）.
文摘When the Grover＇ s original algorithm is applied to search an unordered database, the success probability decreases rapidly with the increase of marked items. Aiming at this problem, a general quantum search algorithm with small phase rotations is proposed. Several quantum search algorithms can be derived from this algorithm according to different phase rotations. When the size of phase rotations are fixed at 0. 01π, the success probability of at least 99. 99% can be obtained in 0（√N/M） iterations.
