Abstract: This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

Abstract: We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on traditional quantum teleportation [Gottesman and Chuang, Nature (London) 402, 390 (1999)] and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the $\ensuremath{\pi}/8$ and Toffoli gates. The technique can also be applied to the construction of remote quantum operations that cannot be directly performed.

Abstract: We investigate the minimal resources that are required in the local implementation of nonlocal quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We present general statements on the minimal resource requirements and present optimal procedures for a number of important gates, including controlled-NOT (CNOT) and Toffoli gates. We show that one bit of classical communication in each direction is both necessary and sufficient for the nonlocal implementation of the quantum CNOT, while in general two bits in each direction is required for the implementation of a general two-bit quantum gate. In particular, the state swapper requires this maximum classical communication overhead. Extensions of these ideas to multiparty gates are presented.

Abstract: We theoretically study specific schemes for performing a fundamental two-qubit quantum gate via controlled atomic collisions by switching microscopic potentials. In particular we calculate the fidelity of a gate operation for a configuration where a potential barrier between two atoms is instantaneously removed and restored after a certain time. Possible implementations could be based on microtraps created by magnetic and electric fields, or potentials induced by laser light.

Abstract: We describe in detail a set of ideas for implementing qubits, quantum gates, and quantum gate networks in a semiconductor heterostructure device. Our proposal is based on an extension of the technology used for surface acoustic wave (SAW) based single-electron transport devices. These devices allow single electrons to be captured from a two-dimensional electron gas in the potential minima of a SAW. We discuss how this technology can be adapted to allow the capture of electrons in pure spin states and how both single and two-qubit gates can be constructed using magnetic and nonmagnetic gate technology. We give designs for readout gates to allow the spin state of the electrons to be measured and discuss how combinations of gates can be connected to make multiqubit networks. Finally we consider decoherence and other sources of error, and how they can be minimized for our design.

Abstract: We present an alternative scheme for the generation of a two-qubit quantum gate interaction between laser-cooled trapped ions. The scheme is based on the ac Stark shift (light shift) induced by laser light resonant with the ionic transition frequency. At specific laser intensities, the shift of the ionic levels allows the resonant excitation of transitions involving the exchange of motional quanta. We compare the performance of this scheme with respect to that of related ion-trap proposals and find that, for an experimental realization using traveling-wave radiation and working in the Lamb-Dicke regime, an improvement of over an order of magnitude in the gate switching rate is possible.

Abstract: An architecture for a quantum computer is presented in which spins associated with donors in silicon function as qubits. Quantum operations on the spins are performed using a combination of voltages applied to gates adjacent to the spins and radio frequency magnetic fields applied resonant with spin transitions. Initialization and measurement of electron spins is made by electrostatic probing of a two electron system, whose orbital configuration must depend on the spin states of the electrons because of the Pauli Principle. Specific devices will be discussed which perform all the necessary operations for quantum computing, with an emphasis placed on a qualitative presentation of the principles underlying their operation. The likely impediments to achieving large-scale quantum computation using this architecture will be addressed: the computer must operate at extremely low temperature, must be fabricated from devices built with near atomic precision, and will require extremely accurate gating operations in order to perform quantum logic. Refinements to the computer architecture will be presented which could remedy each of these deficiencies. I will conclude by discussing a possible specific realization of the computer using Si/SixGe1–x heterostructures into which donors are deposited using a low energy focused ion beam.

Abstract: A methodology and an algorithm for programming a quantum logic algorithm is described In one embodiment, an algorithm for generating a quantum gate is described The quantum gate describes the evolution of the quantum computing algorithm and is used to implement a desired quantum algorithm In one embodiment, the quantum gate is used in a quantum search algorithm to search a number of local solution spaces to find a global solution to be used in a control system to control a plant In one embodiment, the quantum search algorithm is an iterative algorithm and an entropy-based basis for stopping the iterations is described In one embodiment, the quantum search algorithm is used to improve a genetic optimizer in the control system

