A Universal Two--Bit Gate for Quantum Computation

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.Comment: 3 pages, RevTeX, two figures in a uuencoded fil

From quantum circuits to adiabatic algorithms

This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically, we look for a smooth time-dependent Hamiltonian whose unique ground state slowly changes from the initial state of the circuit to its final state. Since this construction requires in general an n-local Hamiltonian, we will study whether approximation is possible using previous results on ground state entanglement and perturbation theory. Finally we will point out how the adiabatic model can be relaxed in various ways to allow for 2-local partially adiabatic algorithms as well as 2-local holonomic quantum algorithms.Comment: Version accepted by and to appear in Phys. Rev.

Geometric phases induced in auxiliary qubits by many-body systems near its critical points

The geometric phase induced in an auxiliary qubit by a many-body system is calculated and discussed. Two kinds of coupling between the auxiliary qubit and the many-body system are considered, which lead to dephasing and dissipation in the qubit, respectively. As an example, we consider the XY spin-chain dephasingly couple to a qubit, the geometric phase induced in the qubit is presented and discussed. The results show that the geometric phase might be used to signal the critical points of the many-body system, and it tends to zero with the parameters of the many-body system going away from the critical points

Geometric phases in open systems: an exact model to study how they are corrected by decoherence

We calculate the geometric phase for an open system (spin-boson model) which interacts with an environment (ohmic or nonohmic) at arbitrary temperature. However there have been many assumptions about the time scale at which the geometric phase can be measured, there has been no reported observation yet for mixed states under nonunitary evolution. We study not only how they are corrected by the presence of the different type of environments but also estimate the corresponding times at which decoherence becomes effective. These estimations should be taken into account when planning experimental setups to study the geometric phase in the nonunitary regime, particularly important for the application of fault-tolerant quantum computation.Comment: Revtex 4, 5 pages, one eps figure. Version Publishe

Staying adiabatic with unknown energy gap

We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total evolution time. We test the algorithm on the Landau-Zener transition and then apply it on the quantum adiabatic computation of 3-SAT: The result is compatible with an exponential speed-up for up to twenty qubits with respect to classical algorithms. We finally study a possible algorithm improvement by combining it with the quantum Zeno effect.Comment: 4 pages, 4 figure

Efficient classical simulation of slightly entangled quantum computations

We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.Comment: 4 pages. Major changes. Significantly improved simulation schem

Geometric vs. Dynamical Gates in Quantum Computing Implementations Using Zeeman and Heisenberg Hamiltonians

Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction, which describe NMR and can also be realized in quantum dots and cold atoms. Using a novel physical representation of the qubit basis states, we construct $\pi/8$ and Hadamard gates based on Berry and Aharonov-Anandan phases. For two interacting qubits in a rotating field, we find that it is always impossible to construct a two-qubit gate based on Berry phases, or based on Aharonov-Anandan phases when the gyromagnetic ratios of the two qubits are equal. In implementing a universal set of quantum gates, one may combine geometric $\pi/8$ and Hadamard gates and dynamical $\sqrt{\rm SWAP}$ gate.Comment: published version, 5 page

Robust Multi-Partite Multi-Level Quantum Protocols

We present a tripartite three-level state that allows a secret sharing protocol among the three parties, or a quantum key distribution protocol between any two parties. The state used in this scheme contains entanglement even after one system is traced out. We show how to utilize this residual entanglement for quantum key distribution purposes, and propose a realization of the scheme using entanglement of orbital angular momentum states of photons.Comment: 9 pages, 2 figure

Geometric phase in dephasing systems

Beyond the quantum Markov approximation, we calculate the geometric phase of a two-level system driven by a quantized magnetic field subject to phase dephasing. The phase reduces to the standard geometric phase in the weak coupling limit and it involves the phase information of the environment in general. In contrast with the geometric phase in dissipative systems, the geometric phase acquired by the system can be observed on a long time scale. We also show that with the system decohering to its pointer states, the geometric phase factor tends to a sum over the phase factors pertaining to the pointer states.Comment: 4 page

Schmidt Analysis of Pure-State Entanglement

We examine the application of Schmidt-mode analysis to pure state entanglement. Several examples permitting exact analytic calculation of Schmidt eigenvalues and eigenfunctions are included, as well as evaluation of the associated degree of entanglement.Comment: 5 pages, 3 figures, for C.M. Bowden memoria