Calculation of resonances and product state distributions for the unimolecular dissociation of H2S

Resonance phenomena associated with the unimolecular dissociation of H2S --> SH + H have been investigated quantum mechanically by the Lanczos homogeneous filter diagonalization method using a newly developed potential energy surface (J. Chem. Phys. 2001, 114, 320). Resonance energies, widths (rates), and product state distributions have been obtained. Both dissociation rates and product state distributions of SH show, strong fluctuations, indicating that the dissociation of H2S is essentially irregular. Statistical analysis of neighboring level spacing and width distributions also confirms this behavior. The dissociation rates and product state distributions are compared to the predictions of quantum phase space theory.

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.

Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitary operations. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.

Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.

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.

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

Preparing encoded states in an oscillator

Recently a scheme has been proposed for constructing quantum error-correcting codes that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. One of the difficult steps in this scheme is the preparation of the encoded states. We show how these states can be generated by coupling a continuous quantum variable to a single qubit. An ion trap quantum computer provides a natural setting for a continuous system coupled to a qubit. We discuss how encoded states may be generated in an ion trap.

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.

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.

Design of microchannel free-space optical interconnects based on vertical-cavity surface-emitting laser arrays

We investigate the design of free-space optical interconnects (FSOIs) based on arrays of vertical-cavity surface-emitting lasers (VCSELs), microlenses, and photodetectors. We explain the effect of the modal structure of a multimodeVCSEL beam on the performance of a FSOI with microchannel architecture. A Gaussian-beam diffraction model is used in combination with the experimentally obtained spectrally resolved VCSEL beam profiles to determine the optical channel crosstalk and the signal-to-noise ratio (SNR) in the system. The dependence of the SNR on the feature parameters of a FSOI is investigated. We found that the presence of higher-order modes reduces the SNR and the maximum feasible interconnect distance. We also found that the positioning of a VCSEL array relative to the transmitter microlens has a significant impact on the SNR and the maximum feasible interconnect distance. Our analysis shows that the departure from the traditional confocal system yields several advantages including the extended interconnect distance and/or improved SNR. The results show that FSOIs based on multimode VCSELs can be efficiently utilized in both chip-level and board-level interconnects. (C) 2002 Optical Society of America.