Abstract: We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and immediate prospects for quantum information processing in ion traps. We discuss decoherence and gate rates in ion traps, comparing methods based on the vibrational motion with a method based on exchange of photons in cavity QED. We then sketch the main features of a quantum computer designed to allow an algorithm needing 10^6 Toffoli gates on 100 logical qubits. We find that around 200 ion traps linked by optical fibres and high-finesse cavities could perform such an algorithm in a week to a month, using components at or near current levels of technology.

Abstract: We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and immediate prospects for quantum information processing in ion traps. We discuss decoherence and gate rates in ion traps, comparing methods based on the vibrational motion with a method based on exchange of photons in cavity QED. We then sketch the main features of a quantum computer designed to allow an algorithm needing 10 6 Toffoli gates on 100 logical qubits. We find that around 200 ion traps linked by optical fibres and high-finesse cavities could perform such an algorithm in a week to a month, using components at or near current levels of technology.

Abstract: We review recent proposals for performing entanglement manipulation via cold collisions between neutral atoms. State-dependent, time-varying trapping potentials allow one to control the interaction between atoms, so that conditional phase shifts realizing a universal quantum gate can be obtained with high fidelity. We discuss possible physical implementations with existing experimental techniques, for example optical lattices and magnetic micro-traps.

Abstract: 1H–13C heteronuclear dipolar couplings are used to produce the NMR (nuclear magnetic resonance) version of a two bit controlled-NOT quantum logic gate. This gate is coupled with the Hadamard gate to complete a circuit which generates the Einstein–Podolsky–Rosen (EPR) state which is the maximally entangled state of a pair of spins. The EPR state is crucial for the potential exponential speed advantage of quantum computers over their classical counterparts. We sample the deviation density matrix of the two spin system to verify the presence of the EPR state. EPR state lifetimes are also measured with this technique, thereby demonstrating the viability of liquid crystals as a platform for quantum computing.

Abstract: Lloyd [Phys. Rev. Lett. 75, 346 (1995)] showed that almost every quantum logic gate is universal in the sense that it can be used to approximate any unitary transformation. The argument relied on a more general fact whose proof was not given in detail. We give a complete proof of this more general fact.

Abstract: An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR implementation of the Deutsch-Jozsa algorithm for functions with three argument bits and demonstrates a technique essential for multi-qubit quantum computation.

