Abstract: An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only two Heisenberg gate operations are required to produce a controlled $\ensuremath{\pi}$-phase shift, compared to nineteen for exchange-only proposals employing three spins. Evolved from well-studied decoherence-free subspaces, this architecture inherits immunity from collective decoherence mechanisms. The simplicity and adaptability of this approach should make it attractive for spin-based quantum computing architectures.

Abstract: Entanglement of two parts of a quantum system is a nonlocal property unaffected by local manipulations of these parts. It can be described by quantities invariant under local unitary transformations. Here we present, for a system of two qubits, a set of invariants which provides a complete description of nonlocal properties. The set contains 18 real polynomials of the entries of the density matrix. We prove that one of two mixed states can be transformed into the other by single-qubit operations if and only if these states have equal values of all 18 invariants. Corresponding local operations can be found efficiently. Without any of these 18 invariants the set is incomplete. Similarly, nonlocal, entangling properties of two-qubit unitary gates are invariant under single-qubit operations. We present a complete set of 3 real polynomial invariants of unitary gates. Our results are useful for optimization of quantum computations since they provide an effective tool to verify if and how a given two-qubit operation can be performed using exactly one elementary two-qubit gate, implemented by a basic physical manipulation (and arbitrarily many single-qubit gates). PACS: 03.67-a; 03.67.Lx

Abstract: We describe the operation and tolerances of a nondeterministic, coincidence basis, quantum controlled-NOT gate for photonic qubits. It is constructed solely from linear optical elements and requires only a two-photon source for its demonstration. Its success probability is 1/9.

Abstract: We propose an experimentally feasible scheme to achieve quantum computation based on nonadiabatic geometric phase shifts, in which a cyclic geometric phase is used to realize a set of universal quantum gates. Physical implementation of this set of gates is designed for Josephson junctions and for NMR systems. Interestingly, we find that the nonadiabatic phase shift may be independent of the operation time under appropriate controllable conditions. A remarkable feature of the present nonadiabatic geometric gates is that there is no intrinsic limitation on the operation time.

Abstract: Radio-frequency pulses are used in nuclear-magnetic-resonance spectroscopy to produce unitary transfer of states. Pulse sequences that accomplish a desired transfer should be as short as possible in order to minimize the effects of relaxation, and to optimize the sensitivity of the experiments. Many coherence-transfer experiments in NMR, involving a network of coupled spins, use temporary spin decoupling to produce desired effective Hamiltonians. In this paper, we demonstrate that significant time can be saved in producing an effective Hamiltonian if spin decoupling is avoided. We provide time-optimal pulse sequences for producing an important class of effective Hamiltonians in three-spin networks. These effective Hamiltonians are useful for coherence-transfer experiments in three-spin systems and implementation of indirect swap and ${\ensuremath{\Lambda}}_{2}(U)$ gates in the context of NMR quantum computing. It is shown that computing these time-optimal pulses can be reduced to geometric problems that involve computing sub-Riemannian geodesics. Using these geometric ideas, explicit expressions for the minimum time required for producing these effective Hamiltonians, transfer of coherence, and implementation of indirect swap gates, in a three-spin network are derived (Theorems 1 and 2). It is demonstrated that geometric control techniques provide a systematic way of finding time-optimal pulse sequences for transferring coherence and synthesizing unitary transformations in quantum networks, with considerable time savings (e.g., 42.3% for constructing indirect swap gates).

Abstract: A goal of quantum information technology is to control the quantum state of a system, including its preparation, manipulation, and measurement. However, scalability to many qubits and controlled connectivity between any selected qubits are two of the major stumbling blocks to achieve quantum computing (QC). Here we propose an experimental method, using Josephson charge qubits, to efficiently solve these two central problems. The proposed QC architecture is scalable since any two charge qubits can be effectively coupled by an experimentally accessible inductance. More importantly, we formulate an efficient and realizable QC scheme that requires only one (instead of two or more) two-bit operation to implement conditional gates.

