Implementing the quantum random walk

Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the variance on the line, and the mixing time on the circle increase quadratically faster in the quantum versions as compared to the classical versions. Here, we propose a scheme to implement the quantum random walk on a line and on a circle in an ion trap quantum computer. With current ion trap technology, the number of steps that could be experimentally implemented will be relatively small. However, we show how the enhanced features of these walks could be observed experimentally. In the limit of strong decoherence, the quantum random walk tends to the classical random walk. By measuring the degree to which the walk remains quantum, '' this algorithm could serve as an important benchmarking protocol for ion trap quantum computers.

Coherent superposition states as quantum rulers

We explore the sensitivity of an interferometer based on a quantum circuit for coherent states. We show that its sensitivity is at the Heisenberg limit. Moreover, we show that this arrangement can measure very small length intervals.

Nondeterministic gates for photonic single-rail quantum logic

We discuss techniques for producing, manipulating, and measuring qubits encoded optically as vacuum- and single-photon states. We show that a universal set of nondeterministic gates can be constructed using linear optics and photon counting. We investigate the efficacy of a test gate given realistic detector efficiencies.

A simple formula for the average gate fidelity of a quantum dynamical operation

This Letter presents a simple formula for the average fidelity between a unitary quantum gate and a general quantum operation on a qudit, generalizing the formula for qubits found by Bowdrey et al. [Phys. Lett. A 294 (2002) 258]. This formula may be useful for experimental determination of average gate fidelity. We also give a simplified proof of a formula due to Horodecki et al. [Phys. Rev. A 60 (1999) 1888], connecting average gate fidelity to entanglement fidelity. (C) 2002 Elsevier Science B.V. All rights reserved.

Qudit quantum-state tomography

Recently quantum tomography has been proposed as a fundamental tool for prototyping a few qubit quantum device. It allows the complete reconstruction of the state produced from a given input into the device. From this reconstructed density matrix, relevant quantum information quantities such as the degree of entanglement and entropy can be calculated. Generally, orthogonal measurements have been discussed for this tomographic reconstruction. In this paper, we extend the tomographic reconstruction technique to two new regimes. First, we show how nonorthogonal measurements allow the reconstruction of the state of the system provided the measurements span the Hilbert space. We then detail how quantum-state tomography can be performed for multiqudits with a specific example illustrating how to achieve this in one- and two-qutrit systems.

Quantum Parrondo's games

Parrondo's paradox arises when two losing games are combined to produce a winning one. A history-dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state, a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case. (C) 2002 Elsevier Science B.V. All rights reserved.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

Quantum dynamical characterization of unimolecular resonances

We give a selective review of quantum mechanical methods for calculating and characterizing resonances in small molecular systems, with an emphasis on recent progress in Chebyshev and Lanczos iterative methods. Two archetypal molecular systems are discussed: isolated resonances in HCO, which exhibit regular mode and state specificity, and overlapping resonances in strongly bound HO2, which exhibit irregular and chaotic behavior. Future directions in this field are also discussed.

A comparative study of iterative Chebyshev and Lanczos implementations of the boundary inhomogeneity method for quantum scattering

We have recently developed a scaleable Artificial Boundary Inhomogeneity (ABI) method [Chem. Phys. Lett.366, 390–397 (2002)] based on the utilization of the Lanczos algorithm, and in this work explore an alternative iterative implementation based on the Chebyshev algorithm. Detailed comparisons between the two iterative methods have been made in terms of efficiency as well as convergence behavior. The Lanczos subspace ABI method was also further improved by the use of a simpler three-term backward recursion algorithm to solve the subspace linear system. The two different iterative methods are tested on the model collinear H+H2 reactive state-to-state scattering.

Experimental investigation of continuous-variable quantum teleportation

We report the experimental demonstration of quantum teleportation of the quadrature amplitudes of a light field. Our experiment was stably locked for long periods, and was analyzed in terms of fidelity F and with signal transfer T-q=T++T- and noise correlation V-q=Vinparallel to out+Vinparallel to out-. We observed an optimum fidelity of 0.64+/-0.02, T-q=1.06+/-0.02, and V-q=0.96+/-0.10. We discuss the significance of both T-q>1 and V-q

Biased EPR entanglement and its application to teleportation

We consider pure continuous variable entanglement with non-equal correlations between orthogonal quadratures. We introduce a simple protocol which equates these correlations and in the process transforms the entanglement onto a state with the minimum allowed number of photons. As an example we show that our protocol transforms, through unitary local operations, a single squeezed beam split on a beam splitter into the same entanglement that is produced when two squeezed beams are mixed orthogonally. We demonstrate that this technique can in principle facilitate perfect teleportation utilizing only one squeezed beam.

Optical experiments beyond the quantum limit: Squeezing entanglement and teleportation

Results of experiments recently performed are reported, in which two optical parametric amplifiers were set up to generate two independently quadrature squeezed continuous wave laser beams. The transformation of quadrature squeezed states into polarization squeezed states and into states with spatial quantum correlations is demonstrated. By utilizing two squeezed laser beams, a polarization squeezed state exhibiting three simultaneously squeezed Stokes operator variances was generated. Continuous variable polarization entanglement was generated and the Einstein-Podolsky-Rosen paradox was observed. A pair of Stokes operators satisfied both the inseparability criterion and the conditional variance criterion. Values of 0.49 and 0.77, respectively, were observed, with entanglement requiring values below unity. The inseparability measure of the observed quadrature entanglement was 0.44. This value is sufficient for a demonstration of quantum teleportation, which is the next experimental goal of the authors.