Catálogo de publicaciones - libros

NMR has been considered as one of the most effective physical system to realize quantum computation. As multiple-quantum operator algebra theory mentioned, any unitary transformation can be decomposed into a sequence of a limited number of one-qubit quantum gates and two-qubit diagonal gates. Based on these backgrounds, we proposed the method to design NMR pulse sequences to implement Generalized Quantum Search Algorithm with arbitrary phase rotation, and, experimental finished the algorithm with different phase rotations respectively in a two-qubit system, on a Quantum Computer Emulator.

Based on the quantum algorithms for approximating the mean of p -summable sequences, we develop quantum algorithms for approximating the integration from anisotropic and generalized Sobolev classes. Then we analyze query error of these algorithms and prove their optimality. It is proved that for these classes of functions the optimal convergence rates of quantum algorithms are essential smaller than those of classical deterministic and randomized algorithms. Our results extend recent works of Heinrich on classical Sobolev classes.

All-or-Nothing Disclosure of Secrets, or ANDOS for brevity, is an interesting cryptographic task, which involves two parties, say Alice and Bob. Alice has a few secrets, which she regards as equally valuable. She would like to sell any of them to Bob, with the guarantee that no information about the other secrets will be obtained if he pays for only one secret. Moreover, Bob can freely choose his secret and wants to ensure that Alice can obtain no information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security and is able to contain arbitrary number of secrets.

A secure quantum broadcasting scheme is proposed by means of a secure quantum lock, which is implemented by the legal communicators using the the generators of the stabilizer of a stabilizer quantum code (SQC). The advantages of the proposed scheme for the designed lock is that it can be implemented in the noisily broadcasting channel. Based on physics of the quantum system, the secret messages are broadcasted to the legal users in the noisy environments with unconditionally security.

A quantum algorithm which allows one to simulate the quantum open-loop control systems is presented. We study the model of steering a spin 1/2 particle via externally electromagnetic fields in detail. Simulation results obtained from the quantum circuit confirm the validity of our approach.

Inspired by Membrane Computing, this paper presents an optimization algorithm for the problems with large feasible space and large parameters. The algorithm consists of two parts. One is to determine the good area and another is a fast searching tool.The comparisons among some evolutionary algorithms illuminate that the algorithm is simple and computes fast with high precision on optimal problems.

Cellular automata are a very powerful and well researched area in computer science. We use approaches from the cellular automata research to solve optimization problems in the multi agent system research area. For this purpose, we require a transformation from agents located in an Euclidean space into an abstract cell assignment for cellular automata. In this paper, a mapping function is presented and evaluated with a reverse function. This function can be calculated by each agent individually based only on local information. Additionally, we examine the performance of the function in inexact and non-deterministic environments.

This paper proposes a Clonal Selection Algorithm for Multimodal function optimization (CSAM) based on the concepts of artificial immune system and antibody clonal selection theory. In CSAM, more attention is paid to locate all the peaks (both global and local ones) of multimodal optimization problems. To achieve this purpose, new clonal selection operator is put forward, dynamic population size and clustering radius are also used not only to locate all the peaks as many as possible, but assure no resource wasting, i.e., only one antibody will locate in each peak. Finally, new performances are also presented for multimodal function when there is no prior idea about it in advance. Our experiments demonstrated that CSAM is very effective in dealing with multimodal optimization regardless of global or local peaks.

This paper proposes a novel grid intrusion detection model based on immune agent ( GIDIA ), and gives the concepts and formal definitions of self , nonself , antibody , antigen , agent and match algorithm in the grid security domain. Then, the mathematical models of mature MoA (mature monitoring agent), and dynamic memory MoA (memory monitoring agent) survival are established. Besides, effects of the important parameter T in the model of mature MoA on system performance are showed. Our theoretical analysis and experimental results show that the model that has higher detection efficiency and steadier detection performance than the current models is a good solution to grid intrusion detection.

A novel model of artificial immune network is presented at first, and then a simulative research work is made on its dynamic behaviors. Simulation results show that the limit cycle and chaos may exist simultaneously when four units are in connection, and the network’s characteristic has a close relationship with the intensity of suppressor T-cell’s function, B-cell’s characteristics and transconductance. Besides this, with Liapunov’s method, the sufficient conditions for network’s stability is studied, especially for the case of system’s characteristics under the condition that the helper T-cells appear as a nonlinear function.