Abstract: This paper gives a simple but nontrivial set of local transformation rules for control-NOT (CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, for any two equivalent circuits, S/sub 1/ and S/sub 2/, there is a sequence of transformations, each of them in the rule set, which changes S/sub 1/ to S/sub 2/. Our motivation is to use this rule set for developing a design theory for quantum circuits whose Boolean logic parts should be implemented by CNOT-based circuits. As a preliminary example, we give a design procedure based on the transformation rules which reduces the cost of CNOT-based circuits.

Abstract: Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting distributions of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.

Abstract: We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to implement the factorization algorithm. The circuit is computable in polynomial time on a classical computer and is completely general as it does not rely on any property of the number to be factored. Keywords: Factorization, quantum circuits, modular arithmetics

Abstract: Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and, furthermore, that the number of gates required for precision e is only polynomial in log 1/e. Here we prove that using certain sets of base gates quantum compiling requires a string length that is linear in log 1/e, a result which matches the lower bound from counting volume up to constant factor.

Abstract: Recently it was realized that linear optics and photodetectors with feedback can be used for theoretically efficient quantum information processing. The first of three steps toward efficient linear optics quantum computation is to design a simple postselected gate that implements a nonlinear phase shift on one mode. Here a computational strategy is given for finding postselected gates for bosonic qubits with helper photons. A more efficient conditional sign flip gate is obtained. What is the maximum efficiency for such gates? This question is posed and it is shown that the probability of success cannot be 1.

Abstract: We study the effect of the spin-orbit interaction on quantum gate operations based on the spin exchange coupling where the qubit is represented by the electron spin in a quantum dot or a similar nanostructure Our main result is the exact cancellation of the spin-orbit effects in the sequence producing the quantum XOR gate for the ideal case where the pulse shapes of the exchange and spin-orbit interactions are identical For the nonideal case, the two pulse shapes can be made almost identical and the gate error is strongly suppressed by two small parameters, the spin-orbit constant and the deviation of the two pulse shapes We show that the dipole-dipole interaction leads only to very small errors in the XOR gate

Abstract: We demonstrate storage and manipulation of one qubit encoded into a decoherence-free subspace (DFS) of two nuclear spins using liquid state nuclear magnetic resonance techniques. The DFS is spanned by states that are unaffected by arbitrary collective phase noise. Encoding and decoding procedures reversibly map an arbitrary qubit state from a single data spin to the DFS and back. The implementation demonstrates the robustness of the DFS memory against engineered dephasing with arbitrary strength as well as a substantial increase in the amount of quantum information retained, relative to an un-encoded qubit, under both engineered and natural noise processes. In addition, a universal set of logical manipulations over the encoded qubit is also realized. Although intrinsic limitations prevent maintenance of full noise tolerance during quantum gates, we show how the use of dynamical control methods at the encoded level can ensure that computation is protected with finite distance. We demonstrate noise-tolerant control over a DFS qubit in the presence of engineered phase noise significantly stronger than observed from natural noise sources.

Abstract: We introduce quantum hybrid gates that act on qudits of different dimensions. In particular, we develop two representative two-qudit hybrid gates (SUM and SWAP) and many-qudit hybrid Toffoli and Fredkin gates. We apply the hybrid SUM gate to generating entanglement, and find that operator entanglement of the SUM gate is equal to the entanglement generated by it for certain initial states. We also show that the hybrid SUM gate acts as an automorphism on the Pauli group for two qudits of different dimension under certain conditions. Finally, we describe a physical realization of these hybrid gates for spin systems.

Abstract: A novel hexagonal binary-decision-diagram (BDD) quantum logic circuit approach for III-V quantum large scale integrated circuits is proposed and its basic feasibility is demonstrated. In this approach, a III-V hexagonal nanowire network is controlled by Schottky wrap gates (WPGs) to implement BDD logic architecture by path switching. A novel single electron BDD OR logic circuit is successfully fabricated on a GaAs nanowire hexagon and correct circuit operation has been confirmed from 1.5 K to 120 K, showing that the WPG BDD circuit can operate over a wide temperature range by trading off between the power-delay product and the operation temperature.

Abstract: A digital circuit is reversible if it maps each input vector into a unique output vector. Reversible circuits can lead to low-power CMOS implementations and are also of interest in optical and quantum computing. In this paper, we consider the synthesis of reversible logic assuming primitive reversible devices such as Feynman, Toffoli and Fredkin gates. In particular, we consider the use of Rademacher-Walsh spectral techniques and two-place decompositions of Boolean functions. Preliminary results are given for reversible and nonreversible functions and show that the approaches described do indeed show promise.

Abstract: In this paper initial experiments towards constructing simple quantum gates in a solid state material are presented. Instead of using specially tailored materials, the aim is to select a subset of randomly distributed ions in the material, which have the interaction necessary to control each other and therefore can be used to do quantum logic operations. The experimental results demonstrate that part of an inhomogeneously broadened absorption line can be selected as a qubit and that a subset of ions in the material can control the resonance frequency of other ions. This opens the way for the construction of quantum gates in rare-earth-ion doped crystals.

Abstract: We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In particular, geometric quantum computation may be achieved by eliminating the dynamic phase accumulated in the whole evolution. Therefore, both dynamic and geometric operations for quantum computation are workable in the present theory. Physical implementation of this set of gates is designed for NMR systems. Also interestingly, we show that a set of universal geometric quantum gates in NMR systems may be realized in one cycle by simply choosing specific parameters of the external rotating magnetic fields. In addition, we demonstrate explicitly a multiloop method to remove the dynamic phase in geometric quantum gates. Our results may provide useful information for the experimental implementation of quantum logical gates.

Abstract: In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.

Abstract: Summary form only given. Knill, Laflamme, and Milburn (2001) showed that probabilistic quantum logic devices could be implemented using only linear optical elements, additional ancilla photons, and post-selection based on the output of single-photon detectors. These devices produce the desired result with certainty when a specific output from the detectors is obtained, but that will only occur for some fraction of the events. Here we report the experimental demonstration of two logic devices of this kind, a destructive controlled-NOT gate and a quantum parity check. In each of these devices, two polarization-encoded qubits in the form of two single photons from a parametric down-conversion source are incident on a polarizing beam splitter.

Abstract: We present an open loop (bang-bang) scheme to control decoherence in a generic one-qubit quantum gate and implement it in a realistic simulation. The system is consistently described within the spin-boson model, with interactions accounting for both adiabatic and thermal decoherence. The external control is included from the beginning in the Hamiltonian as an independent interaction term. After tracing out the environment modes, reduced equations are obtained for the two-level system in which the effects of both decoherence and external control appear explicitly. The controls are determined exactly from the condition to eliminate decoherence, i.e. to restore unitarity. Numerical simulations show excellent performance and robustness of the proposed control scheme.

Abstract: We describe the basic principles of quantum information processing with cold neutral atoms on an atom chip.

Abstract: We have studied, by means of a Monte Carlo simulation, data propagation in quantum cellular automaton circuits, comparing the performance of nonclocked and clocked implementations. Based on two choices of fabrication parameters, we have evaluated the maximum achievable clock speed for different operating temperatures, concluding that better performance can be obtained with the clocked architecture, which, however, involves significant technological difficulties. The large discrepancy existing between a simple estimate of the cell switching time, based on the RC time constant, and our results is discussed and explained by means of an intuitive argument. Two different circuits have been investigated, a binary wire and a majority voting gate, obtaining analogous results, with a slightly smaller maximum clock rate for the majority voting gate, due to the larger number of cells involved.

Abstract: Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any n-bit unitary operation can be carried out by concatenations of 1-bit and 2-bit elementary quantum gates. Three contemporary quantum devices--cavity QED, ion traps and quantum dots--have been widely regarded as perhaps the most promising candidates for the construction of elementary quantum gates. In this paper, we describe the physical properties of these devices, and show the mathematical derivations based on the interaction of the laser field as control with atoms, ions or electron spins, leading to the following: (i) the 1-bit unitary rotation gates; and (ii) the 2-bit quantum phase gates and the controlled-not gate. This paper is aimed at providing a sufficiently self-contained survey account of analytical nature for mathematicians, physicists and computer scientists to aid interdisciplinary understanding in the research of quantum computation.

Abstract: In a previous paper a straight forward construction method for quantum error correcting codes, based on graphs, has been presented. These graph codes are directly related to cluster states which have been introduced by Briegel and Raussendorf. We show that the preparation of a cluster state as well as the coding operation for a graph code, can be implemented by a logical network. Concerning the qubit case each vertex corresponds to an Hadamard gate and each edge corresponds to a controlled not gate.

Abstract: A nondeterministic quantum CNOT gate (10) for photon qubits, with success probability 1/9, uses beamsplitters (B1-B5) with selected reflectivities to mix control and target input modes. It may be combined with an atomic quantum memory to construct a deterministic CNOT gate, with applications in quantum computing and as a Bell-state analyser.