Abstract: Much of the current understanding of logic gates for quantum computation relies on the application of one- and two-qubit gates in order to implement a universal set of logic gates, as well as other gates. Such ideas stem from the notion that the Hamiltonians available for quantum computation are one or two-body processes. However, present day NMR implementations of quantum information processing (QIP) rely on the internal Hamiltonian of a liquid state system in which there are many two-body processes that occur simultaneously. Such use of the internal Hamiltonian allows for the creation of `multiqubit' logic gates, i.e. logic gates that operate on many qubits simultaneously and are more efficient than a sequence of one- and two-qubit rotations that effect the same operation. Such larger qubit operations offer a universal set of gates (even when not all couplings within the internal Hamiltonian are readily accessible) as well as more convenient and efficient implementations of the Hadamard transform, the controlled-NOT gate, and a quantum Fourier transform that scales linearly (assuming all couplings can be turned on and off at will).

Abstract: A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In an earlier paper (quant-ph/0010071) application of Clifford algebras to constructions of universal sets of binary quantum gates $U_k \in U(2^n)$ was shown. For application of a similar approach to non-binary quantum gates $U_k \in U(l^n)$ in present work is used rational noncommutative torus ${\Bbb T}^{2n}_{1/l}$. A set of universal non-binary two-gates is presented here as one example.

Abstract: The origin of errors in quantum computation implemented by linear optics is studied. The systematic errors of quantum gates, phase relaxation, amplitude dumping, and misreadout are considered as error sources, and the errors which occurred in a four-bit Deutsch-Jozsa algorithm experiment are categorized according to the sources. The increase in the error rate with the expansion of the input size in the Deutsch-Jozsa algorithm is also studied and it was found that the demonstration of 11 qubits using linear optics and a single photon with less than a 20% error rate is achievable by the technique used in the experiment.

Abstract: Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is daunting, involving capabilities well beyond the present state of the art. In this report we develop a significant simplification of these requirements that can be applied in many recent solid-state approaches, using quantum dots [2], and using donor-atom nuclear spins [3] or electron spins [4]. In these approaches, the basic two-qubit quantum gate is generated by a tunable Heisenberg interaction (the Hamiltonian is $H_{ij}=J(t){\vec S}_i\cdot{\vec S}_j$ between spins $i$ and $j$), while the one-qubit gates require the control of a local Zeeman field. Compared to the Heisenberg operation, the one-qubit operations are significantly slower and require substantially greater materials and device complexity, which may also contribute to increasing the decoherence rate. Here we introduce an explicit scheme in which the Heisenberg interaction alone suffices to exactly implement any quantum computer circuit, at a price of a factor of three in additional qubits and about a factor of ten in additional two-qubit operations. Even at this cost, the ability to eliminate the complexity of one-qubit operations should accelerate progress towards these solid-state implementations of quantum computation.

Abstract: We present ways of realizing quantum cloning via stimulated emission. Universality of the cloning procedure is achieved by choosing systems that have appropriate symmetries. We first discuss a scheme based on certain three-level systems, e.g. atoms in a cavity. Our numerical results show that this scheme approaches optimal cloning for short interaction times. Then we demonstrate that optimal universal cloning can be realized using parametric down-conversion. At the same time, our down-conversion scheme also implements the optimal universal NOT operation. We conclude with some remarks on cloning and superluminal signalling, using our cloner as an illustrative example.

Abstract: Using virtual spin formalism it is shown that a quantum particle with eight energy levels can store three qubits. The formalism allows to realize a universal set of quantum gates. Feasible formalism implementation is suggested which uses nuclear spin-7/2 as a storage medium and radio frequency pulses as the gates. One pulse realization of all universal gates has been found, including three-qubit Toffoli gate.

Abstract: We propose a new approach to the implementation of quantum gates in which decoherence during the gate operations is strongly reduced. This is achieved by making use of an environment induced quantum Zeno effect that confines the dynamics effectively to a decoherence-free subspace.

Abstract: Using nuclear magnetic resonance techniques with a solution of cytosine molecules, we show an implementation of certain quantum logic gates (including NOT gate, square-root of NOT gate and controlled-NOT gate), which have central importance in quantum computing. In addition, experimental results show that nuclear magnetic resonance spectroscopy can efficiently measure the result of quantum computing without attendant wave-functions collapse.

Abstract: We present a novel method of performing quantum logic gates in trapped ion quantum computers which does not require the ions to be cooled down to the ground state of their vibrational modes, thereby avoiding one of the principal experimental difficulties encountered in realizing this technology. Our scheme employs adiabatic passages and a phase shift conditional on the phonon number state.

Abstract: Candidates for quantum computing which offer only restricted control, e.g. due to lack of access to individual qubits, are not useful for general purpose quantum computing. We present concrete proposals for the use of systems with such limitations as RISQ-reduced instruction set quantum computers and devices-for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables. These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in premature prototypes of quantum computers.

Abstract: We report exact solutions of the Poyatos–Cirac–Zoller quantum gate system withtwo trapped ions [Phys. Rev. Lett.81, 1322 (1998)]. It is the superposition ofentangled states among the pure states of two harmonic oscillators and describesa mixed mode involving the center-of-mass and relative motions withcommensurable frequencies. Theoretical analysis of the exact solutions showsthat for a given trapping frequency the relative motion cannot be laser-cooled.

Abstract: The total information content of a composite system consisting of k qubits can either be completely encoded in a specific computational basis, or alternatively it can be partially encoded in a number of different bases. In that case the information encoded in a complete set of mutually complementary bases is again k bits. Using only two single-qubit gates and the controlled-NOT gate, one can implement coding and decoding in such a complete set. The total information content is then invariant under the particular choice of a complete set of mutually complementary bases. For maximally entangled states the k bits of information are not encoded into the k qubits separately but only into their joint properties.