Decoherence of geometric phase gates

We consider the effects of certain forms of decoherence applied to both adiabatic and non-adiabatic geometric phase quantum gates. For a single qubit we illustrate path-dependent sensitivity to anisotropic noise and for two qubits we quantify the loss of entanglement as a function of decoherence.Comment: 4 pages, 3 figure

Efficient Algorithms for Universal Quantum Simulation

A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed

On the relationship between continuous- and discrete-time quantum walk

Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case. In this article, I describe a precise correspondence between continuous- and discrete-time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.Comment: 22 pages. v2: improved presentation, new section on Hamiltonian oracles; v3: published version, with improved analysis of phase estimatio

Neoplastic transformation of mouse C3H 10T1/2 and Syrian hamster embryo cells by heavy ions

C3H 10T1/2 mouse-embryo fibroblasts were used for transformation experiments to study the effectiveness of various heavy ions with energies up to 20 MeV/u and LET values from 170 to 16.000 keV/μm. The transformation frequency per unit absorbed dose decreased with increasing ionization density; at the highest values of LET we found a decrease even of the transformation efficiency per unit fluence. Uranium ions at energies of 5, 9, and 16.3 MeV/u did not induced any transformation. In additional studies piimary Syrian hamster embryo cells (SHE) were exposed to heavy ions in order to characterize cytological and molecular changes which may be correlated with neoplastic transformation. Growth behaviour, chromosomal status, tumorigenicity in nude mice, and expression of oncogenes of transformed cell lines were examined

Efficiency of free energy calculations of spin lattices by spectral quantum algorithms

Quantum algorithms are well-suited to calculate estimates of the energy spectra for spin lattice systems. These algorithms are based on the efficient calculation of the discrete Fourier components of the density of states. The efficiency of these algorithms in calculating the free energy per spin of general spin lattices to bounded error is examined. We find that the number of Fourier components required to bound the error in the free energy due to the broadening of the density of states scales polynomially with the number of spins in the lattice. However, the precision with which the Fourier components must be calculated is found to be an exponential function of the system size.Comment: 9 pages, 4 figures; corrected typographical and minor mathematical error

Secure quantum key distribution using squeezed states

We prove the security of a quantum key distribution scheme based on transmission of squeezed quantum states of a harmonic oscillator. Our proof employs quantum error-correcting codes that encode a finite-dimensional quantum system in the infinite-dimensional Hilbert space of an oscillator, and protect against errors that shift the canonical variables p and q. If the noise in the quantum channel is weak, squeezing signal states by 2.51 dB (a squeeze factor e^r=1.34) is sufficient in principle to ensure the security of a protocol that is suitably enhanced by classical error correction and privacy amplification. Secure key distribution can be achieved over distances comparable to the attenuation length of the quantum channel.Comment: 19 pages, 3 figures, RevTeX and epsf, new section on channel losse

Quantum information processing using Josephson junctions coupled through cavities

Josephson junctions have been shown to be a promising solid-state system for implementation of quantum computation. The significant two-qubit gates are generally realized by the capacitive coupling between the nearest neighbour qubits. We propose an effective Hamiltonian to describe charge qubits coupled through the cavity. We find that nontrivial two-qubit gates may be achieved by this coupling. The ability to interconvert localized charge qubits and flying qubits in the proposed scheme implies that quantum network can be constructed using this large scalable solid-state system.Comment: 5 pages, to appear in Phys Rev A; typos corrected, solutions in last eqs. correcte