An innovative perspective of usage of intelligent agents and multi-agent systems in quantum computing is presented. quantum computation is the extension of classical computation to the processing of quantum informatio...
详细信息
ISBN:
(纸本)1581138644
An innovative perspective of usage of intelligent agents and multi-agent systems in quantum computing is presented. quantum computation is the extension of classical computation to the processing of quantuminformation based on physical two-state quantum systems. quantumalgorithms require the determinism and reliability of classical control for the execution of suitable quantum circuits consisting of a finite sequence of quantum gates and measurement operations. quantum computational information agents (QCIA) can exploit oracle-based quantum search algorithms for searching local data or knowledge bases and perform quantum matchmaking.
quantuminformation theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of informationprocessing tasks, including data storage, comput...
quantuminformation theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of informationprocessing tasks, including data storage, computation, communication, and cryptography. Efficient quantumalgorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantuminformation that are robust against errors, which is an important step toward building practical quantuminformationprocessing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantuminformation via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantuminformation distributed between several oscillators. Toric codes provide encodings of quantuminformation into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present a
In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier-to-measure quantities x(1),..., x(n) which ...
详细信息
In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier-to-measure quantities x(1),..., x(n) which are related to y by a known relation y = f (x(1),..., x(n)). Measurements are never 100% accurate;hence, the measured values (x) over tilde (i) are different from x(i), and the resulting estimate (y) over tilde = f((x) over tilde (i),..., (x) over tilde (n)) is different from the desired value y = f (x(1),..., x(n)). How different can it be ? Traditional engineering approach to error estimation in data processing assumes that we know the probabilities of different measurement errors Deltax(i) (=) def (x) over tilde (i) - x(i). In many practical situations, we only know the upper bound Delta(i) for this error;hence, after the measurement, the only information that we have about x(i) is that it belongs to the interval x(i) (=) def [(x) over tilde (i)- Delta(i), (x) over tilde (i) + Delta(i)]. In this case, it is important to find the range y of all possible values of y = f (x(i),..., x(n)) when x(i) epsilon x(i). We start the paper with a brief overview of the computational complexity of the corresponding interval computation problems: Most of the related problems turn out to be, in general, at least NP-hard. In this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether (and how) "hypothetic" physical devices can compute NP-hard A problems faster than in exponential time. Most of the paper's results were first presented at NAFIPS'2003 [30]. (C) 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
In this paper an attempt is made to implement associative memory with quantum neural networks. The quantumalgorithms for the storage of pattern and the retrieval of information are presented. It is shown that the cap...
详细信息
ISBN:
(纸本)0780384032
In this paper an attempt is made to implement associative memory with quantum neural networks. The quantumalgorithms for the storage of pattern and the retrieval of information are presented. It is shown that the capacity and the processing speed of the quantum neural network increase exponentially compared to the conventional model. The neural computing method for the calculation of quantum entanglement is also discussed.
This work proposes a new kind of evolutionary algorithm inspired in the principles of quantum computing. This algorithm is an extension of a proposed model for combinatorial optimization problems which uses a binary r...
详细信息
In this paper an attempt is made to implement associative memory with quantum neural networks. The quantumalgorithms for the storage of pattern and the retrieval of information are presented. It is shown that the cap...
详细信息
ISBN:
(纸本)0780384032
In this paper an attempt is made to implement associative memory with quantum neural networks. The quantumalgorithms for the storage of pattern and the retrieval of information are presented. It is shown that the capacity and the processing speed of the quantum neural network increase exponentially compared to the conventional model. The neural computing method for the calculation of quantum entanglement is also discussed.
quantuminformation and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks (Nielsen and Chunag, 2000). In the few short years that this appr...
详细信息
quantuminformation and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks (Nielsen and Chunag, 2000). In the few short years that this approach has been studied, a number of remarkable concepts and results have emerged, most notably:a couple of spectacular algorithms and a number of information protocols, exemplified by quantum teleportation, which exploit quantum entanglement in an essential fashion. The current tools available for developing quantumalgorithms and protocols are deficient on two main levels: firstly, they are too low-level and at a more fundamental level, the standard mathematical framework for quantum mechanics (which is essentially due to von Neumann (1932)) is actually insufficiency comprehensive for informatic purposes. In joint work with Bob Coecke, we have recently made some striking progress in addressing both these points. They have recast the von Neumann formalism at a more abstract and conceptual level, using category theory.
In this paper, a novel kind of algorithm, called the self-adaptive chaos quantum clonal evolutionary programming algorithms-SCQP, is proposed based on the quantum theory and the Chaos Mutation
In this paper, a novel kind of algorithm, called the self-adaptive chaos quantum clonal evolutionary programming algorithms-SCQP, is proposed based on the quantum theory and the Chaos Mutation
In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum...
详细信息
In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum collapse. The algorithm has better diversity than its counterpart. In addition, the quantum evolutionary operator - quantum mutation is constructed, which is used to speed up the convergence. Rapid convergence and global search capacity characterize the performance of QGA. The paper also gives some simulation experiments to prove its superiority over the classical genetic algorithm.
暂无评论